Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/815
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorWu, J-
dc.creatorDai, F-
dc.creatorLin, X-
dc.creatorCao, J-
dc.creatorJia, W-
dc.date.accessioned2014-12-11T08:24:17Z-
dc.date.available2014-12-11T08:24:17Z-
dc.identifier.issn0018-9340-
dc.identifier.urihttp://hdl.handle.net/10397/815-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_US
dc.rightsThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.en_US
dc.subjectFault toleranceen_US
dc.subjectInterneten_US
dc.subjectLink-stateen_US
dc.subjectLoop-freeen_US
dc.subjectRoutingen_US
dc.titleAn extended fault-tolerant link-state routing protocol in the interneten_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1298-
dc.identifier.epage1311-
dc.identifier.volume52-
dc.identifier.issue10-
dc.identifier.doi10.1109/TC.2003.1234527-
dcterms.abstractLink-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet today. In link-state routing protocols, global network topology information is first collected at each node. A shortest path tree (SPT) is then constructed by applying Dijkstra's shortest path algorithm at each node. Link-state protocols usually require the flooding of new information to the entire (sub)network after changes in any link state (including link faults). Narvaez et al. proposed a fault-tolerant link-state routing protocol without flooding. The idea is to construct a shortest restoration path for each unidirectional link fault. Faulty link information is distributed only to the nodes in the restoration path and only one restoration path is constructed. It is shown that this approach is loop-free. However, the Narvaez et al. approach is inefficient when a link failure is bidirectional because a restoration path is unidirectional and routing tables of nodes in the path are partially updated. In addition, two restoration paths may be generated for each bidirectional link fault. In this paper, we extend the Narvaez et al. protocol to efficiently handle a bidirectional link fault by making the restoration path bidirectional. Several desirable properties of the proposed extended routing protocol are also explored. A simulation study is conducted to compare the traditional link-state protocol, the source-tree protocol, the Narvaez et al. unidirectional restoration path protocol, and the proposed bidirectional restoration path protocol.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on computers, Oct. 2003, v. 52, no. 10, p. 1298-1311-
dcterms.isPartOfIEEE transactions on computers-
dcterms.issued2003-10-
dc.identifier.isiWOS:000185519500006-
dc.identifier.scopus2-s2.0-0142039783-
dc.identifier.eissn1557-9956-
dc.identifier.rosgroupidr16920-
dc.description.ros2003-2004 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
fault-tolerant_03.pdf2.57 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

76
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

74
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.