By Topic

New rerouting link-state algorithm using connected dominating set

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Jayashree ; Sch. of Comput. Sci. & Eng., Anna Univ., India ; V. Rhymend Uthariaraj

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.

Published in:

Information, Communications and Signal Processing, 2003 and Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint Conference of the Fourth International Conference on  (Volume:3 )

Date of Conference:

15-18 Dec. 2003