Robust Routing Mechanisms for Intradomain Traffic Engineering in Dynamic Networks

被引:0
作者
Casas, Pedro [1 ,2 ]
Larroca, Federico [3 ]
Vaton, Sandrine [2 ]
机构
[1] Univ Republica, Fac Ingn, Montevideo, Uruguay
[2] Telecom Bretagne, Brest, France
[3] Telecom Paris Tech, Paris, France
来源
2009 LATIN AMERICAN NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM | 2009年
关键词
Traffic Uncertainty; Proactive Traffic Management; Robust Optimization; Stable and Reactive Robust Routing; End-to-End Routing Performance Evaluation;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Internet traffic is highly dynamic and difficult to predict in current network scenarios. This makes of Traffic Engineering (TE) a very challenging task for network management and resources optimization. We study the problem of Intradomain Routing Optimization under this traffic uncertainty. Recent works have proposed robust optimization techniques to tackle the problem, conceiving the Robust Routing (RR) approach. RR copes with traffic uncertainty in an off-line preemptive fashion, computing a single static routing configuration that is optimized for traffic variations within some predefined uncertainty set. Despite achieving routing reliability with relatively low performance loss, RR presents various drawbacks and conception problems as it is currently proposed. This paper brings insight into the different Robust Routing shortcomings, introducing new mechanisms that improve previous proposals and alleviate these problems. Among others, we propose and evaluate new optimization objectives to attain better global performance from an end-to-end quality of service perspective.
引用
收藏
页码:23 / +
页数:2
相关论文
共 22 条
[1]  
Ahuja RK, 1995, NETWORK FLOWS THEORY
[2]  
[Anonymous], QUEUEING SYSTEMS
[3]  
[Anonymous], GLOB IP TRAFF FOR ME
[4]  
APPLEGATE D, 2003, SIGCOMM 03
[5]   Routing of uncertain traffic demands [J].
Ben-Ameur, W ;
Kerivin, H .
OPTIMIZATION AND ENGINEERING, 2005, 6 (03) :283-313
[6]  
CASAS P, 2008, NGI 08
[7]  
CASAS P, 2007, EUROFGI WORKSH QOS T
[8]  
CHO K, 1918, WIDE TRANSIT 150 MEG
[9]   FINDING ALL EFFICIENT EXTREME POINTS FOR MULTIPLE OBJECTIVE LINEAR PROGRAMS [J].
ECKER, JG ;
KOUADA, IA .
MATHEMATICAL PROGRAMMING, 1978, 14 (02) :249-261
[10]  
ELWALID A, 2001, INFOCOM 01