- Journal of Optical Communications and Networking
- Vol. 4,
- Issue 11,
- pp. B52-B57
- (2012)
- •https://doi.org/10.1364/JOCN.4.000B52
On Shared Risk Link Group Optimization [Invited]
Guangzhi Li, Dongmei Wang, Timothy Gallivan, and Robert Doverspike
Author Affiliations
Guangzhi Li,Dongmei Wang,Timothy Gallivan,and Robert Doverspike
AT&T Labs, New Jersey, USA
Get PDF
Email
Share
Get CitationCopy Citation TextGuangzhi Li, Dongmei Wang, Timothy Gallivan, and Robert Doverspike, "On Shared Risk Link Group Optimization [Invited]," J. Opt. Commun. Netw.4, B52-B57 (2012)Export Citation
Citation alert
Save article
- Table of Contents Category
- OFC/NFOEC 2012
Optics & Photonics TopicsThe topics in this list come from theOptics and Photonics Topics applied to this article.- Fiber networks
- Networking hardware
- Optical circuits
- Optical networks
- Ring networks
- Wavelength division multiplexing
- History
- Original Manuscript: June 1, 2012
- Revised Manuscript: July 20, 2012
- Manuscript Accepted: July 26, 2012
- Published: October 15, 2012
Abstract
Shared risk link groups (SRLGs) have been defined and implemented in many network planning tools and routing protocols. A single SRLG represents one potential failure, and a large service provider’s network could easily contain tens of thousands of potential failures. The greater the number of SRLGs, the more difficult it is to attain good performance from planning tools (like routers) whose computations are dependent on the number of SRLGs. For many routing protocols using SRLG information, the situation becomes even worse, because a routing protocol may have space constraints to hold a limited number of SRLGs. These issues create a challenge to optimize the SRLG calculations such that the SRLG-related functions are not impacted or the impacts on the SRLG-related functions are limited. This paper takes a closer look at the SRLG optimization issue and identifies the facts/observations of SRLGs. Then we propose algorithms for how to reduce the number of SRLGs for different applications based on our observations.
©2012 Optical Society of America
Full Article | PDF ArticleMore Like This
M. Masud Hasan, Farid Farahmand, and Jason P. Jue
J. Opt. Commun. Netw.7(8) 695-706 (2015)
Xu Shao, Yong Kee Yeo, Yuebin Bai, Jian Chen, Luying Zhou, and Lek Heng Ngoh
J. Opt. Commun. Netw.2(8) 587-599 (2010)
Xu Shao, Yuebin Bai, Xiaofei Cheng, Yong-Kee Yeo, Luying Zhou, and Lek Heng Ngoh
J. Opt. Commun. Netw.3(9) 739-749 (2011)
Wenjing Wang and John Doucette
J. Opt. Commun. Netw.10(5) 451-460 (2018)
Chengyi Gao, Yi Zhu, and Jason P. Jue
J. Opt. Commun. Netw.5(11) 1145-1156 (2013)
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Figures (3)
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Tables (2)
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Equations (1)
You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription