research-article

Free access

Rationality and traffic attraction: incentives for honest path announcements in bgp

Authors:

Sharon Goldberg,

Aaron D. Jaggard,

Vijay Ramachandran,

Rebecca N. WrightAuthors Info & Claims

SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communication

Pages 267 - 278

https://doi.org/10.1145/1402958.1402989

Published: 17 August 2008 Publication History

Abstract

We study situations in which autonomous systems (ASes) may have incentives to send BGP announcements differing from the AS-level paths that packets traverse in the data plane. Prior work on this issue assumed that ASes seek only to obtain the best possible outgoing path for their traffic. In reality, other factors can influence a rational AS's behavior. Here we consider a more natural model, in which an AS is also interested in attracting incoming traffic (e.g., because other ASes pay it to carry their traffic). We ask what combinations of BGP enhancements and restrictions on routing policies can ensure that ASes have no incentive to lie about their data-plane paths. We find that protocols like S-BGP alone are insufficient, but that S-BGP does suffice if coupled with additional (quite unrealistic) restrictions on routing policies. Our game-theoretic analysis illustrates the high cost of ensuring that the ASes honestly announce data-plane paths in their BGP path announcements.

References

[1]

K. Argyraki, P. Maniatis, O. Irzak, A. Subramanian, and S. Shenker. Loss and Delay Accountability for the Internet. In Proc. IEEE ICNP, pp. 194--205, Oct. 2007.

[2]

I. Avramopoulos and J. Rexford. Stealth Probing: Data-Plane Security for IP Routing. In Proc. USENIX, Jun. 2006.

Digital Library

[3]

H. Ballani, P. Francis, and X. Zhang. A Study of Prefix Hijacking and Interception in the Internet. In Proc. ACM SIGCOMM, pp. 265--276, Aug. 2007.

Digital Library

[4]

S. Balon and G. Leduc. Can Forwarding Loops Appear When Activating iBGP Multipath Load Sharing? In Proc. AINTEC, LNCS 4866, pp. 213--225, Nov. 2007.

Digital Library

[5]

K. Butler, T. Farley, P. McDaniel, and J. Rexford. A Survey of BGP Security Issues and Solutions. Technical report, AT&T Labs-Research, 2005.

[6]

R. R. Dakdouk, S. Salihoglu, H. Wang, H. Xie, and Y. R. Yang. Interdomain Routing as Social Choice. In Proc. Incentive-Based Comp. (IBC), Jul. 2006.

Digital Library

[7]

N. Feamster, R. Johari, and H. Balakrishnan. Implications of Autonomy for the Expressiveness of Policy Routing. IEEE/ACM Trans. Network. 15(6):1266--1279, Dec. 2007.

Digital Library

[8]

J. Feigenbaum, D. R. Karger, V. Mirrokni, and R. Sami. Subjective-Cost Policy Routing. Theoretical Comp. Sci. 378(2):175--189, Jun. 2007.

Digital Library

[9]

J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing 18(1):61--72, Jul. 2005.

Digital Library

[10]

J. Feigenbaum, V. Ramachandran, and M. Schapira. Incentive-Compatible Interdomain Routing. In Proc. ACM Conf. Elec. Commerce (EC), pp. 130--139, Jun. 2006.

Digital Library

[11]

J. Feigenbaum, R. Sami, and S. Shenker. Mechanism Design for Policy Routing. Distributed Computing 18(4):293--305, Mar. 2006.

Digital Library

[12]

J. Feigenbaum, M. Schapira, and S. Shenker. Distributed Algorithmic Mechanism Design. Chap. 14 (pp. 363--384) in Algorithmic Game Theory, N. Nisan, T. Roughgarden, �. Tardos, and V. Vazirani, eds. Cambridge UP, Sep. 2007.

[13]

L. Gao, T. G. Griffin, and J. Rexford. Inherently Safe Backup Routing with BGP. In Proc. IEEE INFOCOM, vol. 1, pp. 22--26, Apr. 2001.

[14]

L. Gao and J. Rexford. Stable Internet Routing without Global Coordination. IEEE/ACM Trans. Network. 9(6):681--692, Dec. 2001.

Digital Library

[15]

R. Gao, C. Dovrolis, and E. Zegura. Interdomain Ingress Traffic Engineering through Optimized AS-Path Prepending. In Proc. IFIP Networking, May 2005.

Digital Library

[16]

V. Gill, J. Heasley, and D. Meyer. The Generalized TTL Security Mechanism (GTSM). RFC 3682, Feb. 2004.

Digital Library

[17]

S. Goldberg and S. Halevi. Rational ASes and Traffic Attraction: Incentives for Honestly Announcing Paths in BGP. Technical Report TR-813-08, Princeton Univ. Dept. of Comp. Sci., Feb. 2008.

