Abstract

In this paper we present the static manycast routing and wavelength assignment (MA-RWA) problem along with heuristics and an integer linear program (ILP) to solve it. Manycast is a point-to-multipoint communication paradigm with applications in e-Science, Grid, and cloud computing. A manycast request specifies a candidate set of destinations, of which a subset must be reached. To solve MA-RWA, a light-tree must be assigned to each manycast request in a static set such that the number of wavelengths required is minimized. We present two heuristics, the shortest path heuristic (SPT) and the lambda path heuristic (LPH), a tabu search meta-heuristic (TS), and an ILP formulation. We show that TS provides results close to the optimal solution (from the ILP) for small networks. We then show that TS provides a 10% improvement over LPH and a 30%–40% improvement over SPT for various realistic networks.

© 2010 Optical Society of America

Full Article  |  PDF Article

References

  • View by:
  • |
  • |
  • |

  1. G. E. Keiser, “A review of WDM technology and applications,” Opt. Fiber Technol., vol. 5, no. 1, pp. 3–39, 1999.
    [CrossRef]
  2. R. Ramaswami, K. N. Sivarajan, “Routing and wavelength assignment in all-optical networks,” IEEE/ACM Trans. Netw., vol. 3, no. 5, pp. 489–500, 1995.
    [CrossRef]
  3. I. Chlamatac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE/ACM Trans. Netw., vol. 40, no. 7, pp. 1171–1182, July 1992.
  4. H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.
  5. S. Y. Cheung, A. Kumar, “Efficient quorumcast routing algorithms,” in Proc. IEEE INFOCOM, 1994, pp. 840–847.
  6. R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.
  7. B. G. Bathula, V. M. Vokkarane, “QoS-based manycasting over optical burst-switched (OBS) networks,” IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 271–283, Feb. 2010.
    [CrossRef]
  8. L. H. Sahasrabuddhe, B. Mukherjee, “Light trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, no. 2, pp. 67–73, Feb. 1999.
    [CrossRef]
  9. R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations. Springer, 1972, pp. 85–103.
    [CrossRef]
  10. W. S. Hu, Q. J. Zeng, “Multicasting optical cross connects employing splitter-and-delivery switch,” IEEE Photon. Technol. Lett., vol. 10, pp. 970–972, 1998.
    [CrossRef]
  11. J. Leuthold, C. H. Joyner, “Multimode interference couplers with tunable power splitting ratios,” J. Lightwave Technol., vol. 19, no. 5, pp. 700–707, May 2001.
    [CrossRef]
  12. H. S. Chung, S. H. Chang, K. Kim, “Experimental demonstration of layer-1 multicast for WDM networks using reconfigurable OADM,” Opt. Fiber Technol., vol. 15, no. 5–6, pp. 431–437, 2009.
    [CrossRef]
  13. R. Jain, “Internet 3.0: ten problems with current Internet architecture and solutions for the next generation,” in Proc. IEEE MILCOMM, 2006, pp. 1–9.
  14. “Large hadron collider (LHC) project,” http://lhc.web.cern.ch/lhc.
  15. R. Malli, X. Zhang, C. Qiao, “Benefits of multicasting in all-optical networks,” in Proc. All-Optical Networking, 1998, pp. 209–220.
  16. G. Sahin, M. Azizoglu, “Multicast routing and wavelength assignment in wide-area networks,” Proc. SPIE, vol. 3531, pp. 196–208, 1998.
    [CrossRef]
  17. M. Ali, J. S. Deogun, “Power-efficient design of multicast wavelength-routed networks,” IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1852–1862, Oct. 2000.
    [CrossRef]
  18. J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
    [CrossRef]
  19. X. Zhang, J. Y. Wei, C. Qiao, “Constrained multicast routing in WDM networks with sparse light splitting,” J. Lightwave Technol., vol. 18, no. 12, pp. 1917–1927, Dec. 2000.
    [CrossRef]
  20. L. H. Sahasrabuddhe, B. Mukherjee, “Multicast routing algorithms and protocols: a tutorial,” IEEE Network, vol. 14, no. 1, pp. 90–102, Jan./Feb. 2000.
    [CrossRef]
  21. R. Libeskind-Hadas, R. Melhem, “Multicast routing and wavelength assignment in multihop optical networks,” IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 621–629, 2002.
    [CrossRef]
  22. B. Chen, J. Wang, “Efficient routing and wavelength assignment for multicast in WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 97–109, Jan. 2002.
    [CrossRef]
  23. S. Sankaranarayanan, S. Subramaniam, “Comprehensive performance modeling and analysis of multicasting in optical networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1399–1413, Nov. 2003.
    [CrossRef]
  24. Y. Xin, G. N. Rouskas, “Multicast routing under optical layer constraints,” in Proc. IEEE INFOCOM, 2004, vol. 4, pp. 2731–2742.
  25. B. Du, J. Gu, D. H. K. Tsang, W. Wang, “Quorumcast routing by multispace search,” in Proc. IEEE GLOBECOM, Nov. 1996, vol. 2, pp. 1069–1073.
  26. C. P. Low, “Optimal quorumcast routing,” in Proc. IEEE GLOBECOM, 1998, vol. 5, pp. 3013–3016.
  27. B. Wang, J. Hou, “An efficient QoS routing algorithm for quorumcast communication,” in Proc. IEEE ICNP, 2001, pp. 110–118.
  28. F. A. Chudak, T. Roughgarden, D. P. Williamson, “Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,” Math. Program., vol. 100, no. 2, pp. 411–421, 2004.
    [CrossRef]
  29. X. Huang, Q. She, V. M. Vokkarane, J. P. Jue, “Manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2007, pp. 2353–2358.
  30. Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.
  31. B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, S. Talabathula, “Impairment-aware manycast algorithms over optical burst-switched networks,” in Proc. IEEE ICCCN, 2008.
  32. Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
    [CrossRef]
  33. D. Din, “A hybrid method for solving ARWA problem on WDM network,” Comput. Commun., vol. 30, no. 2, pp. 385–395, 2007.
    [CrossRef]
  34. S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
    [CrossRef]
  35. J. P. Jue, “Lightpath establishment in wavelength-routed WDM optical networks,” in Optical Networks: Recent Advances. Springer, 2001, pp. 99–122.
    [CrossRef]
  36. M. Andrews, L. Zhang, “Complexity of wavelength assignment in optical network optimization,” IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 646–657, 2009.
    [CrossRef]
  37. H. Takahashi, A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica, vol. 24, no. 6, pp. 573–577, 1980.
  38. F. Glover, M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.
    [CrossRef]
  39. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, “Routing foreseeable lightpath demands using a tabu search meta-heuristic,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2803–2807.
  40. Y. Wang, T.-H. Cheng, M.-H. Lim, “A tabu search algorithm for static routing and wavelength assignment problem,” IEEE Commun. Lett., vol. 9, no. 9, pp. 841–843, Sept. 2005.
    [CrossRef]
  41. C. Dzongang, P. Galinier, S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks,” IEEE Commun. Lett., vol. 9, no. 5, pp. 426–428, May 2005.
    [CrossRef]
  42. “NP science network requirements,” 2008, http://www.es.net/pub/esnet-doc/NP-Net-Req-Workshop-2008-Final-Report.pdf.
  43. V. M. Vokkarane, B. G. Bathula, “Manycast service in optical burst/packet switched (OBS/OPS) networks (Invited Paper),” in ICST/ACM GridNets, 2008, pp. 231–242
  44. B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, “Impairment-aware manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2008, pp. 5234–5238.

