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.

© 2011 OSA

PDF Article

References

  • View by:
  • |
  • |
  • |

  1. R. Ramaswami, “Multiwavelength lightwave networks for computer communication,” IEEE Commun. Mag. 31(2), 78–88 (1993).
    [CrossRef]
  2. T. E. Stern, G. Ellinas, and K. Bala, Multiwavelength Optical Networks: Architectures, Design, and Control, 2nd ed. (Cambridge University Press, 2008).
  3. 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]
  4. 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).
  5. R. C. Prim, “Shortest connection networks and some generalizations,” Bell Syst. Tech. J. 36, 1389–1401 (1957).
  6. H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica 24(6), 573–577 (1980).
  7. 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]
  8. 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.

2003

1999

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]

1993

R. Ramaswami, “Multiwavelength lightwave networks for computer communication,” IEEE Commun. Mag. 31(2), 78–88 (1993).
[CrossRef]

1980

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

1957

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

Bala, K.

T. E. Stern, G. Ellinas, and K. Bala, Multiwavelength Optical Networks: Architectures, Design, and Control, 2nd ed. (Cambridge University Press, 2008).

Constantinou, C. K.

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.

Ellinas, G.

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.

T. E. Stern, G. Ellinas, and K. Bala, Multiwavelength Optical Networks: Architectures, Design, and Control, 2nd ed. (Cambridge University Press, 2008).

Karp, R. M.

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

Matsuyama, A.

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

Mukherjee, B.

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]

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]

Prim, R. C.

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

Ramaswami, R.

R. Ramaswami, “Multiwavelength lightwave networks for computer communication,” IEEE Commun. Mag. 31(2), 78–88 (1993).
[CrossRef]

Sahasrabuddhe, L.

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]

Sahasrabuddhe, L. H.

Singhal, N.

Stern, T. E.

T. E. Stern, G. Ellinas, and K. Bala, Multiwavelength Optical Networks: Architectures, Design, and Control, 2nd ed. (Cambridge University Press, 2008).

Takahashi, H.

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

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.

Math. Japonica

H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica 24(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

OSA participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.


Metrics