ISP’s Internet Backbone Augmentation using Virtual Link Configuration in Link-state Routing

  • Do-Hoon Kim
  • Soon-Ho Lee
  • Dong-Wang Tcha
Conference paper


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.


Decision Alternative Virtual Link Network Administrator Connectivity Level Implicit Enumeration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Behrens, J. and Garcia-Luna-Aceves, J.J. (1998) Hierarchical routing using link vectors, Proceedings of IEEE INFOCOM 98, 702–710Google Scholar
  2. [2]
    Moy, J.T. (1998) OSPF: Anatomy of an Internet Routing Protocol, Addison WesleyGoogle Scholar
  3. [3]
    Thomas, M.T. II. (1998) OSPF Network Design Solutions, Cisco PressGoogle Scholar
  4. [4]
    Tsai, W.T., C.V. Ramamoorthy, W.K. Tsai, and O. Nishiguchi (1989) An adaptive hierarchical routing protocol, IEEE Transaction on Computers, 38 1059–1075CrossRefGoogle Scholar
  5. [5]
    Kim, D. and Tcha, D.W., Scalable domain partitioning in Internet OSPF routing, Telecommunications System, forth-comingGoogle Scholar
  6. [6]
    Halabi, S. (1996) OSPF design guide, Cisco Systems Network Supported Accounts (white paper)Google Scholar
  7. [7]
    Hu, T.C. (1982) Combinatorial Algorithms, Addison WesleyMATHGoogle Scholar
  8. [8]
    Grotschel, M., C.L. Monma, and M. Stoer (1995) Design of survivable networks (in Network Models, eds. M.O. Ball et al.), North-HollandGoogle Scholar
  9. [9]
    Padberg, M. and Rinaldi, G. (1990) An efficient algorithm for the minimum capacity cut problem, Mathematical Programming, 47,19–36MathSciNetMATHCrossRefGoogle Scholar
  10. [10]
    Clemen, R.T. (1996) Making Hard Decisions: an Introduction to Decision Analysis, 2nd ed., Duxbury PressGoogle Scholar
  11. [11]
    Zegura, E.W., Calvert, K.L., and Bhattacharjee, S. (1996) How to model an internetwork, Proceedings of IEEE INFOCOM 96, 594–602Google Scholar

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • Do-Hoon Kim
    • 1
  • Soon-Ho Lee
    • 2
  • Dong-Wang Tcha
    • 3
  1. 1.Graduate School of Management, KAISTSeoulKorea
  2. 2.Graduate School of Management, KAISTKorea
  3. 3.Graduate School of Management, KAISTKorea

Personalised recommendations