Title :
Volume oriented routing
Author :
Zotkiewicz, Mateusz ; Ben-Ameur, Walid
Author_Institution :
Inst. of Telecommun., Warsaw Univ. of Technol., Warsaw, Poland
Abstract :
Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.
Keywords :
directed graphs; network theory (graphs); telecommunication network routing; telecommunication traffic; directed graph; traffic matrix; volume oriented routing algorithm; Hoses; Linear matrix inequalities; Polynomials; Robustness; Routing; Telecommunications;
Conference_Titel :
Telecommunications Network Strategy and Planning Symposium (NETWORKS), 2010 14th International
Conference_Location :
Warsaw
Print_ISBN :
978-1-4244-6704-4
Electronic_ISBN :
978-1-4244-6705-1
DOI :
10.1109/NETWKS.2010.5624920
