article

A BGP-based mechanism for lowest-cost routing

Authors:

Joan Feigenbaum,

Christos Papadimitriou,

Scott ShenkerAuthors Info & Claims

Distributed Computing, Volume 18, Issue 1

Pages 61 - 72

https://doi.org/10.1007/s00446-005-0122-y

Published: 01 July 2005 Publication History

Abstract

The routing of traffic between Internet domains, or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address the problem of interdomain routing from a mechanism-design point of view. The application of mechanism-design principles to the study of routing is the subject of earlier work by Nisan and Ronen [16] and Hershberger and Suri [12]. In this paper, we formulate and solve a version of the routing-mechanism design problem that is different from the previously studied version in three ways that make it more accurately reflective of real-world interdomain routing: (1) we treat the nodes as strategic agents, rather than the links; (2) our mechanism computes lowest-cost routes for all source-destination pairs and payments for transit nodes on all of the routes (rather than computing routes and payments for only one source-destination pair at a time, as is done in [12, 16]); (3) we show how to compute our mechanism with a distributed algorithm that is a straightforward extension to BGP and causes only modest increases in routing-table size and convergence time (in contrast with the centralized algorithms used in [12, 16]). This approach of using an existing protocol as a substrate for distributed computation may prove useful in future development of Internet algorithms generally, not only for routing or pricing problems. Our design and analysis of a strategy proof, BGP-based routing mechanism provides a new, promising direction in distributed algorithmic mechanism design, which has heretofore been focused mainly on multicast cost sharing.

References

[1]

1. Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Approximation and collusion in multicast cost sharing. Games Econ. Behav. 47, 36-71 (2004).

[2]

2. Archer, A., Tardos, E.: Frugal path mechanisms. In: Proceedings of 13th symposium on discrete algorithms, pp. 991-999. ACM Press/SIAM, New York/Philadelphia (2002).

[3]

3. Clarke, E.: Multipart pricing of public goods. PuNic Choice 11, 17-33 (1971).

[4]

4. Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S.: Hardness results for multicast cost sharing. Theoret. Comput. Sci. 304, 215-236 (2003).

Digital Library

[5]

5. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: Proceedings of the 21st symposium on principles of distributed computing, pp. 173-182. ACM Press, New York (2002).

Digital Library

[6]

6. Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. J. Comput. Syst. Sci. 63, 21-41 (2001).

Digital Library

[7]

7. Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. In: Proceedings of the 23rd symposium on principles of distributed computing, pp. 11-20. ACM Press, New York (2004).

Digital Library

[8]

8. Fiat, A., Goldberg, A., Hartline, J., Karlin, A.: Competitive generalized auctions. In: Proceedings of the 34th symposium on theory of computing, pp. 72-81. ACM Press, New York (2002).

[9]

9. Green, J., Laffont, J.: Incentives in public decision making. In: studies in public economics, vol. 1, pp. 65-78. North Holland, Amsterdam (1979).

[10]

10. Griffin, T.G., Wilfong, G.: An analysis of BGP convergence properties. In: Proceedings of SIGCOMM '99, pp. 277-288. ACM Press, New York (1999).

Digital Library

[11]

11. Groves, T.: Incentives in teams. Econometrica 41, 617-663 (1973).

[12]

12. Hershberger, J., Suri, S.: Vickrey prices and shortest paths: What is an edge worth? In: Proceedings of the 42nd symposium on the foundations of computer science, pp. 129-140. IEEE Computer Society Press, Los Alamitos (2001).

[13]

13. Mas-Colell, A., Whinston, M., Green, J.: Microeconomic Theory. Oxford University Press, New York (1995).

[14]

14. Mitchell, J., Sami, R., Talwar, K., Teague, V.: Private communication (Dec. 2001).

[15]

15. Monderer, D., Tennenholtz, M.: Distributed games: from mechanisms to protocols. In: Proceedings of the 16th national conference on artificial intelligence, pp. 32-37 (1999).

Digital Library

[16]

16. Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166-196 (2001).

[17]

17. Parkes, D.: iBundle: An efficient ascending price bundle auction. In: proceedings of the 1st ACM conference on electronic commerce, pp. 148-157. ACM Press, New York (1999).

Digital Library

[18]

18. Parkes, D., Ungar, L.: Iterative combinatorial auctions: theory and practice. In: Proceedings of the 17th national conference on artificial intelligence, pp. 71-81 (2000).

Digital Library

[19]

19. Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49, 236-259 (2002).

Digital Library

[20]

20. Route Views: University of Oregon Route Views Project. http://www.routeviews.org.

[21]

21. Sandholm, T.: Distributed rational decision making. In: Weiss, G. (ed.) Multiagent Systems: a Modern Introduction to Distributed Artificial Intelligence, pp. 201-258. MIT Press, Cambridge, MA (1999).

[22]

22. Shneidman, J., Parkes, D.: Using redundancy to improve robustness of distributed mechanism implementations. In: Proceedings of the 4th ACM conference on electronic commerce, pp. 276-277. ACM Press, New York (2003).

Digital Library

[23]

