Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

IGP link weight assignment for operational Tier-1 backbones

Published: 01 August 2007 Publication History

Abstract

Intradomain routing protocols, such as IS-IS or OSPF, associate a weight (or cost) with each link to compute traffic routes. Proposed methods for selecting link weights largely ignore two practical issues, that of service-level agreement (SLA) requirements and of failures. Optimizing the routing configuration, without bounding the SLA, could severely violate this requirement, which is one of the most important vehicles used by carriers to attract new customers. Since most failures are short-lived, it is much more practical not to have to change weight settings during these episodes. In this paper we propose a Tabu-search heuristic for choosing link weights that takes into account both SLA requirements and link failures. Our algorithm selects link weights that still perform well, without having to be changed, even under failure events. To validate the heuristic, we develop a lower bound based on a formal integer linear program (ILP) model, and show that our heuristic solution is within 10% of the optimal ILP lower bound. We study the performance of the heuristic using two operational Tier-1 backbones. Our results illustrate two tradeoffs, between link utilization and the SLA provided, and between performance under failures versus performance without failures. We find that performance under transient failures can be dramatically improved at the expense of a small degradation during normal network operation (i.e., no failures), while simultaneously satisfying SLA requirements. We use our algorithm inside a prototype tool to conduct a case study and illustrate how systematic link weight selection can facilitate topology planning.

References

[1]
{1} S. Bhattacharyya, N. Taft, J. Jetcheva, and C. Diot, "POP-level and access-link-level traffic dynamics in a Tier-1 POP," in Proc. 1st ACM SIGCOMM Internet Measurement Workshop (IMW), San Francisco, CA, Nov. 2001.
[2]
{2} B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. EEE INFOCOM, Tel-Aviv, Israel, Mar. 2000.
[3]
{3} B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing World," IEEE J. Sel. Areas Commun., vol. 20, no. 4, pp. 765-767, 2001.
[4]
{4} B. Fortz and M. Thorup, Fortifying OSPF/IS-IS against link failures. {Online}. Available: http://www.research.att.com/mthorup/PAPERS/ papers.html Tech. Rep.
[5]
{5} M. Pioro, A. Szentesi, J. Harmatos, A. Juttner, P. Gajowniczek, and S. Kozdrowski, "On OSPF related network optimisation problems," in Proc. IFIP ATM IP, Ilkley, U.K., Jul. 2000.
[6]
{6} F. Giroire, A. Nucci, N. Taft, and C. Diot, "Increasing the robustness of IP backbones in the absence of optical level protection," in Proc. IEEE INFOCOM, Apr. 2003.
[7]
{7} F. Glover and M. Laguna, Tabu Search. Amsterdam, The Netherlands: Kluwer.
[8]
{8} S. Halabi, Internet Routing Architectures, 2nd ed. Indianapolis, IN: Cisco, 2001.
[9]
{9} J. Harmatos, "A heuristic algorithm for solving the static weight assignment optimisation problem in OSPF networks," in Proc. Global Internet Conf., Dallas, TX, Nov. 2001.
[10]
{10} G. Iannaccone, C. Chuah, R. Mortier, S. Bhattacharyya, and C. Diot, "Analysis of link failures in a large IP backbone," in Proce. 2nd ACM SIGCOMM Internet Measurement Workshop (IMW), San Francisco, CA, Nov. 2002.
[11]
{11} M. Krunz, B. Zhang, and C. Chen, "Stateless QOS routing in IP networks," in Proce. Global Internet Workshop, Dallas, TX, Nov. 2001.
[12]
{12} ILOG CPLEX. {Online}. Available: http://www.ilog.com/products/ cplex/
[13]
{13} A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: Comparisons and new directions," in Proc. ACM SIGCOMM, Pittsburgh, PA, Aug. 2002.
[14]
{14} A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft, and C. Diot, "Link weight assignment for transient link failures," in 18th Int. Teletraffic Congr. (ITC), Sep. 2003.
[15]
{15} D. Applegate and E. Cohen, "Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs," in ACM SIGCOMM, Aug. 2003.
[16]
{16} D. Oran, "OSI IS-IS Intradomain Routing Protocol," IETF Request For Comments 1142.
[17]
{17} K. Papagiannaki, R. Cruz, and C. Diot, "Network performance monitoring at small time scales," in ACM Internet Measurement Conf., Miami, FL, Oct. 2003.
[18]
{18} K. Papagiannaki, S. Moon, C. Fraleigh, P. Thiran, F. Tobagi, and C. Diot, "Analysis of measured single-hop delay from an operational backbone network," in Proc. IEEE INFOCOM, New York, Jun. 2002.
[19]
{19} Y. Wang, Z. Wang, and L. Zhang, "Internet traffic engineering without full mesh overlaying," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001.
[20]
{20} S. Agarwal, A. Nucci, and S. Bhattacharyya, "Measuring the shared fate of IGP engineering and interdomain traffic," in IEEE Int. Conf. NP, Nov. 2005.

Cited By

View all
  • (2016)An evolvable network design approach with topological diversityComputer Communications10.1016/j.comcom.2015.10.00976:C(101-110)Online publication date: 15-Feb-2016
  • (2016)Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problemApplied Intelligence10.1007/s10489-016-0776-045:3(598-621)Online publication date: 1-Oct-2016
  • (2012)Joint coverage and link utilization for fast IP local protectionComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2012.06.01756:15(3385-3400)Online publication date: 1-Oct-2012
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 15, Issue 4
August 2007
243 pages

Publisher

IEEE Press

Publication History

Published: 01 August 2007
Published in TON Volume 15, Issue 4

Author Tags

  1. failures
  2. interior gateway protocol (IGP) routing
  3. intermediate system to intermediate system (IS-IS) protocol
  4. open shortest path first (OSPF) protocol
  5. optimization
  6. robustness
  7. tabu search
  8. traffic engineering

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2016)An evolvable network design approach with topological diversityComputer Communications10.1016/j.comcom.2015.10.00976:C(101-110)Online publication date: 15-Feb-2016
  • (2016)Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problemApplied Intelligence10.1007/s10489-016-0776-045:3(598-621)Online publication date: 1-Oct-2016
  • (2012)Joint coverage and link utilization for fast IP local protectionComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2012.06.01756:15(3385-3400)Online publication date: 1-Oct-2012
  • (2012)Permutation routing for increased robustness in IP networksProceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I10.1007/978-3-642-30045-5_17(217-231)Online publication date: 21-May-2012
  • (2011)Network architecture for joint failure recovery and traffic engineeringACM SIGMETRICS Performance Evaluation Review10.1145/2007116.200712839:1(97-108)Online publication date: 7-Jun-2011
  • (2011)Network architecture for joint failure recovery and traffic engineeringProceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems10.1145/1993744.1993756(97-108)Online publication date: 7-Jun-2011
  • (2011)On the feasibility and efficacy of protection routing in IP networksIEEE/ACM Transactions on Networking10.1109/TNET.2011.212391619:5(1543-1556)Online publication date: 1-Oct-2011
  • (2011)Graceful network state migrationsIEEE/ACM Transactions on Networking10.1109/TNET.2010.209760419:4(1097-1110)Online publication date: 1-Aug-2011
  • (2011)Scalable and systematic Internet-wide path and delay estimation from existing measurementsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2010.10.00455:3(838-855)Online publication date: 1-Feb-2011
  • (2010)On the feasibility and efficacy of protection routing in IP networksProceedings of the 29th conference on Information communications10.5555/1833515.1833699(1235-1243)Online publication date: 14-Mar-2010
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media