DocumentCode :
3109365
Title :
Study of scalability properties of two LP-based algorithms for traffic engineering in a flat differentiated services network
Author :
Van den Bosch, Sven ; De La Vallée-Poussin, Paloma ; Van Hoey, Gert ; De Neve, Hans ; Petit, Guido
Author_Institution :
Internet Routing & Traffic Eng., Alcatel Bell Telephone, Antwerp, Belgium
fYear :
2001
fDate :
2001
Firstpage :
180
Lastpage :
184
Abstract :
Two mixed-integer linear programming (MILP) formulations of a centralized, off-line traffic engineering tool are compared with respect to their scalability properties. Such an algorithm can be used to optimize the routing configuration in a DiffServ network. It is shown that a considerable reduction of the number of variables and constraints can be obtained by pairing primary and protection path candidates prior to the routing optimization. Simulations of networks with different sizes evidence this result,
Keywords :
Internet; integer programming; linear programming; telecommunication network routing; telecommunication services; telecommunication traffic; DiffServ network; Internet; LP-based algorithms; centralized off-line traffic engineering tool; flat differentiated services network; mixed-integer linear programming; network simulation; network size; primary path; protection path; routing configuration optimisation; routing optimization; scalability properties; Diffserv networks; IP networks; Intelligent networks; Nonlinear filters; Protection; Routing; Scalability; Telecommunication traffic; Topology; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Switching and Routing, 2001 IEEE Workshop on
Conference_Location :
Dallas, TX
Print_ISBN :
0-7803-6711-1
Type :
conf
DOI :
10.1109/HPSR.2001.923628
Filename :
923628
Link To Document :
بازگشت