BROWSE
Detail
Journal Article
M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering
- Authors
- Daniel W. Hong, Choong Seon Hong, Gil Haeng Lee
- Issue Date
- 2005-12
- Citation
- ETRI Journal, v.27, no.6, pp.733-746
- ISSN
- 1225-6463
- Publisher
- 한국전자통신연구원 (ETRI)
- Language
- English
- Type
- Journal Article
- Abstract
- In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraint-based shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.
- KSP Keywords
- End to End(E2E), End-to-end delay constraint, Label switched path, MPLS Traffic engineering, Minimum interference routing, Multi-Protocol Label Switching, Network topology, Optimal Route, QOS Metrics, QoS constraints, Resource utilization efficiency