Latest revision as of 13:31, 21 January 2021

Abstract

The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over links that: 1) have high potential to be part of any other paths, and 2) have less residual bandwidth available. We compare DORA against other existing constraint-based routing algorithms based on two performance metrics: path setup rejection ratio and percentage of successful reroutes. Our result shows that DORA performs better than the other algorithms in both metrics.

Original document

The different versions of the original document can be found in:

• https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf

• http://link.springer.com/content/pdf/10.1007/3-540-47906-6_76,

http://dx.doi.org/10.1007/3-540-47906-6_76

• https://link.springer.com/chapter/10.1007%2F3-540-47906-6_76,

https://dblp.uni-trier.de/db/conf/networking/networking2002.html#SzetoBI02,

https://www.researchgate.net/profile/R_Boutaba/publication/221198635_Dynamic_Online_Routing_Algorithm_for_MPLS_Traffic_Engineering/links/0912f5076e20d617de000000.pdf?disableCoverPage=true,

https://dl.acm.org/citation.cfm?id=714766,

https://link.springer.com/10.1007/3-540-47906-6_76,

https://academic.microsoft.com/#/detail/1522894013

• [ ]