A novel multicast routing algorithm and its application for protection against single-link and single-link/node failure scenarios in optical WDM mesh networks

doi:10.1364/OE.19.00B471

Optics Express

Editor: C. Martijn de Sterke
Vol. 19, Iss. 26 — Dec. 12, 2011
pp: B471–B477

A novel multicast routing algorithm and its application for protection against single-link and single-link/node failure scenarios in optical WDM mesh networks

Costas K. Constantinou and Georgios Ellinas »View Author Affiliations

Optics Express, Vol. 19, Issue 26, pp. B471-B477 (2011)
http://dx.doi.org/10.1364/OE.19.00B471

View Full Text Article

Enhanced HTML Acrobat PDF (877 KB)

Journal Search
Article Lookup

Article Tools

Share

Citations

Alert me when this article is cited
Export Citation/Save

Abstract
Article Info
References (8)
Cited By
Figures (5)
Metrics
Related Content

Abstract

A new heuristic algorithm called “Steiner Node Heuristic” (SNH) for solving the Steiner Tree problem in graphs and, consequently, for routing multicast calls in mesh optical WDM Networks, is presented. The new algorithm is used for the development of a new multicast protection technique which, as simulations show, outperforms the existing ones in terms of blocking probability and average cost, for both single-link and single-link/node failure scenarios.

OCIS Codes
(060.4255) Fiber optics and optical communications : Networks, multicast
(060.4261) Fiber optics and optical communications : Networks, protection and restoration

ToC Category:
Backbone and Core Networks

History
Original Manuscript: October 11, 2011
Revised Manuscript: November 12, 2011
Manuscript Accepted: November 14, 2011
Published: November 23, 2011

Virtual Issues
European Conference on Optical Communication 2011 (2011) Optics Express

Citation
Costas K. Constantinou and Georgios Ellinas, "A novel multicast routing algorithm and its application for protection against single-link and single-link/node failure scenarios in optical WDM mesh networks," Opt. Express 19, B471-B477 (2011)
http://www.opticsinfobase.org/oe/abstract.cfm?URI=oe-19-26-B471

Sort: Author | Year | Journal | Reset

References

R. Ramaswami, “Multiwavelength lightwave networks for computer communication,” IEEE Commun. Mag.31(2), 78–88 (1993). [CrossRef]
T. E. Stern, G. Ellinas, and K. Bala, Multiwavelength Optical Networks: Architectures, Design, and Control, 2nd ed. (Cambridge University Press, 2008).
L. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag.37(2), 67–73 (1999). [CrossRef]
R. M. Karp, “Reducibility among combinatorial problems: Complexity of computer computations,” Chap. 8 in 50 Years of Integer Programming 1958–2008, R. E. Miller and J. W. Thatcher, eds. (Plenum Press, 1972).
R. C. Prim, “Shortest connection networks and some generalizations,” Bell Syst. Tech. J.36, 1389–1401 (1957).
H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica24(6), 573–577 (1980).
N. Singhal, L. H. Sahasrabuddhe, and B. Mukherjee, “Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks,” J. Lightwave Technol.21(11), 2587–2594 (2003). [CrossRef]
C. K. Constantinou and G. Ellinas, “A novel technique for survivable multicast routing in optical WDM mesh networks,” Proc. European Conf. on Optical Communications (ECOC), Geneva, Switzerland, Sept. 2011.

Bell Syst. Tech. J.

R. C. Prim, “Shortest connection networks and some generalizations,” Bell Syst. Tech. J.36, 1389–1401 (1957).

IEEE Commun. Mag.

R. Ramaswami, “Multiwavelength lightwave networks for computer communication,” IEEE Commun. Mag.31(2), 78–88 (1993). [CrossRef]
L. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag.37(2), 67–73 (1999). [CrossRef]

J. Lightwave Technol.

N. Singhal, L. H. Sahasrabuddhe, and B. Mukherjee, “Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks,” J. Lightwave Technol.21(11), 2587–2594 (2003). [CrossRef]

Math. Japonica

H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica24(6), 573–577 (1980).

Other

C. K. Constantinou and G. Ellinas, “A novel technique for survivable multicast routing in optical WDM mesh networks,” Proc. European Conf. on Optical Communications (ECOC), Geneva, Switzerland, Sept. 2011.
R. M. Karp, “Reducibility among combinatorial problems: Complexity of computer computations,” Chap. 8 in 50 Years of Integer Programming 1958–2008, R. E. Miller and J. W. Thatcher, eds. (Plenum Press, 1972).
T. E. Stern, G. Ellinas, and K. Bala, Multiwavelength Optical Networks: Architectures, Design, and Control, 2nd ed. (Cambridge University Press, 2008).

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

Click here to see a list of articles that cite this paper