2010 (1)

B. G. Bathula, V. M. Vokkarane, “QoS-based manycasting over optical burst-switched (OBS) networks,” IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 271–283, Feb. 2010.
[CrossRef]

2009 (4)

Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
[CrossRef]

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

M. Andrews, L. Zhang, “Complexity of wavelength assignment in optical network optimization,” IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 646–657, 2009.
[CrossRef]

H. S. Chung, S. H. Chang, K. Kim, “Experimental demonstration of layer-1 multicast for WDM networks using reconfigurable OADM,” Opt. Fiber Technol., vol. 15, no. 5–6, pp. 431–437, 2009.
[CrossRef]

2007 (1)

D. Din, “A hybrid method for solving ARWA problem on WDM network,” Comput. Commun., vol. 30, no. 2, pp. 385–395, 2007.
[CrossRef]

2005 (2)

Y. Wang, T.-H. Cheng, M.-H. Lim, “A tabu search algorithm for static routing and wavelength assignment problem,” IEEE Commun. Lett., vol. 9, no. 9, pp. 841–843, Sept. 2005.
[CrossRef]

C. Dzongang, P. Galinier, S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks,” IEEE Commun. Lett., vol. 9, no. 5, pp. 426–428, May 2005.
[CrossRef]

2004 (1)

F. A. Chudak, T. Roughgarden, D. P. Williamson, “Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,” Math. Program., vol. 100, no. 2, pp. 411–421, 2004.
[CrossRef]

