Abstmct-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 linkstate routing protocol mainly depends on the overhead of protocol-related messages, which are disseminated by flooding. In this article, 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 reducting the flooding overhead. Our algorithm provides improved network scalability as well as efficient and reliable convergence of routing information.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.