23. Shneidman, J., Parkes, D.: Specification faithfulness in networks with rational nodes. In: Proceedings of the 23rd symposium on principles of distributed computing, pp. 88-97. ACM Press, New York (2004).

Digital Library

[24]

24. Tangmunarunkit, H., Govindan, R., Shenker, S.: Internet path inflation due to policy routing. In: Proceeding of SPIE ITCom 2001, pp. 19-24. SPIE Press, Bellingham (2001).

[25]

25. Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16, 8-37 (1961).

[26]

26. Wellman, M.: A market-oriented programming environment and its applications to distributed multicommodity flow problems. J. AIRes. 1, 1-23 (1993).

[27]

27. Wellman, M., Walsh, W., Wurman, P., Mackie-Mason, J.: Auctions for decentralized scheduling. Games Econ. Behav. 35, 271-303 (2001).

Cited By

Avarikioti ZSchmid STiwari SKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel NetworksProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662809(306-309)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662809
Zilberman NSchooler ECummings UManohar RNafus DSoulé RTaylor R(2023)Toward Carbon-Aware NetworkingACM SIGEnergy Energy Informatics Review10.1145/3630614.36306183:3(15-20)Online publication date: 25-Oct-2023
https://dl.acm.org/doi/10.1145/3630614.3630618
Yu YHsu SChen AChen YTang B(2023)Truthful and Optimal Data Preservation in Base Station-less Sensor Networks: An Integrated Game Theory and Network Flow ApproachACM Transactions on Sensor Networks10.1145/360626320:1(1-40)Online publication date: 27-Jun-2023
https://dl.acm.org/doi/10.1145/3606263
Show More Cited By

Index Terms

A BGP-based mechanism for lowest-cost routing

Recommendations

A BGP-based mechanism for lowest-cost routing
PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing

The routing of traffic between Internet domains or Autonomous Systems (ASs), a task known as interdomain routing, is currently handled by the Border Gateway Protocol (BGP). In this paper, we address the problem of interdomain routing from a mechanism-...
Architecture of the remote routing validation tool for BGP anomaly detection
RACS '12: Proceedings of the 2012 ACM Research in Applied Computation Symposium

The Border Gateway Protocol (BGP) is an Inter-domain routing protocol that has gradually evolved over the past few decades. The main functionality of BGP is to exchange Network Layer Reachability Information (NLRI) between ASes so that a BGP speaker can ...
Mechanism design for policy routing
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these preferences as arising from an AS's underlying utility for each route and ...

Comments

Information & Contributors

Information

Published In

cover image Distributed Computing

Distributed Computing Volume 18, Issue 1

Special issue: PODC 02

July 2005

95 pages

ISSN:0178-2770

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Avarikioti ZSchmid STiwari SKuznetsov PGelles ROlivetti D(2024)Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel NetworksProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662809(306-309)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662809
Zilberman NSchooler ECummings UManohar RNafus DSoulé RTaylor R(2023)Toward Carbon-Aware NetworkingACM SIGEnergy Energy Informatics Review10.1145/3630614.36306183:3(15-20)Online publication date: 25-Oct-2023
https://dl.acm.org/doi/10.1145/3630614.3630618
Yu YHsu SChen AChen YTang B(2023)Truthful and Optimal Data Preservation in Base Station-less Sensor Networks: An Integrated Game Theory and Network Flow ApproachACM Transactions on Sensor Networks10.1145/360626320:1(1-40)Online publication date: 27-Jun-2023
https://dl.acm.org/doi/10.1145/3606263
Gupta BGulihar P(2020)Taxonomy of Payment Structures and Economic Incentive Schemes in InternetJournal of Information Technology Research10.4018/JITR.202001011013:1(150-166)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.4018/JITR.2020010110
Harchol YBergemann DFeamster NFriedman EKrishnamurthy APanda ARatnasamy SSchapira MShenker S(2020)A Public Option for the CoreProceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication10.1145/3387514.3405875(377-389)Online publication date: 30-Jul-2020
https://dl.acm.org/doi/10.1145/3387514.3405875
Cheng HZhang WZhang YZhang LWu JWang C(2020)Fast core pricing algorithms for path auctionAutonomous Agents and Multi-Agent Systems10.1007/s10458-019-09440-y34:1Online publication date: 14-Jan-2020
https://dl.acm.org/doi/10.1007/s10458-019-09440-y
Guha SKupferman OVardi G(2019)Multi-player flow gamesAutonomous Agents and Multi-Agent Systems10.1007/s10458-019-09420-233:6(798-820)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1007/s10458-019-09420-2
Li BHao DZhao DZhou T(2018)Customer sharing in economic networks with costsProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304415.3304468(368-374)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304415.3304468
Guha SKupferman OVardi GAndre EKoenig SDastani MSukthankar G(2018)Multi-Player Flow GamesProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237405(104-112)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3237405
Cheng HZhang LZhang YWu JWang CAndre EKoenig SDastani MSukthankar G(2018)Optimal Constraint Collection for Core-Selecting Path MechanismProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237397(41-49)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3237397
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents