2013 Fifth International Conference on Communication Systems and Networks (COMSNETS) 2013
DOI: 10.1109/comsnets.2013.6465553
|View full text |Cite
|
Sign up to set email alerts
|

A resource efficient common protection path approach for MPLS-based recovery

Abstract: MPLS-Traffic Engineering (MPLS-TE) provides many recovery mechanisms such as rerouting and protection. Existing one-to-one backup and path-based backup schemes are not resource efficient. We propose Common Protection Path (CPP), a novel protection scheme which selects a common protection path for traffic demands having the same ingress and egress routers. CPP also factors in path failure probability and restoration priority levels of the traffic demands. Simulation results show that the protection bandwidth re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Several link optimizations and link constrained routing schemes should be inculcated such that all the QoS metrics as well as residual bandwidth and buffer-space are satisfied.We propose a routing algorithm which is packet constrained and is restricted on path (tunnel or route) routing.Bandwidth and Delay Link differentiation [4][5][6] is considered as the majoraspect for incrementing the residual as well as usable bandwidth. Both link and path constrained routing algorithms such as MIRA (Minimum Interference Routing Algorithm),WSP (Widest Shortest Path),SWP (Shortest Widest Algorithm),Dijstra'sAlgorithm [1][2][3][4] suffers from certain limitations. In proposed algorithm, the packet-priority constrained routing [9]technique should be engrossed in a practical level to inculcate load balancing in order to increase stability and decrease blocking probability and packet loss.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Several link optimizations and link constrained routing schemes should be inculcated such that all the QoS metrics as well as residual bandwidth and buffer-space are satisfied.We propose a routing algorithm which is packet constrained and is restricted on path (tunnel or route) routing.Bandwidth and Delay Link differentiation [4][5][6] is considered as the majoraspect for incrementing the residual as well as usable bandwidth. Both link and path constrained routing algorithms such as MIRA (Minimum Interference Routing Algorithm),WSP (Widest Shortest Path),SWP (Shortest Widest Algorithm),Dijstra'sAlgorithm [1][2][3][4] suffers from certain limitations. In proposed algorithm, the packet-priority constrained routing [9]technique should be engrossed in a practical level to inculcate load balancing in order to increase stability and decrease blocking probability and packet loss.…”
Section: Related Workmentioning
confidence: 99%
“…In theproposed algorithm, initially the link differentiation [3,5,7] is done to reduce overheads and consequently, bandwidth fulfilled tunnels are generated. Thereafter, the high priority packets will be routed first and QoSR(QoS Routing) [3][4][5][6][7][8] is taken into consideration such that QoS parameters like delay jitter,packet loss, delay, bandwidth and cost are satisfied. In QoSR,high priority represents the direct mapping of 3 bits carried in precedence field of incoming IP header to a label field or Trade of Service (ToS).Also, different weights are given to the links which depends on their class type as well as traffic level.…”
Section: Introductionmentioning
confidence: 99%