Paper Info
Title
Volume-oriented routing and its modifications.
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 volume-oriented routing. The routing of each demand is a combination of two extreme routing schemes 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. However, computing an optimal volume-oriented routing is generally difficult. Then, we introduce two modifications of the presented routing paradigm such that an optimal solution can be computed in polynomial time. Numerical experiments are also provided to compare volume-oriented routing with the best routing strategy in term of costs, i.e, dynamic routing.
Year
DOI
Venue
2013
10.1007/s11235-011-9602-5
Telecommunication Systems
Keywords
Field
DocType
Volume-oriented routing, Robust routing, Dynamic routing, Traffic demand polytope
Equal-cost multi-path routing,Multipath routing,Mathematical optimization,Link-state routing protocol,Dynamic Source Routing,Policy-based routing,Static routing,Computer science,Destination-Sequenced Distance Vector routing,Distributed computing,Zone Routing Protocol
Journal
Volume
Issue
ISSN
52
2
1572-9451
Citations 
PageRank 
References 
1
0.36
18
Authors
2
Name
Order
Citations
PageRank
Mateusz Zotkiewicz1256.17
Ben Ameur Walid220528.43