[18]

S. Goldberg, S. Halevi, A. D. Jaggard, V. Ramachandran, and R. N. Wright. Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP. Technical Report TR-823-08, Princeton Univ. Dept. of Comp. Sci., Jun. 2008.

[19]

S. Goldberg, D. Xiao, E. Tromer, B. Barak, and J. Rexford. Path Quality Monitoring in the Presence of Adversaries. In Proc. ACM SIGMETRICS, Jun. 2008.

Digital Library

[20]

G. Goodell, W. Aiello, T. Griffin, J. Ioannidis, P. McDaniel, and A. Rubin. Working Around BGP: An Incremental Approach to Improving Security and Accuracy of Interdomain Routing. In Proc. NDSS, Feb. 2003.

[21]

T. G. Griffin, F. B. Shepherd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. IEEE/ACM Trans. Network. 10(2):232--243, Apr. 2002.

Digital Library

[22]

A. Heffernan. Protection of BGP Sessions via the TCP MD5 Signature Option. RFC 2385, Aug. 1998.

Digital Library

[23]

K. J. Houle and G. M. Weaver. Trends in Denial of Service Attack Technology. Technical Report, CERT Coordination Center, Oct. 2001.

[24]

G. Huston. Interconnection, Peering, and Settlements. In Proc. Internet Glob. Summit (INET), Jun. 1999.

[25]

A. D. Jaggard, V. Ramachandran, and R. N. Wright. Towards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling. Technical Report 2008-02, DIMACS, Rutgers Univ., Apr. 2008.

[26]

S. Kent, C. Lynn, and K. Seo. Secure Border Gateway Protocol (S-BGP). J. Selected Areas in Communications 18(4):582--592, Apr. 2000.

Digital Library

[27]

H. Levin, M. Schapira, and A. Zohar. The Strategic Justification for BGP. Technical Report, Hebrew Univ. of Jerusalem, 2006.

[28]

H. Levin, M. Schapira, and A. Zohar. Interdomain Routing and Games. In Proc. ACM STOC, May 2008.

Digital Library

[29]

X. Liu, X. Yang, D. Wetherall, and T. Anderson. Efficient and Secure Source Authentication with Packet Passports. In Proc. USENIX Wkshp. Steps to Reducing Unwanted Traffic on the Internet (SRUTI), Jul. 2006.

Digital Library

[30]

Z. Mao, J. Rexford, J.Wang, and R. H. Katz. Towards an Accurate AS-Level Traceroure Tool. In Proc. ACM SIGCOMM, pp. 365--378, Aug. 2003.

Digital Library

[31]

N. Nisan and A. Ronen. Algorithmic Mechanism Design. Games and Economic Behavior 35(1-2):166--196, Apr. 2001.

[32]

V. Padmanabhan and D. Simon. Secure Traceroute to Detect Faulty or Malicious Routing. Proc. HotNets-I, pp. 77--82, Oct. 2002.

[33]

D. C. Parkes and J. Shneidman. Specification Faithfulness in Networks with Rational Nodes. In Proc. ACM PODC, pp. 88--97, Jul. 2004.

Digital Library

[34]

A. Ramachandran and N. Feamster. Understanding the Network-Level Behavior of Spammers. In Proc. ACM SIGCOMM, pp. 291--302, Sep. 2006.

Digital Library

[35]

Y. Rekhter, T. Li, and S. Hares. A Border Gateway Protocol 4 (BGP-4). RFC 4271, Jan. 2006.

[36]

L. Subramanian, V. Roth, I. Stoica, S. Shenker, and R. H. Katz. Listen and Whisper: Security mechanisms for BGP. In Proc. USENIX NSDI, Mar. 2004.

Digital Library

[37]

F. Wang and L. Gao. On Inferring and Characterizing Internet Routing Policies. In Proc. ACM IMC, pp. 15--26, Oct. 2003.

Digital Library

[38]

H. Wang, R. K. Chang, D.-M. Chiu, and J. C. Lui. Characterizing the Performance and Stability Issues of the AS Path Prepending Method. In Proc. ACM SIGCOMM Asia Workshop, Apr. 2005.

[39]

H. Wang, H. Xie, Y. R. Yang, L. E. Li, Y. Liu, and A. Silberschatz. On the Stability of Rational, Inbound-Dependent Interdomain Route Selection. In Proc. IEEE ICNP, pp. 40--52, Nov. 2005.

Digital Library

[40]

R. White. Deployment Considerations for Secure Origin BGP (soBGP). Internet Draft (expired), draft-white-sobgp-bgp-deployment-01.txt, Jun. 2003.

[41]

