skip to main content
10.1145/1403027.1403042acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Trading potatoes in distributed multi-tier routing systems

Published: 22 August 2008 Publication History

Abstract

The The Internet is an example of a distributed system where the task of routing is performed in a multi-tier fashion: interdomain paths between autonomously-managed networks are sub ject to a global agreement (BGP), and the choice of intradomain paths is left to the discretion of each such network. When forwarding packets, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot potato routing. As a result, paths in the Internet are suboptimal from a global perspective. In this paper we explore complementary deviations from hot-potato routing in a manner which benefits both ASes. We show that even for a pair of ASes obtaining such path trading solutions is NP-complete, and give pseudo-polynomial algorithms to find them. We use PoP-level maps of ASes obtained from measurements of real AS topologies in the Internet to show that, in comparison to hot-potato routing, path trading can substantially reduce the cost of intradomain routing.

References

[1]
D. Feldman. and Y. Shavitt. Automatic large scale generation of PoP level maps. In GLOBECOM 2008, December 2008.
[2]
R. Johari and J. Tsitsiklis. Routing and peering in a competitive internet. In Decision and Control, volume 2, pages 1556--1561, 2004.
[3]
Peter B. Key, Laurent Massoulié, and Donald F. Towsley. Path selection and multipath congestion control. In INFOCOM, pages 143--151, 2007.
[4]
R. Mahajan, D. Wetherall, and T. Anderson. Negotiation-based routing between neighboring isps. In Second Networked System Design and Implementation, May 2005.
[5]
John F. Nash. The bargaining problem. Econometrica, 18:155--162, 1950.
[6]
Yuval Shavitt and Eran Shir. DIMES: Let the internet measure itself. ACM SIGCOMM Computer Communication Review, 35(5), October 2005.
[7]
Gireesh Shrimali, Aditya Akella, and Almir Mutapcic. Cooperative inter-domain traffic engineering using nash bargaining and decomposition. In INFOCOM, pages 330--338, 2007.
[8]
Neil T. Spring, Ratul Mahajan, David Wetherall, and Thomas E. Anderson. Measuring isp topologies with rocketfuel. IEEE/ACM Trans. Netw., 12(1):2--16, 2004.
[9]
Renata Teixeira, Aman Shaikh, Timothy Griffin, and Jennifer Rexford. Dynamics of hot-potato routing in ip networks. In SIGMETRICS, pages 307--319, 2004.

Cited By

View all

Index Terms

  1. Trading potatoes in distributed multi-tier routing systems

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        NetEcon '08: Proceedings of the 3rd international workshop on Economics of networked systems
        August 2008
        116 pages
        ISBN:9781605581798
        DOI:10.1145/1403027
        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: 22 August 2008

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. bargaining
        2. hot-potato routing
        3. ospf

        Qualifiers

        • Research-article

        Conference

        SIGCOMM '08
        Sponsor:
        SIGCOMM '08: ACM SIGCOMM 2008 Conference
        August 22, 2008
        WA, Seattle, USA

        Acceptance Rates

        Overall Acceptance Rate 10 of 18 submissions, 56%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)45
        • Downloads (Last 6 weeks)4
        Reflects downloads up to 01 Jan 2025

        Other Metrics

        Citations

        Cited By

        View all

        View Options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Login options

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media