Volume-oriented routing and its modifications
Mateusz Żotkiewicz , Walid Ben-Ameur
AbstractAssuming 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.
|Journal series||Telecommunication Systems, ISSN 1018-4864|
|Keywords in English||Volume-oriented routing · Robust routing · Dynamic routing · Traffic demand polytope|
|Project||Optimization models and methods for planning of integrated transport network under uncertain, and short-term and long-term variable traffic demand. Project leader: Pióro Michał,
, Phone: +48 22 234-7383, start date 08-10-2010, planned end date 08-10-2011, end date 31-03-2012, IT/2008/SPUB/07, Completed
The Develpment of Digital Communicatios. Project leader: Lubacz Józef, , Phone: 22 234 65 31, start date 04-05-2012, planned end date 31-03-2013, end date 31-12-2013, IT/2012/statut, Completed
|Score|| = 20.0, 04-03-2020, ArticleFromJournal|
= 25.0, 04-03-2020, ArticleFromJournal
|Publication indicators||= 2; = 1.0; : 2014 = 1.174; : 2013 = 1.163 (2) - 2013=1.201 (5)|
|Citation count*||1 (2014-12-24)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.