Abstract
This paper addresses the backbone augmentation problem arising from ISP’s hierarchical link-state routing operations. Focusing on Virtual Link (VL) configuration, proposed is an efficient augmentation scheme of increasing redundancy of the original backbone topology. A VL restores hidden information from introducing hierarchy in the topological database of each backbone router, thereby increasing redundancy of the backbone and preventing partition of the backbone even if some links fail. With given potential VL locations and the original backbone topology, we propose a bi-objective efficient VL configuration model that explicitly evaluates the benefit side as well as the cost side of VL configurations, and fully leverages the trade-off between both sides. Furthermore, provided is an efficient branch-and-bound algorithm (implicit enumeration) with good lower and upper bounds so that solution speed can be accelerated in most cases. To our knowledge, this is the first try to attack the VL configuration problem systematically. For an ISP with its own domain, the proposed model and algorithm are expected to relieve network administrators burden of configuring VLs, support making the backbone more tolerable to backbone link failures, and finally, provide a practical vehicle for reliable link-state hierarchical routing indispensable to overall service quality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Behrens, J. and Garcia-Luna-Aceves, J.J. (1998) Hierarchical routing using link vectors, Proceedings of IEEE INFOCOM 98, 702–710
Moy, J.T. (1998) OSPF: Anatomy of an Internet Routing Protocol, Addison Wesley
Thomas, M.T. II. (1998) OSPF Network Design Solutions, Cisco Press
Tsai, W.T., C.V. Ramamoorthy, W.K. Tsai, and O. Nishiguchi (1989) An adaptive hierarchical routing protocol, IEEE Transaction on Computers, 38 1059–1075
Kim, D. and Tcha, D.W., Scalable domain partitioning in Internet OSPF routing, Telecommunications System, forth-coming
Halabi, S. (1996) OSPF design guide, Cisco Systems Network Supported Accounts (white paper)
Hu, T.C. (1982) Combinatorial Algorithms, Addison Wesley
Grotschel, M., C.L. Monma, and M. Stoer (1995) Design of survivable networks (in Network Models, eds. M.O. Ball et al.), North-Holland
Padberg, M. and Rinaldi, G. (1990) An efficient algorithm for the minimum capacity cut problem, Mathematical Programming, 47,19–36
Clemen, R.T. (1996) Making Hard Decisions: an Introduction to Decision Analysis, 2nd ed., Duxbury Press
Zegura, E.W., Calvert, K.L., and Bhattacharjee, S. (1996) How to model an internetwork, Proceedings of IEEE INFOCOM 96, 594–602
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London Limited
About this paper
Cite this paper
Kim, DH., Lee, SH., Tcha, DW. (2001). ISP’s Internet Backbone Augmentation using Virtual Link Configuration in Link-state Routing. In: Goto, K., Hasegawa, T., Takagi, H., Takahashi, Y. (eds) Performance and QoS of Next Generation Networking. Springer, London. https://doi.org/10.1007/978-1-4471-0705-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0705-7_7
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1183-2
Online ISBN: 978-1-4471-0705-7
eBook Packages: Springer Book Archive