Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

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

Open Access Open Access

Abstract

We present a new path protection algorithm, called resource sharing degree constraints (RSDCs), for survivable wavelength-division-multiplexing mesh networks. We define a parameter k to adjust the resource sharing degree (RSD). When we compute the reserved backup wavelengths, if the RSD is larger than the value of k, more wavelengths are assigned until the RSD is not greater than the value of k. With respect to previous work, RSDCs, adds a valuable elasticity in resource assignment and is able to determine the appropriate trade-offs between the resource utilization ratio and the protection ability.

©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)

References

  • View by:

  1. S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave Technol. 21, 870–883 (2003).
    [Crossref]
  2. R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photon. Netw. Commun. 8, 239–249 (2004).
    [Crossref]
  3. H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
    [Crossref]
  4. E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths,” in Optical Fiber Communication Conference, Vol. 70 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2002), pp. 544–546.
    [Crossref]
  5. M. Kodialam and T. V. Lakshman, “Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information,” IEEE/ACM Trans. Networking 11, 399–410 (2003).
    [Crossref]
  6. C. Su and X. Su, “Protection path routing on WDM networks,” in Optical Fiber Communication Conference, Vol. 54 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2001), pp. TuO2-1–TuO2-3.
  7. C. Ou, J. Zhang, H. Zang, L. H. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for shared-path protection in WDM mesh networks,” J. Lightwave Technol. 22, 1223–1232 (2004).
    [Crossref]
  8. B. G. Jozsa, D. Orincsay, and A. Kern, “Surviving multiple network failures using shared backup path protection,” in Proceedings of the International Symposium on Computers and Communication (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2003), pp. 1333–1340.
  9. L. Guo, H. Yu, and L. Li, “Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks,” Chin. Opt. Lett. 2, 379–382 (2004).
  10. L. Guo, H. Yu, and L. Li, “Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks,” Opt. Express,  12, 2327–2337 (2004), http:/www.opticsexpress.org.
    [Crossref] [PubMed]
  11. L. Guo, H. Yu, T. Zhou, and L. Li. “Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks,” in Proceedings of the International Conference on Parallel Processing Workshop (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2004), pp. 394–398.

2004 (4)

2003 (3)

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

M. Kodialam and T. V. Lakshman, “Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information,” IEEE/ACM Trans. Networking 11, 399–410 (2003).
[Crossref]

S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave Technol. 21, 870–883 (2003).
[Crossref]

Bouillet, E.

E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths,” in Optical Fiber Communication Conference, Vol. 70 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2002), pp. 544–546.
[Crossref]

Chaudhuri, S.

E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths,” in Optical Fiber Communication Conference, Vol. 70 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2002), pp. 544–546.
[Crossref]

Guo, L.

L. Guo, H. Yu, and L. Li, “Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks,” Chin. Opt. Lett. 2, 379–382 (2004).

L. Guo, H. Yu, and L. Li, “Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks,” Opt. Express,  12, 2327–2337 (2004), http:/www.opticsexpress.org.
[Crossref] [PubMed]

L. Guo, H. Yu, T. Zhou, and L. Li. “Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks,” in Proceedings of the International Conference on Parallel Processing Workshop (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2004), pp. 394–398.

He, R.

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photon. Netw. Commun. 8, 239–249 (2004).
[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

Jozsa, B. G.

B. G. Jozsa, D. Orincsay, and A. Kern, “Surviving multiple network failures using shared backup path protection,” in Proceedings of the International Symposium on Computers and Communication (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2003), pp. 1333–1340.

Kern, A.

B. G. Jozsa, D. Orincsay, and A. Kern, “Surviving multiple network failures using shared backup path protection,” in Proceedings of the International Symposium on Computers and Communication (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2003), pp. 1333–1340.

Kodialam, M.

M. Kodialam and T. V. Lakshman, “Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information,” IEEE/ACM Trans. Networking 11, 399–410 (2003).
[Crossref]

Labourdette, J. F.

E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths,” in Optical Fiber Communication Conference, Vol. 70 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2002), pp. 544–546.
[Crossref]

Lakshman, T. V.

M. Kodialam and T. V. Lakshman, “Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information,” IEEE/ACM Trans. Networking 11, 399–410 (2003).
[Crossref]

Li, L.

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photon. Netw. Commun. 8, 239–249 (2004).
[Crossref]

L. Guo, H. Yu, and L. Li, “Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks,” Chin. Opt. Lett. 2, 379–382 (2004).

L. Guo, H. Yu, and L. Li, “Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks,” Opt. Express,  12, 2327–2337 (2004), http:/www.opticsexpress.org.
[Crossref] [PubMed]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