E. L. Wong, P. Balasubramanian, L. Alvisi, M. G. Gouda, and V. Shmatikov. Truth in Advertising: Lightweight Verification of Route Integrity. In Proc. ACM PODC, pp. 147--156, Aug. 2007.

Digital Library

Cited By

Diao ZGong BZhu HWu Y(2023)A Trusted Routing Schemes for IoT2023 8th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS57501.2023.10150714(298-303)Online publication date: 21-Apr-2023
https://doi.org/10.1109/ICCCS57501.2023.10150714
Elamathi NJayashri SPitchai R(2019)Enhanced secure communication over inter-domain routing in heterogeneous wireless networks based on analysis of BGP anomalies using soft computing techniquesSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-019-03836-423:8(2735-2746)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s00500-019-03836-4
Zhao MZhou WGurney AHaeberlen ASherr MLoo B(2016)Private and verifiable interdomain routing decisionsIEEE/ACM Transactions on Networking10.1109/TNET.2015.240923324:2(1011-1024)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2409233
Show More Cited By

Index Terms

Rationality and traffic attraction: incentives for honest path announcements in bgp
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Rationality and traffic attraction: incentives for honest path announcements in bgp

We study situations in which autonomous systems (ASes) may have incentives to send BGP announcements differing from the AS-level paths that packets traverse in the data plane. Prior work on this issue assumed that ASes seek only to obtain the best ...
Dynamics of hot-potato routing in IP networks

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...
Dynamics of hot-potato routing in IP networks
SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 conference on Data communication

August 2008

452 pages

ISBN:9781605581750

DOI:10.1145/1402958

General Chairs:
Victor Bahl
Microsoft Research
,
David Wetherall
Intel Research & University of Washington
,
Program Chairs:
Stefan Savage
University of California, San Diego
,
Ion Stoica
University of California, Berkeley

ACM SIGCOMM Computer Communication Review Volume 38, Issue 4
October 2008
436 pages
ISSN:0146-4833
DOI:10.1145/1402946
Issue’s Table of Contents

Copyright © 2008 ACM.

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: 17 August 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM '08

Sponsor:

SIGCOMM '08: ACM SIGCOMM 2008 Conference

August 17 - 22, 2008

WA, Seattle, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
627
Total Downloads

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

Reflects downloads up to 18 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Diao ZGong BZhu HWu Y(2023)A Trusted Routing Schemes for IoT2023 8th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS57501.2023.10150714(298-303)Online publication date: 21-Apr-2023
https://doi.org/10.1109/ICCCS57501.2023.10150714
Elamathi NJayashri SPitchai R(2019)Enhanced secure communication over inter-domain routing in heterogeneous wireless networks based on analysis of BGP anomalies using soft computing techniquesSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-019-03836-423:8(2735-2746)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s00500-019-03836-4
Zhao MZhou WGurney AHaeberlen ASherr MLoo B(2016)Private and verifiable interdomain routing decisionsIEEE/ACM Transactions on Networking10.1109/TNET.2015.240923324:2(1011-1024)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2409233
Burstein DKenter FKun JShi F(2016)Interception in distance-vector routing networksJournal of Complex Networks10.1093/comnet/cnw014(cnw014)Online publication date: 21-Jun-2016
https://doi.org/10.1093/comnet/cnw014
Li QZhang XZhang XSu P(2015)Invalidating Idealized BGP Security Proposals and CountermeasuresIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2014.234538112:3(298-311)Online publication date: 1-May-2015
https://doi.org/10.1109/TDSC.2014.2345381
Bangera PGorinsky S(2014)Economics of traffic attraction by transit providers2014 IFIP Networking Conference10.1109/IFIPNetworking.2014.6857109(1-9)Online publication date: Jun-2014
https://doi.org/10.1109/IFIPNetworking.2014.6857109
Li QChiu DXu MWu J(2014)An economic analysis of routing conflict and its resolutionPerformance Evaluation10.1016/j.peva.2013.09.00471(25-43)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1016/j.peva.2013.09.004
Goldberg SSchapira MHummon PRexford J(2014)How secure are secure interdomain routing protocols?Computer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.05.00770(260-287)Online publication date: 1-Sep-2014
https://dl.acm.org/doi/10.1016/j.comnet.2014.05.007
Engelberg RSchapira M(2014)Weakly-Acyclic (Internet) Routing GamesTheory of Computing Systems10.1007/s00224-013-9474-z54:3(431-452)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1007/s00224-013-9474-z
Gill PSchapira MGoldberg S(2013)A survey of interdomain routing policiesACM SIGCOMM Computer Communication Review10.1145/2567561.256756644:1(28-34)Online publication date: 31-Dec-2013
https://dl.acm.org/doi/10.1145/2567561.2567566
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents