TY - JOUR
T1 - Towards robust multi-layer traffic engineering
T2 - Optimization of congestion control and routing
AU - He, Jiayue
AU - Bresler, Maayan
AU - Chiang, Mung
AU - Rexford, Jennifer L.
N1 - Funding Information:
ACKNOWLEDGMENTS We would like to thank Jim Kurose, Steven Low, Ao Tang and the anonymous reviewers for their insightful comments. This work has been supported in part by NSF grants CNS-0519880, CCF-0635034, CCF-0448012, Cisco grant GH072605, and DARPA seedling on Design for Manageability.
PY - 2007/6
Y1 - 2007/6
N2 - In the Internet today, traffic engineering is performed assuming that the offered traffic is inelastic. In reality, end hosts adapt their sending rates to network congestion, and network operators adapt the routing to the measured traffic. This raises the question of whether the joint system of congestion control (transport layer) and routing (network layer) is stable and optimal. Using the established optimization models for TCP and traffic engineering as a basis, we find the joint system can be stabilized and often maximizes aggregate user utility. We prove that both stability and optimality of the joint system can be guaranteed for sufficiently elastic traffic simply by tuning the cost function used for traffic engineering. Then, we present a new algorithm that adapts on a smaller timescale to changes in traffic distribution and is more robust to large traffic bursts. Uniting the network and transport layers in a multi-layer approach, this algorithm, distributed adaptive traffic engineering (DATE), jointly optimizes the goals of end users and network operators and reacts quickly to avoid bottlenecks. Simulations demonstrate that DATE converges quickly
AB - In the Internet today, traffic engineering is performed assuming that the offered traffic is inelastic. In reality, end hosts adapt their sending rates to network congestion, and network operators adapt the routing to the measured traffic. This raises the question of whether the joint system of congestion control (transport layer) and routing (network layer) is stable and optimal. Using the established optimization models for TCP and traffic engineering as a basis, we find the joint system can be stabilized and often maximizes aggregate user utility. We prove that both stability and optimality of the joint system can be guaranteed for sufficiently elastic traffic simply by tuning the cost function used for traffic engineering. Then, we present a new algorithm that adapts on a smaller timescale to changes in traffic distribution and is more robust to large traffic bursts. Uniting the network and transport layers in a multi-layer approach, this algorithm, distributed adaptive traffic engineering (DATE), jointly optimizes the goals of end users and network operators and reacts quickly to avoid bottlenecks. Simulations demonstrate that DATE converges quickly
KW - Congestion control
KW - Network utility maximization
KW - Optimization
KW - Robustness
KW - Routing
KW - Traffic engineering
UR - http://www.scopus.com/inward/record.url?scp=37249034007&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=37249034007&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2007.070602
DO - 10.1109/JSAC.2007.070602
M3 - Article
AN - SCOPUS:37249034007
SN - 0733-8716
VL - 25
SP - 868
EP - 880
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 5
M1 - 4211226
ER -