COPE: Traffic engineering in dynamic networks

被引:91
作者
Wang, Hao [1 ]
Xie, Haiyong
Qiu, Lili
Yang, Yang Richard
Zhang, Yin
Greenberg, Albert
机构
[1] AT&T Labs Res, Florham Pk, NJ 07932 USA
[2] Univ Texas, Austin, TX 78712 USA
[3] Yale Univ, New Haven, CT 06520 USA
关键词
algorithms; design; management; performance; reliability; COPE; traffic engineering; unpredictable traffic; optimization; oblivious routing;
D O I
10.1145/1151659.1159926
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Traffic engineering plays a critical role in determining the performance and reliability of a network. A major challenge in traffic engineering is how to cope with dynamic and unpredictable changes in traffic demand. In this paper, we propose COPE, a class of traffic engineering algorithms that optimize for the expected scenarios while providing a worst-case guarantee for unexpected scenarios. Using extensive evaluations based on real topologies and traffic traces, we show that COPE can achieve efficient resource utilization and avoid network congestion in a wide variety of scenarios.
引用
收藏
页码:99 / 110
页数:12
相关论文
共 51 条
[1]  
AGARWAL S, 2004, P JOINT INT C MEAS O
[2]  
Agarwal S, 2005, P 13 INT C NETW PROT
[3]  
Ahuja R.K., 1993, NETWORK FLOWS THEORY
[4]  
[Anonymous], 2002, RFC3272 IETF
[5]  
Applegate D., 2003, P ACM SIGCOMM 03
[6]  
APPLEGATE D, 2004, P JOINT INT C MEAS M
[7]   MPLS and traffic engineering in IP networks [J].
Awduche, DO .
IEEE COMMUNICATIONS MAGAZINE, 1999, 37 (12) :42-47
[8]  
AZAR Y, 2003, P 35 ANN S THEOR COM
[9]  
BANSAL N, 2003, P ACM S PAR ALG ARCH
[10]  
Bertsekas D., 1999, NONLINEAR PROGRAMMIN