Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1015467.1015493acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

Network sensitivity to hot-potato disruptions

Published: 30 August 2004 Publication History

Abstract

Hot-potato routing is a mechanism employed when there are multiple (equally good) interdomain routes available for a given destination. In this scenario, the Border Gateway Protocol (BGP) selects the interdomain route associated with the closest egress point based upon intradomain path costs. Consequently, intradomain routing changes can impact interdomain routing and cause abrupt swings of external routes, which we call hot-potato disruptions. Recent work has shown that hot-potato disruptions can have a substantial impact on large ISP backbones and thereby jeopardize the network robustness. As a result, there is a need for guidelines and tools to assist in the design of networks that minimize hot-potato disruptions. However, developing these tools is challenging due to the complex and subtle nature of the interactions between exterior and interior routing. In this paper, we address these challenges using an analytic model of hot-potato routing that incorporates metrics to evaluate network sensitivity to hot-potato disruptions. We then present a methodology for computing these metrics using measurements of real ISP networks. We demonstrate the utility of our model by analyzing the sensitivity of a large AS in a tier~1 ISP network.

References

[1]
Y. Rekhter and T. Li, "A Border Gateway Protocol 4 (BGP-4)." RFC 1771, March 1995.]]
[2]
J. Moy, "OSPF Version 2." RFC 2328, April 1998.]]
[3]
R. Callon, "Use of OSI IS--IS for Routing in TCP/IP and Dual Environments." RFC1195, December 1990.]]
[4]
R. Teixeira, A. Shaikh, T. Griffin, and J. Rexford, "Dynamics of Hot-Potato Routing in IP Networks," in Proc. ACM SIGMETRICS, June 2004.]]
[5]
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford, "NetScope: Traffic Engineering for IP Networks," IEEE Network Magazine, pp. 11--19, March 2000.]]
[6]
B. Fortz, J. Rexford, and M. Thorup, "Traffic Engineering with Traditional IP Routing Protocols," IEEE Communication Magazine, October 2002.]]
[7]
B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS Weights in a Changing World," IEEE J. Selected Areas in Communications, vol. 20, no. 4, pp. 756--767, 2002.]]
[8]
N. Feamster, J. Winick, and J. Rexford, "A Model of BGP Routing for Network Engineering," in Proc. ACM SIGMETRICS, June 2004.]]
[9]
S. Agarwal, C.-N. Chuah, S. Bhattacharyya, and C. Diot, "Impact of BGP Dynamics on Intra-Domain Traffic," in Proc. ACM SIGMETRICS, June 2004.]]
[10]
S. Halabi and D. McPherson, Internet Routing Architectures. Cisco Press, second~ed., 2001.]]
[11]
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, "Deriving Traffic Demands for Operational IP Networks: Methodology and Experience," IEEE/ACM Trans. Networking, vol. 9, June 2001.]]
[12]
A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "A Taxonomy of IP Traffic Matrix Estimation: Existing Techiniques and New Directions," in Proc. ACM SIGCOMM, August 2002.]]
[13]
Y. Zhang, M. Roughan, C. Lund, and D. Donoho, "An Information-Theoretic Approach to Traffic Matrix Estimation," in Proc. ACM SIGCOMM, August 2003.]]
[14]
T. G. Griffin and G. Wilfong, "On the Correctness of IBGP Configuration," in Proc. ACM SIGCOMM, August 2002.]]
[15]
J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, "Data cube: A Relational Aggregation Operator Generalizing Group-by, Cross-tabs and Subtotals," Data Mining and Knowledge Discovery, no. 1, pp. 29--53, 1997.]]
[16]
S. Chaudhuri and U. Dayal, "An Overview of Data Warehousing and OLAP Technology," ACM SIGMOD Record, vol. 26, March 1997.]]
[17]
A. Gupta, V. Harinarayan, and D. Quass, "Aggregate query processing in data warehousing environments," in VLDB, pp. 358--369, 1995.]]
[18]
A. Shaikh and A. Greenberg, "OSPF Monitoring: Architecture, Design and Deployment Experience," in Proc. USENIX Symposium on Networked Systems Design and Implementation, March 2004.]]
[19]
"BGP Best Path Selection Algorithm." http://www.cisco.com/warp/public/459/25.shtml.]]
[20]
A. Lakhina, K. Papagiannaki, M. Crovella, C. Diot, E. Kolaczyk, and N. Taft, "Structural analysis of network traffic flows," in Proc. ACM SIGMETRICS, June 2004.]]

