skip to main content
10.1145/1368436.1368438acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

REPLEX: dynamic traffic engineering based on wardrop routing policies

Published: 04 December 2006 Publication History

Abstract

One major challenge in communication networks is the problem of dynamically distributing load in the presence of bursty and hard to predict changes in traffic demands. Current traffic engineering operates on time scales of several hours which is too slow to react to phenomena like flash crowds or BGP reroutes. One possible solution is to use load sensitive routing. Yet, interacting routing decisions at short time scales can lead to oscillations, which has prevented load sensitive routing from being deployed since the early experiences in Arpanet.
However, recent theoretical results have devised a game theoretical re-routing policy that provably avoids such oscillation and in addition can be shown to converge quickly. In this paper we present ReplEx, a distributed dynamic traffic engineering algorithm based on this policy. Exploiting the fact that most underlying routing protocols support multiple equal-cost routes to a destination, it dynamically changes the proportion of traffic that is routed along each path. These proportions are carefully adapted utilising information from periodic measurements and, optionally, information exchanged between the routers about the traffic condition along the path.
We evaluate the algorithm via simulations employing traffic loads that mimic actual Web traffic, i. e., bursty TCP traffic, and whose characteristics are consistent with self-similarity. The simulations quickly converge and do not exhibit significant oscillations on both artificial as well as real topologies, as can be expected from the theoretical results.

References

[1]
D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In Proc. ACM SIGCOMM Conference, 2003.
[2]
B. Awerbuch and R. D. Kleinberg. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), 2004.
[3]
P. Barford and M. Crovella. Generating representative Web workloads for network and server performance evaluation. In Proc. ACM SIGMETRICS Conference, 1998.
[4]
M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics and Transportation. Yale University Press, 1956.
[5]
P. Berenbrink, T. Friedetzky, L. A. Goldberg, P. Goldberg, Z. Hu, and R. Martin. Distributed selfish load balancing. In Proc. 17th Ann. ACM--SIAM Symp. on Discrete Algorithms (SODA), 2006.
[6]
A. Blum, E. Even-Dar, and K. Ligett. Routing without regret, 2005. Manuscript.
[7]
Z. Cao, Z. Wang, and E. W. Zegura. Performance of hashing-based schemes for Internet load balancing. In Proc. IEEE INFOCOM Conference, 2000.
[8]
H. Dreger, A. Feldmann, M. Mai, V. Paxson, and R. Sommer. Dynamic application-layer protocol analysis for network intrusion detection. In Proc.15thUsenix Security Symposium, 2006 (to appear).
[9]
A. Elwalid, C. Jin, S. Low, and I. Widjaja. MATE: MPLS adaptive traffic engineering. In Proc. IEEE INFOCOM Conference, 2001.
[10]
E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th Ann. ACM--SIAM Symp. on Discrete Algorithms (SODA), 2005.
[11]
A. Feldmann, A. Gilbert, P. Huang, and W. Willinger. Dynamics of IP traffic: A study of the role of variability and the impact of control. In ACM SIGCOMM Conference, Sept. 1999.
[12]
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford. NetScope: Traffic engineering for IP networks. IEEE Network Magazine, 2000.
[13]
S. Fischer, H. Räcke, and B. Vöcking. Fast convergence to Wardrop equilibria by adaptive sampling methods. In Proc. 38th Ann. ACM. Symp. on Theory of Comput. (STOC), Seattle, WA, USA, May 2006. ACM.
[14]
S. Fischer and B. Vöcking. On the evolution of selfish routing. In S. Albers and T. Radzik, editors, Proc. 12th Ann. European Symp. on Algorithms (ESA), number 3221 in Lecture Notes in Comput. Sci., Bergen, Norway, September 2004. Springer-Verlag.
[15]
S. Fischer and B. Vöcking. Adaptive routing with stale information. In M. K. Aguilera and J. Aspnes, editors, Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), Las Vegas, NV, USA, 2005.
[16]
B. Fortz, J. Rexford, and M. Thorup. Traffic engineering with traditional IP routing protocols. In IEEE Communication Magazine, 2002.
[17]
B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proc. IEEE INFOCOM Conference, 2000.
[18]
B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. In IEEE Journal on Selected Areas in Communications, Vol. 20, No. 4, 2002.
[19]
W. Hao and R. Ito. Dynamics of load-sensitive adaptive routing. In Proc. IEEE International Conference on Communications (ICC), 2005.
[20]
J.-Y. Jo, Y. Kim, H. J. Chao, and F. Merat. Internet traffic load balancing using dynamic hashing with flow volume. In Proc. SPIE ITCom, 2002.
[21]
S. Kandula, D. Katabi, B. Davie, and A. Charny. Walking the tightrope: responsive yet stable traffic engineering. In Proc. ACM SIGCOMM, 2005.
[22]
D. Katz, K. Kompella, and D. Yeung. Traffic engineering extensions to OSPF version 2. Internet Draft, 2003.
[23]
A. Khanna and J. Zinky. The revised ARPANET routing metric. In Proc. ACM SIGCOMM Conference, 1989.
[24]
T. Krämer. IP traffic engineering---OSPF vs. MPLS. Master's thesis, Universität des Saarlandes, 2003.
[25]
B. Krishnamurthy and J. Rexford. Web Protocols and Practice. Addison-Wesley, 2001.
[26]
M. Laor and L. Gendel. The effect of packet reordering in a backbone link on application throughput. IEEE Network, September/October 2002.
[27]
Y. Liu and A. L. N. Reddy. Multihoming route control among a group of multihomed stub networks. Technical Report TAMU-ECE-2006-01, 2006.
[28]
K. Park and W. Willinger, editors. Self-Similar Network Traffic and Performance Evaluation. Wiley-Interscience, 2000.
[29]
C. Pelsser, S. Uhlig, and O. Bonaventure. On the difficulty of establishing interdomain LSPs. In IEEE IPOM, 2004.
[30]
J. Postel et al. RFC 793, September 1981. http://www.ietf.org/rfc/rfc793.txt.
[31]
V. Raghunathan and P. R. Kumar. A Wardrop routing protocol for ad hoc wireless networks. In IEEE CDC, 2004.
[32]
V. Raghunathan and P. R. Kumar. Issues in Wardrop routing in wireless networks. In IEEE WICON, 2005.
[33]
Renesys. The SSFNet network simulator. http://www.ssfnet.org/.
[34]
M. Roughan, M. Thorup, and Y. Zhang. Traffic engineering with estimated traffic matrices. In Proc. ACM SIGCOMM Conference, 2003.
[35]
T. Roughgarden and É. Tardos. How bad is selfish routing? J. ACM, 49(2), 2002.
[36]
N. Skrypnyuk. Load-sensitive routing. Master's thesis. TU München, 2006.
[37]
N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proc. ACM SIGCOMM Conference, Pittsburgh, PA, USA, August 2002. ACM.
[38]
A. Sridharan, R. Guérin, and C. Diot. Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. In Proc. IEEE INFOCOM Conference, 2003.
[39]
R. Teixeira. Network Sensitivity to Intradomain Routing Changes. PhD thesis, University of California San Diego, August 2005.
[40]
R. Teixeira, N. Duffield, J. Rexford, and M. Roughan. Traffic matrix reloaded: Impact of routing changes. In Proc. Passive and Active Measurement, 2005.
[41]
TOTEM---TOolbox for Traffic Engineering Methods. http://totem.run.montefiore.ulg.ac.be/.
[42]
C. Vollmert. A Web workload generator for the SSFNet network simulator. Bachelor's thesis, Technische Universität München, 2004.
[43]
J. Wallerich. Design and implementation of a WWW workload generator for the ns-2 network simulator. Master's thesis, Universität des Saarlandes, 2001.
[44]
J. Wallerich, H. Dreger, A. Feldmann, B. Krishnamurthy, and W. Willinger. A methodology for studying persistency aspects of Internet flows. ACM SIGCOMM Computer Communication Review, 35, 2005.
[45]
H. Wang, H. Xie, L. Qiu, Y. R. Yang, Y. Zhang, and A. Greenberg. COPE: Traffic engineering in dynamic networks. In Proc. ACM SIGCOMM Conference, 2006.
[46]
J. G. Wardrop. Some theoretical aspects of road traffic research. In Proc. of the Institute of Civil Engineers, Pt. II, 1952.
[47]
X. Xiao, A. Hannan, B. Bailey, and L. Ni. Traffic engineering with MPLS in the Internet. In IEEE Network Magazine, March 2000.
[48]
W. Xu and J. Rexford. Miro: Multi-path interdomain routing. In Proc. ACM SIGCOMM Conference, 2006.
[49]
C. Zhang, Z. Ge, J. Kurose, Y. Liu, and D. Towsley. Optimal routing with multiple traffic matrices: Tradeoff between average case and worst case performance. In Proc. 13th International Conference on Network Protocols (ICNP), 2005.
[50]
Y. Zhang, M. Roughan, C. Lund, and D. Donoho. An information-theoretic approach to traffic matrix estimation. In Proc. ACM SIGCOMM, 2003.

Cited By

View all
  • (2022)Leveraging eBPF to Make TCP Path-AwareIEEE Transactions on Network and Service Management10.1109/TNSM.2022.317413819:3(2827-2838)Online publication date: Sep-2022
  • (2022)Online Entanglement Routing in Quantum Networks2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)10.1109/IWQoS54832.2022.9812920(1-10)Online publication date: 10-Jun-2022
  • (2021)On the Competitiveness of Oblivious Routing: A Statistical ViewApplied Sciences10.3390/app1120940811:20(9408)Online publication date: 11-Oct-2021
  • Show More Cited By

Index Terms

  1. REPLEX: dynamic traffic engineering based on wardrop routing policies

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference
    December 2006
    318 pages
    ISBN:1595934561
    DOI:10.1145/1368436
    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: 04 December 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. convergence time
    2. dynamic routing
    3. load balancing
    4. real-time adaptive multipath routing
    5. traffic engineering
    6. wardrop equilibria

    Qualifiers

    • Research-article

    Funding Sources

    Acceptance Rates

    Overall Acceptance Rate 198 of 789 submissions, 25%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 20 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Leveraging eBPF to Make TCP Path-AwareIEEE Transactions on Network and Service Management10.1109/TNSM.2022.317413819:3(2827-2838)Online publication date: Sep-2022
    • (2022)Online Entanglement Routing in Quantum Networks2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)10.1109/IWQoS54832.2022.9812920(1-10)Online publication date: 10-Jun-2022
    • (2021)On the Competitiveness of Oblivious Routing: A Statistical ViewApplied Sciences10.3390/app1120940811:20(9408)Online publication date: 11-Oct-2021
    • (2021)On the Complexity of Weight-Dynamic Network Algorithms2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472803(1-9)Online publication date: 21-Jun-2021
    • (2021)Towards an API for the Path-Aware InternetProceedings of the ACM SIGCOMM 2021 Workshop on Network-Application Integration10.1145/3472727.3472808(68-72)Online publication date: 23-Aug-2021
    • (2021)Incentivizing Stable Path Selection in Future Internet ArchitecturesACM SIGMETRICS Performance Evaluation Review10.1145/3453953.345395648:3(12-13)Online publication date: 5-Mar-2021
    • (2020)Control Plane and Data Plane Issues in Network Layer Multipathing2020 International Conference on Information Technology Systems and Innovation (ICITSI)10.1109/ICITSI50517.2020.9264915(263-269)Online publication date: 19-Oct-2020
    • (2020)BartolomeuComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2020.107117169:COnline publication date: 14-Mar-2020
    • (2019)Discrete-Time Selfish Routing Converging to the Wardrop EquilibriumIEEE Transactions on Automatic Control10.1109/TAC.2018.284760264:3(1288-1294)Online publication date: Mar-2019
    • (2019)Testing implementation of FAMTAR: Adaptive multipath routingComputer Communications10.1016/j.comcom.2019.10.029Online publication date: Oct-2019
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media