Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/dynamic-load-balancing-without-packet-reordering-oYKt9G3vML
References (38)
-
B. Fortz, M. Thorup (2000)
Internet traffic engineering by optimizing OSPF weightsProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2
-
M. Shreedhar, G. Varghese (1995)
Efficient fair queueing using deficit round robin -
A. Elwalid, Cheng Jin, S. Low, I. Widjaja (2001)
MATE: MPLS adaptive traffic engineeringProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 3
-
Ming Zhang, B. Karp, S. Floyd, L. Peterson (2003)
RR-TCP: a reordering-robust TCP with DSACK11th IEEE International Conference on Network Protocols, 2003. Proceedings.
-
(1996)
Discrete Stochatic Processes -
Yufei Wang, Zheng Wang (1999)
Explicit routing algorithms for Internet traffic engineeringProceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)
-
Junos 6.3 internet software routing protocols configuration guide. www.juniper.net/techpubs/software/junos/junos63/swconfig63- routing/html -
C. Villamizar (1999)
MPLS Optimized Multipath (MPLS--OMP) -
C. Chuah (2002)
A Tier-1 ISP perspective: Design principles & observations of routing behavior -
M. Laor, L. Gendel’ (2002)
The effect of packet reordering in a backbone link on application throughputIEEE Netw., 16
-
M. Allman, W. Eddy, Shawn Ostermann (2003)
Estimating loss rates with TCPSIGMETRICS Perform. Evaluation Rev., 31
-
Jon Bennett, C. Partridge, Nicholas Shectman (1999)
Packet reordering is not pathological network behaviorIEEE/ACM Trans. Netw., 7
-
V. Ribeiro, Zhi-Li Zhang, S. Moon, C. Diot (2005)
Small-time scaling behavior of Internet backbone trafficComput. Networks, 48
-
V. Paxson, M. Allman (2000)
Computing TCP's Retransmission TimerRFC, 6298
-
E. Blanton, M. Allman (2002)
On making TCP more robust to packet reorderingComput. Commun. Rev., 32
-
Zhiruo Cao, Z. Wang, E. Zegura (2000)
Performance of hashing-based schemes for Internet load balancingProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 1
-
D. Andersen, A. Snoeren, H. Balakrishnan (2003)
Best-path vs. multi-path overlay routing -
Srikanth Kandula, D. Katabi, Bruce Davie, A. Charny (2005)
Walking the tightrope: responsive yet stable traffic engineering -
S. Amstutz (1989)
Burst switching-an updateIEEE Communications Magazine, 27
-
Lixia Zhang, S. Shenker, D. Clark (1991)
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic -
(2003)
Rate-aware splitting of aggregate traffic -
Hao Wang, Haiyong Xie, L. Qiu, Yang, Richard Yang, Yin Zhang, A. Greenberg
Cope: Traffic Engineering in Dynamic Networks -
Amit Aggarwal, S. Savage, T. Anderson (2000)
Understanding the performance of TCP pacingProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 3
-
K. Papagiannaki, N. Taft, C. Diot (2004)
Impact of flow dynamics on traffic engineering design principlesIEEE INFOCOM 2004, 4
-
B. Fortz, M. Thorup (2002)
Optimizing OSPF/IS-IS weights in a changing worldIEEE J. Sel. Areas Commun., 20
-
S. Shenker, Lixia Zhang, D. Clark (1990)
Some observations on the dynamics of a congestion control algorithmComput. Commun. Rev., 20
-
Hao Jiang, C. Dovrolis (2004)
The origin of TCP traffic burstiness in short time scales -
Zhi-Li Zhang, V. Ribeiro, S. Moon, C. Diot (2003)
Small-time scaling behaviors of Internet backbone traffic: an empirical studyIEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 3
-
C. Villamizar (1999)
OSPF Optimized Multipath (OSPF-OMP) -
(2002)
Cisco express forwarding (cef) Cisco white paper, Cisco Systems -
R. Ludwig, R. Katz (2000)
The Eifel algorithm: making TCP robust against spurious retransmissionsComput. Commun. Rev., 30
-
Yin Zhang, L. Breslau, V. Paxson, S. Shenker (2002)
On the characteristics and origins of internet flow rates -
(2005)
Passive measurement tools for internet modeling -
J. Burns, T. Ott, A. Krzesinski, K. Müller (2003)
Path selection and bandwidth allocation in MPLS networksPerform. Evaluation, 52
-
Calicrates Policroniades, Ian Pratt (2004)
USENIX Association Proceedings of the General Track : -
V. Paxson (1997)
End-to-end Internet packet dynamics -
S. Katti, D. Katabi, C. Blake, E. Kohler, Jacob Strauss (2004)
MultiQ: automated detection of multiple bottleneck capacities along a path -
M. Roughan, A. Greenberg, C. Kalmanek, M. Rumsewicz, J. Yates, Yin Zhang (2002)
Experience in measuring backbone traffic variability: models, metrics, measurements and meaning
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2007 by ACM Inc.
- ISSN
- 0146-4833
- DOI
- 10.1145/1232919.1232925
- Publisher site
- See Article on Publisher Site
Abstract
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, however, require schemes for splitting traffic across multiple paths at a fine granularity. Current splitting schemes present a tussle between slicing granularity and packet reordering. Splitting traffic at the granularity of packets quickly and accurately assigns the desired traffic share to each path, but can reorder packets within a TCP flow, confusing TCP congestion control. Splitting traffic at the granularity of a flow avoids packet reordering but may overshoot the desired shares by up to 60% in dynamic environments, resulting in low end-to-end network goodput Contrary to popular belief, we show that one can systematically split a single flow across multiple paths without causing packet reordering. We propose FLARE, a new traffic splitting algorithm that operates on bursts of packets, carefully chosen to avoid reordering. Using a combination of analysis and trace-driven simulations, we show that FLARE attains accuracy and responsiveness comparable to packet switching without reordering packets. FLARE is simple and can be implemented with a few KB of router state
Journal
ACM SIGCOMM Computer Communication Review – Association for Computing Machinery
Published: Mar 20, 2007