2003 (1)

S. Sankaranarayanan, S. Subramaniam, “Comprehensive performance modeling and analysis of multicasting in optical networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1399–1413, Nov. 2003.
[CrossRef]

2002 (2)

R. Libeskind-Hadas, R. Melhem, “Multicast routing and wavelength assignment in multihop optical networks,” IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 621–629, 2002.
[CrossRef]

B. Chen, J. Wang, “Efficient routing and wavelength assignment for multicast in WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 97–109, Jan. 2002.
[CrossRef]

2001 (1)

2000 (5)

X. Zhang, J. Y. Wei, C. Qiao, “Constrained multicast routing in WDM networks with sparse light splitting,” J. Lightwave Technol., vol. 18, no. 12, pp. 1917–1927, Dec. 2000.
[CrossRef]

M. Ali, J. S. Deogun, “Power-efficient design of multicast wavelength-routed networks,” IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1852–1862, Oct. 2000.
[CrossRef]

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.

L. H. Sahasrabuddhe, B. Mukherjee, “Multicast routing algorithms and protocols: a tutorial,” IEEE Network, vol. 14, no. 1, pp. 90–102, Jan./Feb. 2000.
[CrossRef]

1999 (2)

L. H. Sahasrabuddhe, B. Mukherjee, “Light trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, no. 2, pp. 67–73, Feb. 1999.
[CrossRef]

G. E. Keiser, “A review of WDM technology and applications,” Opt. Fiber Technol., vol. 5, no. 1, pp. 3–39, 1999.
[CrossRef]

1998 (2)

W. S. Hu, Q. J. Zeng, “Multicasting optical cross connects employing splitter-and-delivery switch,” IEEE Photon. Technol. Lett., vol. 10, pp. 970–972, 1998.
[CrossRef]

G. Sahin, M. Azizoglu, “Multicast routing and wavelength assignment in wide-area networks,” Proc. SPIE, vol. 3531, pp. 196–208, 1998.
[CrossRef]

1995 (1)

R. Ramaswami, K. N. Sivarajan, “Routing and wavelength assignment in all-optical networks,” IEEE/ACM Trans. Netw., vol. 3, no. 5, pp. 489–500, 1995.
[CrossRef]

1992 (1)

I. Chlamatac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE/ACM Trans. Netw., vol. 40, no. 7, pp. 1171–1182, July 1992.

1980 (1)

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

Ali, M.

M. Ali, J. S. Deogun, “Power-efficient design of multicast wavelength-routed networks,” IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1852–1862, Oct. 2000.
[CrossRef]

Andrews, M.

M. Andrews, L. Zhang, “Complexity of wavelength assignment in optical network optimization,” IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 646–657, 2009.
[CrossRef]

Azizoglu, M.

G. Sahin, M. Azizoglu, “Multicast routing and wavelength assignment in wide-area networks,” Proc. SPIE, vol. 3531, pp. 196–208, 1998.
[CrossRef]

Azodolmolky, S.

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

Bathula, B. G.

B. G. Bathula, V. M. Vokkarane, “QoS-based manycasting over optical burst-switched (OBS) networks,” IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 271–283, Feb. 2010.
[CrossRef]

V. M. Vokkarane, B. G. Bathula, “Manycast service in optical burst/packet switched (OBS/OPS) networks (Invited Paper),” in ICST/ACM GridNets, 2008, pp. 231–242

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, S. Talabathula, “Impairment-aware manycast algorithms over optical burst-switched networks,” in Proc. IEEE ICCCN, 2008.

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, “Impairment-aware manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2008, pp. 5234–5238.

Bermond, J.

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

Bikram, R. R. C.

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, S. Talabathula, “Impairment-aware manycast algorithms over optical burst-switched networks,” in Proc. IEEE ICCCN, 2008.

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, “Impairment-aware manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2008, pp. 5234–5238.

Careglio, D.

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

Chang, S. H.

H. S. Chung, S. H. Chang, K. Kim, “Experimental demonstration of layer-1 multicast for WDM networks using reconfigurable OADM,” Opt. Fiber Technol., vol. 15, no. 5–6, pp. 431–437, 2009.
[CrossRef]

Chen, B.

B. Chen, J. Wang, “Efficient routing and wavelength assignment for multicast in WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 97–109, Jan. 2002.
[CrossRef]

Cheng, T.-H.

Y. Wang, T.-H. Cheng, M.-H. Lim, “A tabu search algorithm for static routing and wavelength assignment problem,” IEEE Commun. Lett., vol. 9, no. 9, pp. 841–843, Sept. 2005.
[CrossRef]

Cheung, S. Y.

S. Y. Cheung, A. Kumar, “Efficient quorumcast routing algorithms,” in Proc. IEEE INFOCOM, 1994, pp. 840–847.

Chlamatac, I.

I. Chlamatac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE/ACM Trans. Netw., vol. 40, no. 7, pp. 1171–1182, July 1992.

Chudak, F. A.

F. A. Chudak, T. Roughgarden, D. P. Williamson, “Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,” Math. Program., vol. 100, no. 2, pp. 411–421, 2004.
[CrossRef]

Chung, H. S.

H. S. Chung, S. H. Chang, K. Kim, “Experimental demonstration of layer-1 multicast for WDM networks using reconfigurable OADM,” Opt. Fiber Technol., vol. 15, no. 5–6, pp. 431–437, 2009.
[CrossRef]

Deogun, J. S.

M. Ali, J. S. Deogun, “Power-efficient design of multicast wavelength-routed networks,” IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1852–1862, Oct. 2000.
[CrossRef]

Din, D.

D. Din, “A hybrid method for solving ARWA problem on WDM network,” Comput. Commun., vol. 30, no. 2, pp. 385–395, 2007.
[CrossRef]

Dotaro, E.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, “Routing foreseeable lightpath demands using a tabu search meta-heuristic,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2803–2807.

Du, B.

B. Du, J. Gu, D. H. K. Tsang, W. Wang, “Quorumcast routing by multispace search,” in Proc. IEEE GLOBECOM, Nov. 1996, vol. 2, pp. 1069–1073.

Dzongang, C.

C. Dzongang, P. Galinier, S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks,” IEEE Commun. Lett., vol. 9, no. 5, pp. 426–428, May 2005.
[CrossRef]

Gagnaire, M.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, “Routing foreseeable lightpath demands using a tabu search meta-heuristic,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2803–2807.

Galinier, P.

C. Dzongang, P. Galinier, S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks,” IEEE Commun. Lett., vol. 9, no. 5, pp. 426–428, May 2005.
[CrossRef]

Ganz, A.

I. Chlamatac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE/ACM Trans. Netw., vol. 40, no. 7, pp. 1171–1182, July 1992.

Gargano, L.

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

Glover, F.

F. Glover, M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.
[CrossRef]

Gu, J.

B. Du, J. Gu, D. H. K. Tsang, W. Wang, “Quorumcast routing by multispace search,” in Proc. IEEE GLOBECOM, Nov. 1996, vol. 2, pp. 1069–1073.

Hou, J.

B. Wang, J. Hou, “An efficient QoS routing algorithm for quorumcast communication,” in Proc. IEEE ICNP, 2001, pp. 110–118.

Hu, W. S.

W. S. Hu, Q. J. Zeng, “Multicasting optical cross connects employing splitter-and-delivery switch,” IEEE Photon. Technol. Lett., vol. 10, pp. 970–972, 1998.
[CrossRef]

Huang, X.

X. Huang, Q. She, V. M. Vokkarane, J. P. Jue, “Manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2007, pp. 2353–2358.

Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.

Jain, R.

R. Jain, “Internet 3.0: ten problems with current Internet architecture and solutions for the next generation,” in Proc. IEEE MILCOMM, 2006, pp. 1–9.

Joyner, C. H.

Jue, J. P.

Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
[CrossRef]

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.

X. Huang, Q. She, V. M. Vokkarane, J. P. Jue, “Manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2007, pp. 2353–2358.

Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.

J. P. Jue, “Lightpath establishment in wavelength-routed WDM optical networks,” in Optical Networks: Recent Advances. Springer, 2001, pp. 99–122.
[CrossRef]

Kannasoot, N.

Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
[CrossRef]

Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.

Karmi, G.

I. Chlamatac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE/ACM Trans. Netw., vol. 40, no. 7, pp. 1171–1182, July 1992.

Karp, R. M.

R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations. Springer, 1972, pp. 85–103.
[CrossRef]

Keiser, G. E.

G. E. Keiser, “A review of WDM technology and applications,” Opt. Fiber Technol., vol. 5, no. 1, pp. 3–39, 1999.
[CrossRef]

Kim, K.

H. S. Chung, S. H. Chang, K. Kim, “Experimental demonstration of layer-1 multicast for WDM networks using reconfigurable OADM,” Opt. Fiber Technol., vol. 15, no. 5–6, pp. 431–437, 2009.
[CrossRef]

