By Topic

Enhancing the network scalability of link-state routing protocols by reducing their flooding overhead

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
$31 $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

3 Author(s)
Miyamura, T. ; NTT Network Service Syst. Labs., NTT Corp., Musashino, Japan ; Kurimoto, T. ; Aoki, M.

We consider scalability issues of routing protocols for large-scale networks. Link-state routing protocols play an important role in generalized multiprotocol label switching (GMPLS) networks based on photonic technologies as well as in conventional packet-based IP networks. The scalability of a link-state routing protocol mainly depends on the overhead of protocol-related messages, which are disseminated by flooding. We propose ways to reduce this overhead in link-state routing protocols such as OSPF and IS-IS, and also present extensions to OSPF that provide support for our techniques. The basic approach is to limit the sets of neighboring nodes in the flooding of link-state information, while maintaining reliability in the distribution of link-state information. We also report on extensive simulation to evaluate the performance of our algorithm in terms of reducing the flooding overhead. Our algorithm provides improved network scalability as well as efficient and reliable convergence of routing information.

Published in:

High Performance Switching and Routing, 2003, HPSR. Workshop on

Date of Conference:

24-27 June 2003