article

Designing BGP-based outbound traffic engineering techniques for stub ASes

Authors:

Olivier BonaventureAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 34, Issue 5

Pages 89 - 106

https://doi.org/10.1145/1039111.1039115

Published: 15 October 2004 Publication History

Abstract

Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manually tweaking the BGP configurations of the routers on an error-prone trial-and-error basis. In this paper, we demonstrate that designing systematic BGP-based traffic engineering techniques for stub ASes are possible. Our approach to solve this traffic engineering problem is to allow the network operator to define objective functions on the interdomain traffic. Those objective functions are used by an optimization box placed inside the AS that controls the interdomain traffic by tuning the iBGP messages distributed inside the AS. We show that the utilization of an efficient evolutionary algorithm allows to both optimize the objective function and limit the number of iBGP messages. By keeping a lifetime on the tweaked routes, we also show that providing stability to the interdomain path followed by the traffic is possible. We evaluate the performance of solution based on traffic traces from two stub ASes of different sizes. Our simulations show that the interdomain traffic can be efficiently engineered by using not more than a few iBGP advertisements per minute.Our contribution in this paper is to demonstrate that by carefully thinking the design of the interdomain traffic engineering technique, stub ASes can engineer their outbound traffic over relatively short timescales, by exclusively tweaking their BGP routes, and with a minimal burden on BGP. Systematic BGP-based traffic engineering for stub ASes is thus possible at a very limited cost in terms of iBGP messages.

References

[1]

S. Agarwal, C. Chuah, S. Bhattacharyya, and C. Diot. The Impact of BGP Dynamics on Intra-Domain Traffic. In Proc. of ACM SIGMETRICS, June 2004.]]

Digital Library

[2]

S. Agarwal, C. Chuah, and R. Katz. Opca: Robust interdomain policy routing and traffic control. In IEEE Openarch, 2003.]]

[3]

A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman. A measurement-based analysis of multihoming. In Proceedings of ACM SIGCOMM 2003, August 2003.]]

Digital Library

[4]

D. Allen. NPN: Multihoming and route optimization: Finding the best way home. Network Magazine, February 2002.]]

[5]

P. Aukia, M. Kodialam, P. Koppol, T. Lakshman, H. Sarin, and B. Suter. RATES: A server for MPLS traffic engineering. IEEE Network Magazine, pages 34--41, March/April 2000.]]

Digital Library

[6]

D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao. Overview and Principles of Internet Traffic Engineering. Internet Engineering Task Force, RFC3272, May 2002.]]

Digital Library

[7]

D. Awduche, J. Malcom, B. Agogbua, M. O'Dell, and J. McManus. Requirements for Traffic Engineering Over MPLS. Internet RFC 2702, September 1999.]]

Digital Library

[8]

A. Basu, C. Ong, A. Rasala, F. Shepherd, and G. Wilfong. Route oscillations in i-BGP with route reflection. In Proceedings of ACM SIGCOMM 2002, August 2002.]]

Digital Library

[9]

O. Bonaventure, B. Quoitin, and S. Uhlig. Beyond interdomain reachability. Position paper at the Workshop on Internet Routing Evolution and Design (WIRED), October 2003.]]

[10]

O. Bonaventure, P. Trimintzios, G. Pavlou, B. Quoitin (Eds.), A. Azcorra, M. Bagnulo, P. Flegkas, A. Garcia-Martinez, P. Georgatsos, L. Georgiadis, C. Jacquenet, L. Swinnen, S. Tandel, and S. Uhlig. Internet Traffic Engineering. Chapter of COST263 final report, LNCS 2856, Springer-Verlag, September 2003.]]

[11]

O. Bonaventure, S. Uhlig, and B. Quoitin. The case for more versatile BGP Route Reflectors. Internet draft, draft-bonaventure-bgp-route-reflectors-00.txt, work in progress, July 2004.]]

[12]

G. Box, G. Jenkins, and G. Reinsel. Time Series Analysis: Forecasting and Control. Prentice-Hall, 1994.]]

Digital Library

[13]

J. Branke. Evolutionary Optimization in Dynamic Environments. Kluwer Academic Publishers, 2002.]]

Digital Library

[14]

L. Burgstahler and M. Neubauer. New Modifications of the Exponential Moving Average Algorithm for Bandwidth Estimation. In Proc. of the 15th ITC Specialist Seminar, July 2002.]]

[15]

H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Towards Capturing Representative AS-Level Internet Topologies. Computer Networks Journal, Elsevier, 44(6):737--755, April 2004.]]

Digital Library

[16]