L. Guo, H. Yu, T. Zhou, and L. Li. “Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks,” in Proceedings of the International Conference on Parallel Processing Workshop (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2004), pp. 394–398.

Mukherjee, B.

Orincsay, D.

B. G. Jozsa, D. Orincsay, and A. Kern, “Surviving multiple network failures using shared backup path protection,” in Proceedings of the International Symposium on Computers and Communication (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2003), pp. 1333–1340.

Ou, C.

Ramamurthy, R.

E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths,” in Optical Fiber Communication Conference, Vol. 70 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2002), pp. 544–546.
[Crossref]

Ramamurthy, S.

Sahasrabuddhe, L.

Sahasrabuddhe, L. H.

Song, N.

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

Su, C.

C. Su and X. Su, “Protection path routing on WDM networks,” in Optical Fiber Communication Conference, Vol. 54 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2001), pp. TuO2-1–TuO2-3.

Su, X.

C. Su and X. Su, “Protection path routing on WDM networks,” in Optical Fiber Communication Conference, Vol. 54 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2001), pp. TuO2-1–TuO2-3.

Wang, G.

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photon. Netw. Commun. 8, 239–249 (2004).
[Crossref]

Wang, S.

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

Wen, H.

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photon. Netw. Commun. 8, 239–249 (2004).
[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

Yu, H.

L. Guo, H. Yu, and L. Li, “Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks,” Chin. Opt. Lett. 2, 379–382 (2004).

L. Guo, H. Yu, and L. Li, “Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks,” Opt. Express,  12, 2327–2337 (2004), http:/www.opticsexpress.org.
[Crossref] [PubMed]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

L. Guo, H. Yu, T. Zhou, and L. Li. “Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks,” in Proceedings of the International Conference on Parallel Processing Workshop (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2004), pp. 394–398.

Zang, H.

Zhang, J.

Zhou, T.

L. Guo, H. Yu, T. Zhou, and L. Li. “Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks,” in Proceedings of the International Conference on Parallel Processing Workshop (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2004), pp. 394–398.

Chin. Opt. Lett. (1)

IEEE/ACM Trans. Networking (1)

M. Kodialam and T. V. Lakshman, “Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information,” IEEE/ACM Trans. Networking 11, 399–410 (2003).
[Crossref]

J. Lightwave Technol. (2)

Opt. Express (1)

Photon. Netw. Commun. (2)

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photon. Netw. Commun. 8, 239–249 (2004).
[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photon. Netw. Commun. 6, 253–263 (2003).
[Crossref]

Other (4)

E. Bouillet, J. F. Labourdette, R. Ramamurthy, and S. Chaudhuri, “Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths,” in Optical Fiber Communication Conference, Vol. 70 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2002), pp. 544–546.
[Crossref]

B. G. Jozsa, D. Orincsay, and A. Kern, “Surviving multiple network failures using shared backup path protection,” in Proceedings of the International Symposium on Computers and Communication (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2003), pp. 1333–1340.

C. Su and X. Su, “Protection path routing on WDM networks,” in Optical Fiber Communication Conference, Vol. 54 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2001), pp. TuO2-1–TuO2-3.

L. Guo, H. Yu, T. Zhou, and L. Li. “Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks,” in Proceedings of the International Conference on Parallel Processing Workshop (Institute of Electrical and Electronics Engineers, Piscataway, N.J., 2004), pp. 394–398.

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 (6)

Fig.1.
Fig.1. Illustration of (a) DPP and (b) SPP.
Fig. 2.
Fig. 2. Survivable situations in multilink failures for (a) SPP and (b) DPP.
Fig. 3.
Fig. 3. Illustration of reserved backup wavelengths with RSDCs when (a) RSD(t)=k=1.5, (b) RSD(t)=k=1, (c) RSD(t)=k=3.
Fig. 4.
Fig. 4. National network topology of America.
Fig. 5.
Fig. 5. As different network loads (a) the RUR versus k and (b) the blocking ratio versus k. As different k, (c) the RUR versus network load and (d) the blocking ratio versus network load.
Fig. 6.
Fig. 6. PA versus network load when (a) two random links fail, (b) three random links fail, (c) four random links fail.

Equations (6)

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

WV l n = { 1 if l bp n 0 otherwise ,
WV l = k = 0 n WV l k l L .
RSD ( l ) = WV l TP l .
c l = { if F l = 0 c l otherwise .
c l = { if l U or F l + P l < TP l ε if P l TP l c l otherwise .
RUR = l L R l l L W l .

Metrics

Select as filters


Select Topics Cancel
© Copyright 2022 | Optica Publishing Group. All Rights Reserved