Cited By

View all
  • (2023)Segment Routing Traffic Engineering by Pruned Landmark Labeling2023 IEEE/ACIS 8th International Conference on Big Data, Cloud Computing, and Data Science (BCD)10.1109/BCD57833.2023.10466314(237-244)Online publication date: 14-Dec-2023
  • (2015)A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade NetworksACM SIGCOMM Computer Communication Review10.1145/2829988.278749545:4(15-28)Online publication date: 17-Aug-2015
  • (2015)A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade NetworksProceedings of the 2015 ACM Conference on Special Interest Group on Data Communication10.1145/2785956.2787495(15-28)Online publication date: 17-Aug-2015
  • Show More Cited By

Index Terms

  1. Network sensitivity to hot-potato disruptions

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2004
      402 pages
      ISBN:1581138628
      DOI:10.1145/1015467
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 34, Issue 4
        October 2004
        385 pages
        ISSN:0146-4833
        DOI:10.1145/1030194
        Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 30 August 2004

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. BGP
      2. IGP
      3. OSPF
      4. hot-potato routing
      5. network robustness
      6. sensitivity analysis

      Qualifiers

      • Article

      Conference

      SIGCOMM04
      Sponsor:
      SIGCOMM04: ACM SIGCOMM 2004 Conference
      August 30 - September 3, 2004
      Oregon, Portland, USA

      Acceptance Rates

      Overall Acceptance Rate 462 of 3,389 submissions, 14%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)72
      • Downloads (Last 6 weeks)6
      Reflects downloads up to 01 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)Segment Routing Traffic Engineering by Pruned Landmark Labeling2023 IEEE/ACIS 8th International Conference on Big Data, Cloud Computing, and Data Science (BCD)10.1109/BCD57833.2023.10466314(237-244)Online publication date: 14-Dec-2023
      • (2015)A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade NetworksACM SIGCOMM Computer Communication Review10.1145/2829988.278749545:4(15-28)Online publication date: 17-Aug-2015
      • (2015)A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade NetworksProceedings of the 2015 ACM Conference on Special Interest Group on Data Communication10.1145/2785956.2787495(15-28)Online publication date: 17-Aug-2015
      • (2014)Violation of Interdomain Routing AssumptionsProceedings of the 15th International Conference on Passive and Active Measurement - Volume 836210.1007/978-3-319-04918-2_17(173-182)Online publication date: 10-Mar-2014
      • (2012)BGP Churn Evolution: A Perspective From the CoreIEEE/ACM Transactions on Networking10.1109/TNET.2011.216861020:2(571-584)Online publication date: Apr-2012
      • (2012)Multi-Objective Traffic Engineering for Future NetworksIEEE Communications Letters10.1109/LCOMM.2011.110711.11207116:1(101-103)Online publication date: Jan-2012
      • (2012)Impact analysis of BGP sessions for prioritization of maintenance operationsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2012.03.00356:8(2206-2220)Online publication date: 1-May-2012
      • (2011)Introducing energy-awareness in traffic engineering for future networksProceedings of the 7th International Conference on Network and Services Management10.5555/2147671.2147736(367-370)Online publication date: 24-Oct-2011
      • (2011)Route flap damping made usableProceedings of the 12th international conference on Passive and active measurement10.5555/1987510.1987525(143-152)Online publication date: 20-Mar-2011
      • (2011)Graceful network state migrationsIEEE/ACM Transactions on Networking10.1109/TNET.2010.209760419:4(1097-1110)Online publication date: 1-Aug-2011
      • Show More Cited By

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media