Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing

Authors:
BaláZs Szviatovszki;ÁRon Szentesi;AlpáR JüTtner
Affiliations:
Traffic Analysis and Network Performance Laboratory, Ericsson Research, P.O. Box 107, H-1300 Budapest, Hungary;Traffic Analysis and Network Performance Laboratory, Ericsson Research, P.O. Box 107, H-1300 Budapest, Hungary;Traffic Analysis and Network Performance Laboratory, Ericsson Research, P.O. Box 107, H-1300 Budapest, Hungary and Communication Networks Lab, Eötvös University, Pázmány Pé ...
Venue:
Computer Communications
Year:
2002

Citing 9
Cited 2

Call preemption in communication networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Routing high-bandwidth traffic in max-min fair share networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Decentralized network connection preemption algorithms

Computer Networks and ISDN Systems
Load-sensitive routing of long-lived IP flows

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of link cost functions for PNNI routing

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special Issue: performance modeling and evaluation of ATM networks
Evaluating the impact of stale link state on quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
On path selection for traffic with bandwidth guarantees

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks

IEEE Journal on Selected Areas in Communications

Minimizing preemption cost for path selection in Diffserv-ware MPLS networks

Computer Communications
Opportunity cost analysis for dynamic wavelength routed mesh networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, we study the effect of distributed constrained shortest path first (CSPF)-based path selection on the dynamics of label switched path (LSP) preemption. We propose new CSPF algorithms for minimizing preemption of lower priority LSPs without requiring any enhancements to the recently proposed link-state parameters. The difference between priority-based path selection methods and previously proposed CSPF methods lies in the way the selection is done among equal cost shortest paths. Our priority-aware CSPF algorithms decrease the number of preempted lower priority LSPs while the LSP setup success ratio is basically the same for all methods.