Abstract
International audience; In Multi-Protocol Label Switching-Traffic Engineering (MPLS-TE) networks with distributed tunnel path computation on head-end routers, tunnel requests are handled one by one, in an uncoordinated manner without any knowledge of future and other requests. The order in which requests are handled has a significant impact on the network optimization and blocking probability. If it is not possible to control the arrival order, in return it is possible, in some cases, to reorder requests using the preemption function. This paper evaluates the impact of the arrival order, so as to determine efficient orders. It then proposes two preemption strategies so as to reorder arrivals and evaluate these strategies applied to the shortest constrained path computation algorithm.
Original document
The different versions of the original document can be found in:
- https://www.irisa.fr/prive/Bernard.Cousin/Articles/GIIS-2007.pdf,
- https://hal.archives-ouvertes.fr/hal-01184229,
- https://hal.archives-ouvertes.fr/hal-01184229/document,
- http://www.irisa.fr/prive/bcousin/Articles/GIIS-2007.pdf,
- https://ieeexplore.ieee.org/document/4404195,
- https://academic.microsoft.com/#/detail/1990684432
Document information
Published on 01/01/2007
Volume 2007, 2007
DOI: 10.1109/giis.2007.4404195
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?