Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
Journal Home About Issues in Progress Current Issue All Issues Feature Issues

Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks

Lei Guo, Hongfang Yu, and Lemin Li

Open Access Open Access

Abstract

A routing-selection algorithm is important in survivable wavelength-division networks. A sound algorithm should carefully consider the efficiency of resource utilization and the protection-switching time. Under shared-risk link group constraints with differentiated reliability (DiR), a novel algorithm for a shared path, called a joint routing-selection algorithm (JRSA) with DiR, is proposed. The simulation results show that a JRSA with DiR not only can efficiently satisfy the specific requirements of users but also can produce nearly optimal performance and determine the appropriatetrade-offs between the resource utilization ratio and the protection-switching time.

©2004 Optical Society of America

Full Article  |  PDF Article
More Like This
Dynamic segment shared protection algorithm for reliable wavelength-division-multiplexing mesh networks

Jin Cao, Lei Guo, Hongfang Yu, and Lemin Li
Opt. Express 13(8) 3087-3095 (2005)

Path protection algorithm with trade-off ability for survivable wavelength-division-multiplexing mesh networks

Lei Guo, Hongfang Yu, and Lemin Li
Opt. Express 12(24) 5834-5839 (2004)

A new heuristic algorithm with shared segment-backup paths for trap avoidance in survivable optical networks

Lei Guo, Lemin Li, Jin Cao, and Hongfang Yu
Opt. Express 14(23) 10990-10995 (2006)

View More...

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (7)
Fig. 1.
Fig. 1. (a) Fiber cable (1–4) topology, (b) fiber link topology, (c) fiber cable (1–2 and 4–3) topology, (d) conduit topology.

Download Full Size | PDF

Fig. 2.
Fig. 2. Protection-switching time illustrated for shared-path protection.

Download Full Size | PDF

Fig. 3.
Fig. 3. USA (the United States of America) network topology.

Download Full Size | PDF

Fig. 4.
Fig. 4. (a) RUPC versus α, (b) BR versus α, (c) PST [ms] versus α.

Download Full Size | PDF

Fig. 5.
Fig. 5. (a) RUPC versus network load, (b) BR versus network load, (c) PST [ms] versus network load.

Download Full Size | PDF

Fig. 6.
Fig. 6. (a) RUPC versus network load, (b) BR versus network load, (c) PST [ms] versus network load.

Download Full Size | PDF

Fig. 7.
Fig. 7. Actual reliability versus number of connection requests when (a) RD=96% and (b) RD=98%.

Download Full Size | PDF

Equations (12)

Equations on this page are rendered with MathJax. Learn more.

P ( wp n ) = ∏ l ∈ wp n P ( l ) .
P ( wp n failure ) = 1 − ∏ l ∈ wp n P ( l ) .
P ( wp n failure ∩ bp n failure ) = P ( wp n failure ) × P ( bp n failure ∣ wp n failure ) ,
P ( bp n failure ∣ wp n failure ) = Max SRLG ∈ CS [ CP ( SRLG ) ] .
P ( wp n , bp n ) = 1 − P ( wp n failure ∩ bp n failure ) = 1 − P ( wp n failure ) × Max SRLG ∈ CS [ CP ( SRLG ) ] .
P ( w p n ) ≥ R D .
1 − P ( w p n failure ) × C P ( s l ) ≥ R D .
t k = F + n × P + ( n + 1 ) × D + 2 × m × P + 2 × ( m + 1 ) × D + ( m + 1 ) × X .
c ′ l = { + ∞ ( s l ∩ U ≠ ∅ ) ∪ ( r l + p l < t p 1 ) ε p l ≥ tp l c l otherwise
A n = α H n + ∑ l ∈ L a l .
RUPC = ∑ l ∈ L a l ⁄ ∣ E ∣ .
PST = ∑ k ∈ M t k ⁄ ∣ M ∣ .
Select as filters
Select Topics Cancel
Top
       
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.
Privacy | Terms of Use