B. Claise. Packet Sampling (PSAMP) Protocol Specifications. Internet draft, draft-ietf-psamp-protocol-01.txt, work in progress, February 2004.]]

[17]

C. A. Coello Coello. An updated survey of GA-based multiobjective optimization techniques. ACM Computing Surveys, 32(2):109--143, 2000.]]

Digital Library

[18]

INTERNAP NETWORK SERVICES CORP. Internap Flow Control Platform. http://www.internap.com/.]]

[19]

K. Deb. Multi-objective Optimization using Evolutionary Algorithms. Wiley Interscience series in systems and optimization, 2001.]]

Digital Library

[20]

K. Deb, S. Agrawal, A. Pratab, and T. Meyarivan. A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In Proc. of the Parallel Problem Solving from Nature VI Conference, pages 849--858, Paris, France, 2000. Springer-Verlag (LNCS 1917).]]

Digital Library

[21]

L. Deri. nProbe: an Open Source NetFlow probe for Gigabit Networks. In Proc. of Terena TNC 2003, May 2003.]]

[22]

N. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. Ramakrishnan, and J. van der Merwe. Resource management with hoses: point-to-cloud services for virtual private networks. IEEE/ACM Transactions on Networking, 10(5):679--692, 2002.]]

Digital Library

[23]

N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and K. van der Merwe. The case for separating routing from routers. In Proc. SIGCOMM Workshop on Future Directions in Network Architecture (FDNA), August 2004.]]

Digital Library

[24]

N. Feamster, J. Borkenhagen, and J. Rexford. Guidelines for interdomain traffic engineering. ACM SIGCOMM Comput. Commun. Rev., 33(5):19--30, 2003.]]

Digital Library

[25]

N. Feamster, J. Winick, and J. Rexford. A model of BGP routing for network engineering. In Proc. of ACM SIGMETRICS, June 2004.]]

Digital Library

[26]

B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, October 2002.]]

Digital Library

[27]

B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In INFOCOM 2000, March 2000.]]

[28]

D. Goldenberg, L. Qiu, H. Xie, Y. Yang, and Y. Zhang. Optimizing cost and performance for multihoming. In Proceedings of ACM SIGCOMM 2004, August 2004.]]

Digital Library

[29]

T. Griffin and G. Wilfong. An analysis of BGP convergence properties. In Proc. of ACM SIGCOMM'99, September 1999.]]

Digital Library

[30]

B. Halabi. Internet Routing Architectures (2nd edition). Cisco Press, 2000.]]

Digital Library

[31]

B. Huffaker, M. Fomenkov, D. Plummer, D. Moore, and K. Claffy. Distance Metrics in the Internet. In Proc. of IEEE International Telecommunications Symposium (ITS), September 2002.]]

[32]

J. Johnson. BGP is a reachability protocol. NANOG25 meeting, Toronto, Canada. June 2002. Available at http://www.nanog.org/mtg-0206/ppt/jerm2/ index.html.]]

[33]

J. Johnson. Intelligent route control improves BGP. Network World, February 2002.]]

[34]

A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener. Algorithms for provisioning virtual private networks in the hose model. IEEE/ACM Transactions on Networking, 10(4):565--578, 2002.]]

Digital Library

[35]

C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. An experimental study of Internet routing convergence. In SIGCOMM 2000, August 2000.]]

Digital Library

[36]

S. Leinen. Evaluation of candidate protocols for IP flow information export (IPFIX). Internet draft, draft-leinen-ipfix-eval-contrib-02, work in progress, January 2004.]]

[37]

R. Mahajan, D. Wetherall, and T. Anderson. Understanding BGP Misconfigurations. In Proc. ACM SIGCOMM '02, September 2002.]]

Digital Library

[38]

D. Meyer. University of Oregon Route Views Project. Available at http://antc.uoregon.edu/route-views/.]]

[39]

P. Morrissey. Mapping out the best route. Network Computing, http://www.nwc.com/showArticle.jhtml?articleID=16401572, December 2003.]]

[40]

F5 NETWORKS. Big-IP Link Controller. http://www.f5.com.]]

[41]

Juniper Networks. Junos software release 5.6 : New features list. http://www.juniper.net/products/ip_ infrastructure/junos/105012.html.]]

[42]

K. Park and W. Willinger (editors). Self-Similar Network Traffic and Performance Evaluation. Wiley-Interscience, 2000.]]

Digital Library

[43]

R. Purshouse and P. Fleming. Conflict, Harmony, and Independence: Relationships in Multi-criterion Optimisation. In Proc. of the Second International Conference on Multi-Criterion Optimization (EMO2003), Portugal, pages 16--30, April 2003.]]

Digital Library

[44]

Y. Qiao, J. Skicewicz, and P. Dinda. Multiscale predictability of network traffic. Technical Report NWU-CS-02-13, Nothwestern University, October 2002.]]

[45]

B. Quoitin. C-BGP, an efficient BGP simulator. http://cbgp.info.ucl.ac.be/, September 2003.]]

[46]

B. Quoitin, S. Uhlig, C. Pelsser, L. Swinnen, and O. Bonaventure. Interdomain traffic engineering with BGP. IEEE Communications Magazine, May 2003.]]

Digital Library

[47]

RADWARE. Linkproof. http://www.radware.com/.]]

[48]

Y. Rekhter, T. Li, and S. Hares. A Border Gateway Protocol 4 (BGP-4). Internet draft, draft-ietf-idr-bgp4-24.txt, work in progress, November 2003.]]

Digital Library

[49]

J. Rexford, J. Wang, Z. Xiao, and Y. Zhang. BGP Routing Stability of Popular Destinations. In Proc. of the second ACM SIGCOMM Internet Measurement Workshop, November 2002.]]

Digital Library

[50]

A. Sang and S. Li. A Predictability Analysis of Network Traffic. In Proc. of IEEE INFOCOM 2000, 2000.]]

[51]

S. Sangli, D. Tappan, and Y. Rekhter. BGP Extended Communities Attribute. Internet draft, draft-ietf-idr-bgp-ext-communities-06.txt, work in progress, August 2003.]]

[52]

P. Smith. Weekly routing table report. Weekly reports from APNIC's router in Japan sent to [email protected].]]

[53]

J. Stewart. BGP4 : interdomain routing in the Internet. Addison Wesley, 1999.]]

Digital Library

[54]

L. Subramanian, S. Agarwal, J. Rexford, and R. Katz. Characterizing the Internet hierarchy from multiple vantage points. In INFOCOM 2002, June 2002.]]

[55]

Cisco Systems. BGP Case Studies Section 1. http: //www.cisco.com/warp/public/459/13.html.]]

[56]

Cisco Systems. Sample Configurations for Load Sharing with BGP in Single and Multihomed Environments. http: //www.cisco.com/warp/public/459/40.html.]]

[57]

Cisco Systems. NetFlow services and applications. White papern, http: //www.cisco.com/warp/public/732/netflow, 1999.]]

Digital Library

[58]

ROUTESCIENCE TECHNOLOGIES. PathControl. http://www.routescience.com/.]]

[59]

S. Uhlig. Implications of the traffic characteristics on interdomain traffic engineering. PhD Thesis, Computer Science and Engineering Department, Université catholique de Louvain, March 2004.]]

[60]

S. Uhlig. A multiple-objectives evolutionary perspective to interdomain traffic engineering in the internet. In Workshop on Nature Inspired Approaches to Networks and Telecommunications (NIANT) in PPSN04, Birmingham, UK, September 2004.]]

[61]

S. Uhlig, O. Bonaventure, and B. Quoitin. Interdomain Traffic Engineering with minimal BGP Configurations. In Proc. of ITC-18, September 2003.]]

[62]

S. Uhlig, V. Magnin, O. Bonaventure, C. Rapier, and L. Deri. Implications of the Topological Properties of Internet Traffic on Traffic Engineering. In Proc. of the 19th ACM Symposium on Applied Computing, March 2004.]]

Digital Library

[63]

S. Uhlig and B. Quoitin. BGP-based interdomain traffic engineering for transit ASes. Under submission, http://cbgp.info.ucl.ac.be/apps.html# section_transit_te.]]

[64]

D. Walton, D. Cook, A. Retana, and J. Scudder. Advertisement of multiple paths in BGP. Internet draft, draft-walton-bgp-add-paths-01.txt, work in progress, November 2002.]]

[65]

Y. Wang, Z. Wang, and L. Zhang. Internet traffic engineering without full mesh overlaying. In INFOCOM2001, April 2001.]]

[66]

X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with MPLS in the Internet. IEEE Network Magazine, March 2000.]]

Digital Library

[67]

T. Ye and S. Kalyanaraman. A recursive random search algorithm for large-scale network parameter configuration. In Proc. of ACM SIGMETRICS'03, 2003.]]

Digital Library

Cited By

