Skip to search formSkip to main contentSkip to account menu

Shared Risk Resource Group

Shared risk resource group (commonly referred to as shared risk group or SRG) is a concept in Optical mesh network routing that different networks… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Dijkstra's algorithmFast automatic restorationGraph rewritingMultiplexer

Broader (1)

Network topology

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions
The Path Computation Element (PCE) provides functions of path computation in support of traffic engineering (TE) in Multi… 
Highly Cited
2007
Highly Cited
2007
Shared Risk Resource Group Complexity and Approximability Issues
This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion… 
2005
2005
Minimum Color Problems and Shared Risk Resource Group in Multilayer Networks
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure… 
Review
2005
Review
2005
Approximating optimal spare capacity allocation by successive survivable routing
Spare capacity allocation (SCA) is an important part of a fault tolerant network design. In the spare capacity allocation problem… 
2004
2004
Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on… 
2004
2004
Shared-path protection algorithm with differentiated reliability in meshed WDM networks
Optical fiber links, due to sharing some common physical resources, e.g., fiber cable, conduit and Right of Way, have certain… 
2003
2003
Shared Risk Link Groups Encoding and Processing
Highly Cited
2002
Highly Cited
2002
A disjoint path selection scheme with shared risk link groups in GMPLS networks
This letter proposes a disjoint path selection scheme for generalized multi-protocol label switching (GMPLS) networks with shared… 
Highly Cited
2001
Highly Cited
2001
Auto-discovery of shared risk link groups
We propose location-based techniques for the automatic discovery of shared risk link groups (SRLGs) in transport networks, which… 
Highly Cited
2001
Highly Cited
2001
Approximating optimal spare capacity allocation by successive survivable routing
The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)