2003
DOI: 10.1007/978-3-540-45235-5_12
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of End-to-End Recovery Algorithms with Preemptive Priority in GMPLS Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…That is, the number of fully disjointed paths is limited by few. Moreover all the disjointed LSPs/spans must start and end at the same nodes [13][14][15][16]. This is very fatal restriction to support micro DC-based cloud services, which may have several active connections with different bandwidth requirements and Quality of Service (QoS) constraints.…”
Section: Reverse Shared Risk Link Groupmentioning
confidence: 99%
“…That is, the number of fully disjointed paths is limited by few. Moreover all the disjointed LSPs/spans must start and end at the same nodes [13][14][15][16]. This is very fatal restriction to support micro DC-based cloud services, which may have several active connections with different bandwidth requirements and Quality of Service (QoS) constraints.…”
Section: Reverse Shared Risk Link Groupmentioning
confidence: 99%