Kim, Y.-C.

Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
[CrossRef]

Klinkowski, M.

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

Kumar, A.

S. Y. Cheung, A. Kumar, “Efficient quorumcast routing algorithms,” in Proc. IEEE INFOCOM, 1994, pp. 840–847.

Kuri, J.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, “Routing foreseeable lightpath demands using a tabu search meta-heuristic,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2803–2807.

Laguna, M.

F. Glover, M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.
[CrossRef]

Leuthold, J.

Libeskind-Hadas, R.

R. Libeskind-Hadas, R. Melhem, “Multicast routing and wavelength assignment in multihop optical networks,” IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 621–629, 2002.
[CrossRef]

Lim, M.-H.

Y. Wang, T.-H. Cheng, M.-H. Lim, “A tabu search algorithm for static routing and wavelength assignment problem,” IEEE Commun. Lett., vol. 9, no. 9, pp. 841–843, Sept. 2005.
[CrossRef]

Low, C. P.

C. P. Low, “Optimal quorumcast routing,” in Proc. IEEE GLOBECOM, 1998, vol. 5, pp. 3013–3016.

Malli, R.

R. Malli, X. Zhang, C. Qiao, “Benefits of multicasting in all-optical networks,” in Proc. All-Optical Networking, 1998, pp. 209–220.

Marathe, M. V.

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.

Marin, E.

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

Matsuyama, A.

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

Melhem, R.

R. Libeskind-Hadas, R. Melhem, “Multicast routing and wavelength assignment in multihop optical networks,” IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 621–629, 2002.
[CrossRef]

Mukherjee, B.

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.

L. H. Sahasrabuddhe, B. Mukherjee, “Multicast routing algorithms and protocols: a tutorial,” IEEE Network, vol. 14, no. 1, pp. 90–102, Jan./Feb. 2000.
[CrossRef]

L. H. Sahasrabuddhe, B. Mukherjee, “Light trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, no. 2, pp. 67–73, Feb. 1999.
[CrossRef]

Pareta, J. S.

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

Perennes, S.

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

Pierre, S.

C. Dzongang, P. Galinier, S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks,” IEEE Commun. Lett., vol. 9, no. 5, pp. 426–428, May 2005.
[CrossRef]

Puech, N.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, “Routing foreseeable lightpath demands using a tabu search meta-heuristic,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2803–2807.

Qiao, C.

X. Zhang, J. Y. Wei, C. Qiao, “Constrained multicast routing in WDM networks with sparse light splitting,” J. Lightwave Technol., vol. 18, no. 12, pp. 1917–1927, Dec. 2000.
[CrossRef]

R. Malli, X. Zhang, C. Qiao, “Benefits of multicasting in all-optical networks,” in Proc. All-Optical Networking, 1998, pp. 209–220.

Qiong, Z.

Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.

Ramaswami, R.

R. Ramaswami, K. N. Sivarajan, “Routing and wavelength assignment in all-optical networks,” IEEE/ACM Trans. Netw., vol. 3, no. 5, pp. 489–500, 1995.
[CrossRef]

Ravi, R.

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.

Ravi, S. S.

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.

Rescigno, A. A.

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

Rosenkrantz, D. J.

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.

Roughgarden, T.

F. A. Chudak, T. Roughgarden, D. P. Williamson, “Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,” Math. Program., vol. 100, no. 2, pp. 411–421, 2004.
[CrossRef]

Rouskas, G. N.

Y. Xin, G. N. Rouskas, “Multicast routing under optical layer constraints,” in Proc. IEEE INFOCOM, 2004, vol. 4, pp. 2731–2742.

Sahasrabuddhe, L. H.

L. H. Sahasrabuddhe, B. Mukherjee, “Multicast routing algorithms and protocols: a tutorial,” IEEE Network, vol. 14, no. 1, pp. 90–102, Jan./Feb. 2000.
[CrossRef]

L. H. Sahasrabuddhe, B. Mukherjee, “Light trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, no. 2, pp. 67–73, Feb. 1999.
[CrossRef]

Sahin, G.

G. Sahin, M. Azizoglu, “Multicast routing and wavelength assignment in wide-area networks,” Proc. SPIE, vol. 3531, pp. 196–208, 1998.
[CrossRef]

Sankaranarayanan, S.

S. Sankaranarayanan, S. Subramaniam, “Comprehensive performance modeling and analysis of multicasting in optical networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1399–1413, Nov. 2003.
[CrossRef]

