Abstract
This paper addresses the scalability problem arising from rapidly increasing routing overhead at network expansion. Focusing on the OSPF (Open Shortest Path First) protocol, we propose a hierarchical routing scheme of partitioning a routing domain into areas. Supplemented to the scheme is a step to reinforce system performances, particularly reliability, against possible degradation from domain partitioning. For an Internet service provider with its own domain, the framework provides a practical vehicle for scalable hierarchical routing indispensable to overall service quality. Due to the unavailability of similar studies, a simple experiment with a small network is reported on, in place of extensive comparative testing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.O. Ball, Complexity of network reliability computations, Networks 10 (1980) 153–165.
M.O. Ball and C.J. Colbourn, Network reliability, in: Network Models, eds. M.O. Ball et al. (North-Holland, Amsterdam, 1995).
A.E. Baratz and J.M. Jaffe, Establishing virtual circuits in large computer networks, Computer Networks and ISDN Systems 12 (1986) 27–37.
J. Behrens and J.J. Garcia-Luna-Aceves, Hierarchical routing using link vectors, in: Proceedings of IEEE INFOCOM'98 (1998) pp. 702–710.
D. Farinacci, Introduction to enhanced IGRP (EIGRP), Cisco Systems (July 1993).
J.J. Garcia-Luna-Aceves and N. Shacham, Analysis of routing strategies for packet radio networks, in: Proceedings of IEEE INFOCOM'85 (1985) pp. 292–302.
M. Grotschel, C.L. Monma and M. Stoer, Design of survivable networks, in: Network Models, eds. M.O. Ball et al. (North-Holland, Amsterdam, 1995).
S. Halabi, OSPF design guide, Cisco Systems Network Supported Accounts (1996).
C. Hedrick, Routing information protocol, Request for Comments #1058 (1988).
J.M. Jaffe, Hierarchical clustering with topology database, Computer Networks and ISDN Systems 15 (1988) 329–339.
D. Kim and D.w. Tcha, Hierarchical routing protocols and scalable clustering models: mainly on OSPF protocol, working paper (1998) (in Korean).
D. Kim, B.S. Min and D.w. Tcha, Overlaid BSHR design, working paper (1999).
L. Kleinrock and F. Kamoun, Hierarchical routing for large networks: Performance evaluation and optimization, Computer Networks 1 (1977) 155–174.
J.M. McQuillan, Adaptive routing algorithms for distributed computer networks, BBN Report No. 2831, Bolt Beranek and Newman Inc. (1974).
J. Moy, OSPF protocol analysis, Request for Comments #1245 (1991).
J. Moy, OSPF version 2, Request for Comments #1583 (1994).
J. Moy, Multicast routing extension for OSPF, Communications of the ACM 37 (1994) 61–67.
J. Moy, OSPF database overflow, Request for Comments #1765 (1995).
Y.S. Myung, H.J. Kim and D.w. Tcha, Design of communication networks with survivability constraints, Management Science 45 (1999) 238–252.
A. Sutter, F. Vanderbeck and L. Wolsey, Optimal placement of add/drop multiplexers: Heuristic and exact algorithm, Operations Research 46 (1998) 719–728.
W.T. Tsai, C.V. Ramamoorthy, W.K. Tsai and O. Nishiguchi, An adaptive hierarchical routing protocol, IEEE Transaction on Computers 38 (1989) 1059–1075.
E.W. Zegura, K.L. Calvert and S. Bhattacharjee, How to model an internetwork, in: Proceedings of IEEE INFOCOM'96 (1996) pp. 594–602.
Final Report on a study on high-speed computer networking and service development, KTRC (December 1995) (in Korean).
Rights and permissions
About this article
Cite this article
Kim, D., Tcha, D. Scalable domain partitioning in Internet OSPF routing. Telecommunication Systems 15, 113–127 (2000). https://doi.org/10.1023/A:1019178409003
Issue Date:
DOI: https://doi.org/10.1023/A:1019178409003