New rerouting link-state algorithm using connected dominating set

This article focuses on an efficient rerouting algorithm in wired network for a failed link using connected dominating set (CDS), a graph theory based concept. As the problem of link failure thawed the researcher to derive a method with loop-free manner, this ACDS (adaptive CDS) can grantee a loop-free and hassle tussle free incorporation to the link-state algorithm. The algorithm has been modified to withstand the link failure when it has to handle other path forwarding mechanism for a normal routing. The results show that the performance in-terms of end-to-end delay and packet delivery ratio is better than the existing method for single link failure.