She, Q.

Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
[CrossRef]

Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.

X. Huang, Q. She, V. M. Vokkarane, J. P. Jue, “Manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2007, pp. 2353–2358.

Sivarajan, K. N.

R. Ramaswami, K. N. Sivarajan, “Routing and wavelength assignment in all-optical networks,” IEEE/ACM Trans. Netw., vol. 3, no. 5, pp. 489–500, 1995.
[CrossRef]

Subramaniam, S.

S. Sankaranarayanan, S. Subramaniam, “Comprehensive performance modeling and analysis of multicasting in optical networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1399–1413, Nov. 2003.
[CrossRef]

Sundaram, R.

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.

Takahashi, H.

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

Talabathula, S.

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, S. Talabathula, “Impairment-aware manycast algorithms over optical burst-switched networks,” in Proc. IEEE ICCCN, 2008.

Tomkos, I.

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

Tsang, D. H. K.

B. Du, J. Gu, D. H. K. Tsang, W. Wang, “Quorumcast routing by multispace search,” in Proc. IEEE GLOBECOM, Nov. 1996, vol. 2, pp. 1069–1073.

Vaccaro, U.

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

Vokkarane, V. M.

B. G. Bathula, V. M. Vokkarane, “QoS-based manycasting over optical burst-switched (OBS) networks,” IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 271–283, Feb. 2010.
[CrossRef]

V. M. Vokkarane, B. G. Bathula, “Manycast service in optical burst/packet switched (OBS/OPS) networks (Invited Paper),” in ICST/ACM GridNets, 2008, pp. 231–242

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, S. Talabathula, “Impairment-aware manycast algorithms over optical burst-switched networks,” in Proc. IEEE ICCCN, 2008.

X. Huang, Q. She, V. M. Vokkarane, J. P. Jue, “Manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2007, pp. 2353–2358.

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, “Impairment-aware manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2008, pp. 5234–5238.

Wang, B.

B. Wang, J. Hou, “An efficient QoS routing algorithm for quorumcast communication,” in Proc. IEEE ICNP, 2001, pp. 110–118.

Wang, J.

B. Chen, J. Wang, “Efficient routing and wavelength assignment for multicast in WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 97–109, Jan. 2002.
[CrossRef]

Wang, W.

B. Du, J. Gu, D. H. K. Tsang, W. Wang, “Quorumcast routing by multispace search,” in Proc. IEEE GLOBECOM, Nov. 1996, vol. 2, pp. 1069–1073.

Wang, Y.

Y. Wang, T.-H. Cheng, M.-H. Lim, “A tabu search algorithm for static routing and wavelength assignment problem,” IEEE Commun. Lett., vol. 9, no. 9, pp. 841–843, Sept. 2005.
[CrossRef]

Wei, J. Y.

Williamson, D. P.

F. A. Chudak, T. Roughgarden, D. P. Williamson, “Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,” Math. Program., vol. 100, no. 2, pp. 411–421, 2004.
[CrossRef]

Xin, Y.

Y. Xin, G. N. Rouskas, “Multicast routing under optical layer constraints,” in Proc. IEEE INFOCOM, 2004, vol. 4, pp. 2731–2742.

Zang, H.

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.

Zeng, Q. J.

W. S. Hu, Q. J. Zeng, “Multicasting optical cross connects employing splitter-and-delivery switch,” IEEE Photon. Technol. Lett., vol. 10, pp. 970–972, 1998.
[CrossRef]

Zhang, L.

M. Andrews, L. Zhang, “Complexity of wavelength assignment in optical network optimization,” IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 646–657, 2009.
[CrossRef]

Zhang, X.

X. Zhang, J. Y. Wei, C. Qiao, “Constrained multicast routing in WDM networks with sparse light splitting,” J. Lightwave Technol., vol. 18, no. 12, pp. 1917–1927, Dec. 2000.
[CrossRef]

R. Malli, X. Zhang, C. Qiao, “Benefits of multicasting in all-optical networks,” in Proc. All-Optical Networking, 1998, pp. 209–220.

Comput. Commun. (1)

D. Din, “A hybrid method for solving ARWA problem on WDM network,” Comput. Commun., vol. 30, no. 2, pp. 385–395, 2007.
[CrossRef]

Comput. Netw. (1)

S. Azodolmolky, M. Klinkowski, E. Marin, D. Careglio, J. S. Pareta, I. Tomkos, “A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks,” Comput. Netw., vol. 53, no. 7, pp. 926–944, 2009.
[CrossRef]

IEEE Commun. Lett. (2)

Y. Wang, T.-H. Cheng, M.-H. Lim, “A tabu search algorithm for static routing and wavelength assignment problem,” IEEE Commun. Lett., vol. 9, no. 9, pp. 841–843, Sept. 2005.
[CrossRef]

C. Dzongang, P. Galinier, S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks,” IEEE Commun. Lett., vol. 9, no. 5, pp. 426–428, May 2005.
[CrossRef]

IEEE Commun. Mag. (1)

L. H. Sahasrabuddhe, B. Mukherjee, “Light trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, no. 2, pp. 67–73, Feb. 1999.
[CrossRef]

IEEE J. Sel. Areas Commun. (3)

M. Ali, J. S. Deogun, “Power-efficient design of multicast wavelength-routed networks,” IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1852–1862, Oct. 2000.
[CrossRef]

B. Chen, J. Wang, “Efficient routing and wavelength assignment for multicast in WDM networks,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 97–109, Jan. 2002.
[CrossRef]

S. Sankaranarayanan, S. Subramaniam, “Comprehensive performance modeling and analysis of multicasting in optical networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1399–1413, Nov. 2003.
[CrossRef]

IEEE Network (1)

L. H. Sahasrabuddhe, B. Mukherjee, “Multicast routing algorithms and protocols: a tutorial,” IEEE Network, vol. 14, no. 1, pp. 90–102, Jan./Feb. 2000.
[CrossRef]

IEEE Photon. Technol. Lett. (1)

W. S. Hu, Q. J. Zeng, “Multicasting optical cross connects employing splitter-and-delivery switch,” IEEE Photon. Technol. Lett., vol. 10, pp. 970–972, 1998.
[CrossRef]

IEEE/ACM Trans. Netw. (5)

R. Libeskind-Hadas, R. Melhem, “Multicast routing and wavelength assignment in multihop optical networks,” IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 621–629, 2002.
[CrossRef]

B. G. Bathula, V. M. Vokkarane, “QoS-based manycasting over optical burst-switched (OBS) networks,” IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 271–283, Feb. 2010.
[CrossRef]

R. Ramaswami, K. N. Sivarajan, “Routing and wavelength assignment in all-optical networks,” IEEE/ACM Trans. Netw., vol. 3, no. 5, pp. 489–500, 1995.
[CrossRef]

I. Chlamatac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE/ACM Trans. Netw., vol. 40, no. 7, pp. 1171–1182, July 1992.

M. Andrews, L. Zhang, “Complexity of wavelength assignment in optical network optimization,” IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 646–657, 2009.
[CrossRef]

J. Lightwave Technol. (2)

Math. Japonica (1)

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

Math. Program. (1)

F. A. Chudak, T. Roughgarden, D. P. Williamson, “Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,” Math. Program., vol. 100, no. 2, pp. 411–421, 2004.
[CrossRef]

Opt. Fiber Technol. (2)

G. E. Keiser, “A review of WDM technology and applications,” Opt. Fiber Technol., vol. 5, no. 1, pp. 3–39, 1999.
[CrossRef]

H. S. Chung, S. H. Chang, K. Kim, “Experimental demonstration of layer-1 multicast for WDM networks using reconfigurable OADM,” Opt. Fiber Technol., vol. 15, no. 5–6, pp. 431–437, 2009.
[CrossRef]

Opt. Networks Mag. (1)

H. Zang, J. P. Jue, B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.

Opt. Switching Networking (1)

Q. She, N. Kannasoot, J. P. Jue, Y.-C. Kim, “On finding minimum cost tree for multi-resource manycast in mesh networks,” Opt. Switching Networking, vol. 6, no. 1, pp. 29–36, Jan. 2009.
[CrossRef]

Proc. SPIE (1)

G. Sahin, M. Azizoglu, “Multicast routing and wavelength assignment in wide-area networks,” Proc. SPIE, vol. 3531, pp. 196–208, 1998.
[CrossRef]

Theor. Comput. Sci. (1)

J. Bermond, L. Gargano, S. Perennes, A. A. Rescigno, U. Vaccaro, “Efficient collective communication in optical networks,” Theor. Comput. Sci., vol. 233, no. 1–2, pp. 165–189, 2000.
[CrossRef]

Other (19)

R. Jain, “Internet 3.0: ten problems with current Internet architecture and solutions for the next generation,” in Proc. IEEE MILCOMM, 2006, pp. 1–9.

“Large hadron collider (LHC) project,” http://lhc.web.cern.ch/lhc.

R. Malli, X. Zhang, C. Qiao, “Benefits of multicasting in all-optical networks,” in Proc. All-Optical Networking, 1998, pp. 209–220.

S. Y. Cheung, A. Kumar, “Efficient quorumcast routing algorithms,” in Proc. IEEE INFOCOM, 1994, pp. 840–847.

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi, “Spanning trees short or small,” in Proc. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 546–555.

R. M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations. Springer, 1972, pp. 85–103.
[CrossRef]

J. P. Jue, “Lightpath establishment in wavelength-routed WDM optical networks,” in Optical Networks: Recent Advances. Springer, 2001, pp. 99–122.
[CrossRef]

F. Glover, M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.
[CrossRef]

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, “Routing foreseeable lightpath demands using a tabu search meta-heuristic,” in Proc. IEEE GLOBECOM, 2002, vol. 3, pp. 2803–2807.

X. Huang, Q. She, V. M. Vokkarane, J. P. Jue, “Manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2007, pp. 2353–2358.

Q. She, X. Huang, N. Kannasoot, Z. Qiong, J. P. Jue, “Multiresource manycast over optical burst-switched networks,” in Proc. IEEE ICCCN, Aug. 2007, pp. 222–227.

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, S. Talabathula, “Impairment-aware manycast algorithms over optical burst-switched networks,” in Proc. IEEE ICCCN, 2008.

Y. Xin, G. N. Rouskas, “Multicast routing under optical layer constraints,” in Proc. IEEE INFOCOM, 2004, vol. 4, pp. 2731–2742.

B. Du, J. Gu, D. H. K. Tsang, W. Wang, “Quorumcast routing by multispace search,” in Proc. IEEE GLOBECOM, Nov. 1996, vol. 2, pp. 1069–1073.

C. P. Low, “Optimal quorumcast routing,” in Proc. IEEE GLOBECOM, 1998, vol. 5, pp. 3013–3016.

B. Wang, J. Hou, “An efficient QoS routing algorithm for quorumcast communication,” in Proc. IEEE ICNP, 2001, pp. 110–118.

“NP science network requirements,” 2008, http://www.es.net/pub/esnet-doc/NP-Net-Req-Workshop-2008-Final-Report.pdf.

V. M. Vokkarane, B. G. Bathula, “Manycast service in optical burst/packet switched (OBS/OPS) networks (Invited Paper),” in ICST/ACM GridNets, 2008, pp. 231–242

B. G. Bathula, V. M. Vokkarane, R. R. C. Bikram, “Impairment-aware manycasting over optical burst-switched networks,” in Proc. IEEE ICC, 2008, pp. 5234–5238.

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.


Figures (8)

Fig. 1
Fig. 1

Static manycast RWA example. The requests are given in the table on the right. This RWA requires only a single wavelength.

Fig. 2
Fig. 2

MC-OXC based on splitter-and-delivery architecture.

Fig. 3
Fig. 3

An N×N SaD switch.

Fig. 4
Fig. 4

LPH illustration with manycast request (0, {2,4,13}, 2). Given the network and request in (a), LPH generates the Steiner trees shown in (b)–(d).

Fig. 5
Fig. 5

Tabu search meta-heuristic flow chart.

Fig. 6
Fig. 6

Networks used for heuristic evaluation.

Fig. 7
Fig. 7

Six-node network used for ILP evaluation.

Fig. 8
Fig. 8

Performance comparison of ILP and heuristics.

Tables (3)

Tables Icon

Table 1 Algorithm 1 Shortest Path Heuristic for Static MA-RWA

Tables Icon

Table 2 Algorithm 2 Lambda Path Heuristic for Static MA-RWA

Tables Icon

Table 1 Comparison of TS, LPH, and SPT Over Different Network Topologies for a Static Set of 150 Manycast Requests

Equations (12)

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

minimize : maxIndex
maxIndex C m , w × w m , w ,
m y i , j m , w + y j , i m , w 1 i , j , w ,
i j D m c w y i , j m , w k m m ,
j w y s m , j m , w 1 m ,
j w y j , s m m , w = 0 m ,
j w y j , i m , w 1 m , i s m ,
j y i , j m , w | V | j y j , i m , w 0 m , w , i s m ,
j y j , i m , w j y i , j m , w 0 m , w , i D m c ,
U i m U j m + | V | y i , j m , w | V | 1 m , w , i , j ,
w C m , w = 1 m ,
y i , j m , w + y j , i m , w C m , w m , w , i , j ( j > i ) .