Markovitch MAgarwal SFonseca RBeckett RZhang CAtov IChaturmohta SKuipers FOrda A(2022)TIPSYProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544234(233-249)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544234
Blanutsa VCherepanov K(2019)Regional Information Flows: Existing and New Approaches to Geographical StudyRegional Research of Russia10.1134/S20799705190100399:1(97-106)Online publication date: 27-Apr-2019
https://doi.org/10.1134/S2079970519010039
Yan JLi ZHuang X(2017)Applications of Genetic Algorithms in BGP-Based Interdomain Traffic EngineeringCommunications and Networking10.1007/978-3-319-66625-9_11(109-118)Online publication date: 1-Oct-2017
https://doi.org/10.1007/978-3-319-66625-9_11
Show More Cited By

Index Terms

Designing BGP-based outbound traffic engineering techniques for stub ASes
1. Networks

Recommendations

A routing optimization algorithm for BGP egress selection
ICDCIT'06: Proceedings of the Third international conference on Distributed Computing and Internet Technology

BGP optimal egress selection is one of a recent trend in routing research. Current hot-potato routing has the problem of routing instability. This paper provides a new algorithm named BGP-RO-ES to minimize hot-potato disruptions while satisfying ...
The impact of BGP dynamics on intra-domain traffic
SIGMETRICS '04/Performance '04: Proceedings of the joint international conference on Measurement and modeling of computer systems

Recent work in network traffic matrix estimation has focused on generating router-to-router or PoP-to-PoP (Point-of-Presence) traffic matrices within an ISP backbone from network link load data. However, these estimation techniques have not considered ...
Neighbor-specific BGP: more flexible routing policies while improving global stability
SIGMETRICS '09

The Border Gateway Protocol (BGP) offers network administrators considerable flexibility in controlling how traffic flows through their networks. However, the interaction between routing policies in different Autonomous Systems (ASes) can lead to ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 34, Issue 5

October 2004

104 pages

ISSN:0146-4833

DOI:10.1145/1039111

Issue’s Table of Contents

Copyright © 2004 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 October 2004

Published in SIGCOMM-CCR Volume 34, Issue 5

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
752
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Markovitch MAgarwal SFonseca RBeckett RZhang CAtov IChaturmohta SKuipers FOrda A(2022)TIPSYProceedings of the ACM SIGCOMM 2022 Conference10.1145/3544216.3544234(233-249)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3544216.3544234
Blanutsa VCherepanov K(2019)Regional Information Flows: Existing and New Approaches to Geographical StudyRegional Research of Russia10.1134/S20799705190100399:1(97-106)Online publication date: 27-Apr-2019
https://doi.org/10.1134/S2079970519010039
Yan JLi ZHuang X(2017)Applications of Genetic Algorithms in BGP-Based Interdomain Traffic EngineeringCommunications and Networking10.1007/978-3-319-66625-9_11(109-118)Online publication date: 1-Oct-2017
https://doi.org/10.1007/978-3-319-66625-9_11
Cardona JVissicchio SLucente PFrancois P(2016)“I Can’t Get No Satisfaction”: Helping Autonomous Systems Identify Their Unsatisfied Interdomain InterestsIEEE Transactions on Network and Service Management10.1109/TNSM.2016.252500313:1(43-57)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1109/TNSM.2016.2525003
Valancius VRavi BFeamster NSnoeren A(2013)Quantifying the benefits of joint content and network routingACM SIGMETRICS Performance Evaluation Review10.1145/2494232.246576241:1(243-254)Online publication date: 17-Jun-2013
https://dl.acm.org/doi/10.1145/2494232.2465762
Valancius VRavi BFeamster NSnoeren AHarchol-Balter MDouceur JXu J(2013)Quantifying the benefits of joint content and network routingProceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems10.1145/2465529.2465762(243-254)Online publication date: 17-Jun-2013
https://dl.acm.org/doi/10.1145/2465529.2465762
Misseri XRougier JSaucez D(2012)Internet routing diversity for stub networks with a Map-and-Encap scheme2012 IEEE International Conference on Communications (ICC)10.1109/ICC.2012.6363982(2861-2866)Online publication date: Jun-2012
https://doi.org/10.1109/ICC.2012.6363982
Aranda Gutiérrez P(2012)Flexible Routing with Maximum Aggregation in the InternetMobile Networks and Management10.1007/978-3-642-30422-4_24(332-343)Online publication date: 2012
https://doi.org/10.1007/978-3-642-30422-4_24
Fonte ACurado MMonteiro E(2011)A prediction criterion for selecting popular destinations2011 IEEE GLOBECOM Workshops (GC Wkshps)10.1109/GLOCOMW.2011.6162531(646-650)Online publication date: Dec-2011
https://doi.org/10.1109/GLOCOMW.2011.6162531
Gutiérrez P(2011)A Simplified Internet Routing ArchitectureMobile Networks and Applications10.1007/s11036-011-0320-816:4(433-445)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1007/s11036-011-0320-8
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents