Abstract

The distribution of large data sets from a centralized node to several destination sites is frequently required by many data-intensive networking applications; this distribution can be efficiently achieved by the means of multicasting. Multicasting has been typically considered for on-demand applications and services, e.g., video-on-demand, IPTV, etc., which usually require start of data transmission immediately. We consider that multicast sessions can be provisioned starting with flexible times and that the multicast client can specify a maximum allowed time by which all data needs to be delivered to destinations. This is true for e-Science and high-performance applications, in which data distribution is not necessarily immediate. In this paper, we study the problem of provisioning dynamic multicast data-distribution requests (MDDRs) with flexible scheduling over optical WDM networks. We consider the practical case of fractional-capacity multicast sessions that require less than the entire wavelength capacity (nodes are equipped with multicast-capable opaque switches). We devise provisioning methods based on the multicast tree (or light-tree) distribution model. In our first approach (named Rand), we generate multiple randomized alternate trees on which we try to provision the multicast session and then assign wavelengths and schedule the session. In our second approach (named AllSlots), we dynamically generate light-trees depending on the network state. In our next approach (named Break), when provisioning an entire tree fails, we try to “break” the tree into time-independent subtrees. We also study the impact of allowing data to be buffered at intermediary nodes and then transmitted toward destinations (method named Buffer) and consider an approach that partitions the data sets. Finally, we study the impact of the switch architecture on our provisioning by restricting our approaches to full-wavelength MDDRs.

© 2010 Optical Society of America

Full Article  |  PDF Article

References

  • View by:
  • |
  • |
  • |

  1. Open Grid Forum informational document, “Grid network services use cases from the e-Science community,” T. Ferrari, Ed., July 2006.
  2. European Organization for Nuclear Research (CERN), www.cern.ch/.
  3. Large Hadron Collider (LHC) Computing Project, http://lcg.web.cern.ch/lcg/.
  4. H. Miyagi, M. Hayashitani, D. Ishii, Y. Arakawa, N. Yamanaka, “Advanced wavelength reservation method based on deadline-aware scheduling for lambda grid networks,” J. Lightwave Technol., vol. 25, no. 10, pp. 2904–2910, Oct. 2007.
    [CrossRef]
  5. R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
    [CrossRef]
  6. D. Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee, “On-demand provisioning of data-aggregation sessions over WDM optical networks,” J. Lightwave Technol., vol. 27, no. 12, pp. 1846–1855, June 2009.
    [CrossRef]
  7. L. 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]
  8. N. Singhal, L. Sahasrabuddhe, B. Mukherjee, “Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 1104–1117, Oct. 2006.
    [CrossRef]
  9. M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.
  10. A. Khalil, A. Hadjiantonis, C. M. Assi, A. Shami, G. Ellinas, M. A. Ali, “Dynamic provisioning of low-speed unicast/multicast traffic demands in mesh-based WDM optical networks,” J. Lightwave Technol., vol. 24, no. 2, pp. 681–693, Feb. 2006.
    [CrossRef]
  11. X. Huang, F. Farahmand, J. P. Jue, “Multicast traffic grooming in wavelength-routed WDM mesh networks using dynamically changing light-trees,” J. Lightwave Technol., vol. 23, no. 10, pp. 3178–3187, Oct. 2005.
    [CrossRef]
  12. B. Wang, Y. Fan, X. Luo, “Multicast service provisioning under a scheduled traffic model in WDM optical networks,” in Proc. Int. Conf. on Communications and Computer Networks, Oct. 2005.
  13. M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
    [CrossRef]
  14. B. Mukherjee, Optical WDM Networks. Springer, 2006.
  15. M. P. Barcellos, M. Nekovee, M. Daw, “High-performance reliable multicasting for grid applications,” in Proc. IEEE/ACM Int. Workshop on Grid Computing, Nov. 2004, pp. 342–349.
  16. A. Elghirani, R. Subrata, A. Y. Zomaya, “Intelligent scheduling and replication in datagrids: a synergistic approach,” in Proc. 7th IEEE Int. Symp. on Cluster Computing and the Grid, May 2007, pp. 179–182.
  17. K. Ranganathan, I. Foster, “Identifying dynamic replication strategies for a high-performance data grid,” Lect. Notes Comput. Sci., vol. 2242/2001, pp. 75–86, Jan. 2002.
  18. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
    [CrossRef]
  19. B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.
  20. A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
    [CrossRef]
  21. H.-H. Nguyen, M. Gurusamy, L. Zhou, “Scheduling network and computing resources for sliding demands in optical grids,” J. Lightwave Technol., vol. 27, no. 12, pp. 1827–1836, June 2009.
    [CrossRef]
  22. L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, pp. 2412–2417, June 2007.
  23. W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
    [CrossRef]
  24. C. V. Saradhi, M. Gurusamy, “Scheduling and routing of sliding scheduled lightpath demands in WDM optical networks,” in Proc. IEEE Optical Fiber Communications Conf., Mar. 2007.
  25. J. Zheng, H. Mouftah, “Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, Apr. 2002, vol. 5, pp. 2722–2726.
  26. S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
    [CrossRef]
  27. E. Varvarigos, V. Sourlas, K. Christodoulopoulos, “Routing and scheduling connections in networks that support advance reservations,” Comput. Netw., vol. 52, no. 15, pp. 2988–3006, Oct. 2008.
    [CrossRef]
  28. R. A. Guerin, A. Orda, “Networks with advance reservations: the routing perspective,” in Proc. IEEE INFOCOM, Mar. 2000, pp. 118–127.
  29. L. Burchard, “On the performance of computer networks with advance reservation mechanisms,” in Proc. IEEE ICON, 2003, pp. 449–454.
  30. N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.
  31. A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
    [CrossRef]
  32. F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.
  33. T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.
  34. H. Takahashi, A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica, vol. 24, pp. 573–577, 1980.
  35. J. Yen, “Finding the K shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, July 1971.
    [CrossRef]
  36. M. Beck, T. Moore, “Logistical networking: a global storage network,” J. Phys.: Conf. Ser., vol. 16, pp. 531–535, 2005.

2009 (3)

2008 (4)

S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
[CrossRef]

E. Varvarigos, V. Sourlas, K. Christodoulopoulos, “Routing and scheduling connections in networks that support advance reservations,” Comput. Netw., vol. 52, no. 15, pp. 2988–3006, Oct. 2008.
[CrossRef]

A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
[CrossRef]

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

2007 (1)

2006 (3)

N. Singhal, L. Sahasrabuddhe, B. Mukherjee, “Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 1104–1117, Oct. 2006.
[CrossRef]

A. Khalil, A. Hadjiantonis, C. M. Assi, A. Shami, G. Ellinas, M. A. Ali, “Dynamic provisioning of low-speed unicast/multicast traffic demands in mesh-based WDM optical networks,” J. Lightwave Technol., vol. 24, no. 2, pp. 681–693, Feb. 2006.
[CrossRef]

W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
[CrossRef]

2005 (2)

X. Huang, F. Farahmand, J. P. Jue, “Multicast traffic grooming in wavelength-routed WDM mesh networks using dynamically changing light-trees,” J. Lightwave Technol., vol. 23, no. 10, pp. 3178–3187, Oct. 2005.
[CrossRef]

R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
[CrossRef]

2003 (1)

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

2002 (1)

K. Ranganathan, I. Foster, “Identifying dynamic replication strategies for a high-performance data grid,” Lect. Notes Comput. Sci., vol. 2242/2001, pp. 75–86, Jan. 2002.

1999 (1)

L. 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]

1980 (1)

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

1971 (1)

J. Yen, “Finding the K shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, July 1971.
[CrossRef]

Abramson, D.

R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
[CrossRef]

Ajmone Marsan, M.

M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.

Ali, M. A.

Andrei, D.

Arakawa, Y.

Arshad, F.

F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.

Assi, C. M.

Balasubramanian, A.

W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
[CrossRef]

Banerjee, A.

A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
[CrossRef]

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Barcellos, M. P.

M. P. Barcellos, M. Nekovee, M. Daw, “High-performance reliable multicasting for grid applications,” in Proc. IEEE/ACM Int. Workshop on Grid Computing, Nov. 2004, pp. 342–349.

Baruffaldi, A.

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

Battestilli, L.

S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
[CrossRef]

F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.

Beck, M.

M. Beck, T. Moore, “Logistical networking: a global storage network,” J. Phys.: Conf. Ser., vol. 16, pp. 531–535, 2005.

Burchard, L.

L. Burchard, “On the performance of computer networks with advance reservation mechanisms,” in Proc. IEEE ICON, 2003, pp. 449–454.

Buyya, R.

R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
[CrossRef]

Carter, S.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Chen, Y.

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

Christodoulopoulos, K.

E. Varvarigos, V. Sourlas, K. Christodoulopoulos, “Routing and scheduling connections in networks that support advance reservations,” Comput. Netw., vol. 52, no. 15, pp. 2988–3006, Oct. 2008.
[CrossRef]

Cormen, T.

T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.

Daw, M.

M. P. Barcellos, M. Nekovee, M. Daw, “High-performance reliable multicasting for grid applications,” in Proc. IEEE/ACM Int. Workshop on Grid Computing, Nov. 2004, pp. 342–349.

Ding, S.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Dotaro, E.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Douville, R.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Elghirani, A.

A. Elghirani, R. Subrata, A. Y. Zomaya, “Intelligent scheduling and replication in datagrids: a synergistic approach,” in Proc. 7th IEEE Int. Symp. on Cluster Computing and the Grid, May 2007, pp. 179–182.

Ellinas, G.

Fan, Y.

B. Wang, Y. Fan, X. Luo, “Multicast service provisioning under a scheduled traffic model in WDM optical networks,” in Proc. Int. Conf. on Communications and Computer Networks, Oct. 2005.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.

Farahmand, F.

Feng, W.

A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
[CrossRef]

Foster, I.

K. Ranganathan, I. Foster, “Identifying dynamic replication strategies for a high-performance data grid,” Lect. Notes Comput. Sci., vol. 2242/2001, pp. 75–86, Jan. 2002.

Gagnaire, M.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Ghosal, D.

D. Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee, “On-demand provisioning of data-aggregation sessions over WDM optical networks,” J. Lightwave Technol., vol. 27, no. 12, pp. 1846–1855, June 2009.
[CrossRef]

A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
[CrossRef]

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Grosso, A.

M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.

Guerin, R. A.

R. A. Guerin, A. Orda, “Networks with advance reservations: the routing perspective,” in Proc. IEEE INFOCOM, Mar. 2000, pp. 118–127.

Gurusamy, M.

H.-H. Nguyen, M. Gurusamy, L. Zhou, “Scheduling network and computing resources for sliding demands in optical grids,” J. Lightwave Technol., vol. 27, no. 12, pp. 1827–1836, June 2009.
[CrossRef]

C. V. Saradhi, M. Gurusamy, “Scheduling and routing of sliding scheduled lightpath demands in WDM optical networks,” in Proc. IEEE Optical Fiber Communications Conf., Mar. 2007.

Hadjiantonis, A.

Hayashitani, M.

Huang, X.

Ishii, D.

Jaekel, A.

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

Jue, J. P.

Karmous-Edwards, G.

S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
[CrossRef]

Khalil, A.

Kuri, J.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Leiserson, C.

T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.

Leonardi, E.

M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.

Li, T.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.

Luo, X.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.

B. Wang, Y. Fan, X. Luo, “Multicast service provisioning under a scheduled traffic model in WDM optical networks,” in Proc. Int. Conf. on Communications and Computer Networks, Oct. 2005.

Martel, C.

Matsuyama, A.

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

Mellia, M.

M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.

Miyagi, H.

Moore, T.

M. Beck, T. Moore, “Logistical networking: a global storage network,” J. Phys.: Conf. Ser., vol. 16, pp. 531–535, 2005.

Mouftah, H.

J. Zheng, H. Mouftah, “Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, Apr. 2002, vol. 5, pp. 2722–2726.

Mukherjee, B.

D. Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee, “On-demand provisioning of data-aggregation sessions over WDM optical networks,” J. Lightwave Technol., vol. 27, no. 12, pp. 1846–1855, June 2009.
[CrossRef]

A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
[CrossRef]

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

N. Singhal, L. Sahasrabuddhe, B. Mukherjee, “Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 1104–1117, Oct. 2006.
[CrossRef]

L. 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]

B. Mukherjee, Optical WDM Networks. Springer, 2006.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Murshed, M.

R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
[CrossRef]

Nekovee, M.

M. P. Barcellos, M. Nekovee, M. Daw, “High-performance reliable multicasting for grid applications,” in Proc. IEEE/ACM Int. Workshop on Grid Computing, Nov. 2004, pp. 342–349.

Nguyen, H.-H.

Nucci, A.

M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.

Orda, A.

R. A. Guerin, A. Orda, “Networks with advance reservations: the routing perspective,” in Proc. IEEE INFOCOM, Mar. 2000, pp. 118–127.

Pattavina, A.

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

Perros, H.

S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
[CrossRef]

Puech, N.

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

Ramamurthy, B.

L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, pp. 2412–2417, June 2007.

Ramay, S. R.

F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.

Ranganathan, K.

K. Ranganathan, I. Foster, “Identifying dynamic replication strategies for a high-performance data grid,” Lect. Notes Comput. Sci., vol. 2242/2001, pp. 75–86, Jan. 2002.

Rao, N. S. V.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Rivest, R.

T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.

Sahasrabuddhe, L.

N. Singhal, L. Sahasrabuddhe, B. Mukherjee, “Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 1104–1117, Oct. 2006.
[CrossRef]

L. 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]

Saradhi, C. V.

C. V. Saradhi, M. Gurusamy, “Scheduling and routing of sliding scheduled lightpath demands in WDM optical networks,” in Proc. IEEE Optical Fiber Communications Conf., Mar. 2007.

Sasaki, G.

W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
[CrossRef]

Shami, A.

Shen, L.

L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, pp. 2412–2417, June 2007.

Singhal, N.

N. Singhal, L. Sahasrabuddhe, B. Mukherjee, “Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 1104–1117, Oct. 2006.
[CrossRef]

Sourlas, V.

E. Varvarigos, V. Sourlas, K. Christodoulopoulos, “Routing and scheduling connections in networks that support advance reservations,” Comput. Netw., vol. 52, no. 15, pp. 2988–3006, Oct. 2008.
[CrossRef]

Stein, C.

T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.

Su, C.-F.

W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
[CrossRef]

Su, W.

W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
[CrossRef]

Subrata, R.

A. Elghirani, R. Subrata, A. Y. Zomaya, “Intelligent scheduling and replication in datagrids: a synergistic approach,” in Proc. 7th IEEE Int. Symp. on Cluster Computing and the Grid, May 2007, pp. 179–182.

Takahashi, H.

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

Tanwir, S.

S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
[CrossRef]

F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.

Todimala, A.

L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, pp. 2412–2417, June 2007.

Tornatore, M.

D. Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee, “On-demand provisioning of data-aggregation sessions over WDM optical networks,” J. Lightwave Technol., vol. 27, no. 12, pp. 1846–1855, June 2009.
[CrossRef]

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

Varvarigos, E.

E. Varvarigos, V. Sourlas, K. Christodoulopoulos, “Routing and scheduling connections in networks that support advance reservations,” Comput. Netw., vol. 52, no. 15, pp. 2988–3006, Oct. 2008.
[CrossRef]

Venugopal, S.

R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
[CrossRef]

Wang, B.

B. Wang, Y. Fan, X. Luo, “Multicast service provisioning under a scheduled traffic model in WDM optical networks,” in Proc. Int. Conf. on Communications and Computer Networks, Oct. 2005.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.

Wing, W.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Wu, Q.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

Xin, C.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.

Yamanaka, N.

Yang, X.

L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, pp. 2412–2417, June 2007.

Yen, J.

J. Yen, “Finding the K shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, July 1971.
[CrossRef]

Zaidi, S. M. H.

F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.

Zheng, J.

J. Zheng, H. Mouftah, “Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, Apr. 2002, vol. 5, pp. 2722–2726.

Zhou, L.

Zhu, H.

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

Zomaya, A. Y.

A. Elghirani, R. Subrata, A. Y. Zomaya, “Intelligent scheduling and replication in datagrids: a synergistic approach,” in Proc. 7th IEEE Int. Symp. on Cluster Computing and the Grid, May 2007, pp. 179–182.

Comput. Netw. (1)

E. Varvarigos, V. Sourlas, K. Christodoulopoulos, “Routing and scheduling connections in networks that support advance reservations,” Comput. Netw., vol. 52, no. 15, pp. 2988–3006, Oct. 2008.
[CrossRef]

IEEE Commun. Mag. (1)

L. 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. (2)

M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, part 2, pp. 28–35, Apr. 2008.
[CrossRef]

J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, R. Douville, “Routing and wavelength assignment of scheduled lightpath demands,” IEEE J. Sel. Areas Commun., vol. 21, no. 8, pp. 1231–1240, Oct. 2003.
[CrossRef]

IEEE Trans. Parallel Distrib. Syst. (1)

A. Banerjee, W. Feng, D. Ghosal, B. Mukherjee, “Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 1, pp. 24–34, Jan. 2008.
[CrossRef]

IEEE/ACM Trans. Netw. (1)

N. Singhal, L. Sahasrabuddhe, B. Mukherjee, “Optimal multicasting of multiple light-trees of different bandwidth granularities in a WDM mesh network with sparse splitting capabilities,” IEEE/ACM Trans. Netw., vol. 14, no. 5, pp. 1104–1117, Oct. 2006.
[CrossRef]

Int. J. Network Manage. (1)

S. Tanwir, L. Battestilli, H. Perros, G. Karmous-Edwards, “Dynamic scheduling of network resources with advance reservations in optical grids,” Int. J. Network Manage., vol. 18, no. 2, pp. 79–105, Mar. 2008.
[CrossRef]

Int. J. Softw. (1)

R. Buyya, M. Murshed, D. Abramson, S. Venugopal, “Scheduling parameter sweep applications on global grids: a deadline and budget constrained cost-time optimization algorithm,” Int. J. Softw., vol. 35, no. 5, pp. 491–512, Apr. 2005.
[CrossRef]

J. Lightwave Technol. (5)

Lect. Notes Comput. Sci. (1)

K. Ranganathan, I. Foster, “Identifying dynamic replication strategies for a high-performance data grid,” Lect. Notes Comput. Sci., vol. 2242/2001, pp. 75–86, Jan. 2002.

Manage. Sci. (1)

J. Yen, “Finding the K shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, July 1971.
[CrossRef]

Math. Japonica (1)

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

Opt. Switching Networking (2)

A. Jaekel, Y. Chen, “Resource provisioning for survivable WDM networks under a sliding scheduled traffic model,” Opt. Switching Networking, vol. 6, no. 1, pp. 44–54, Jan. 2009.
[CrossRef]

W. Su, G. Sasaki, C.-F. Su, A. Balasubramanian, “Scheduling of periodic connections with flexibility,” Opt. Switching Networking, vol. 3, no. 3–4, pp. 158–172, Dec. 2006.
[CrossRef]

Other (18)

C. V. Saradhi, M. Gurusamy, “Scheduling and routing of sliding scheduled lightpath demands in WDM optical networks,” in Proc. IEEE Optical Fiber Communications Conf., Mar. 2007.

J. Zheng, H. Mouftah, “Routing and wavelength assignment for advance reservation in wavelength-routed WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, Apr. 2002, vol. 5, pp. 2722–2726.

L. Shen, X. Yang, A. Todimala, B. Ramamurthy, “A two-phase approach for dynamic lightpath scheduling in WDM optical networks,” in Proc. IEEE Int. Conf. on Communications, pp. 2412–2417, June 2007.

R. A. Guerin, A. Orda, “Networks with advance reservations: the routing perspective,” in Proc. IEEE INFOCOM, Mar. 2000, pp. 118–127.

L. Burchard, “On the performance of computer networks with advance reservation mechanisms,” in Proc. IEEE ICON, 2003, pp. 449–454.

N. S. V. Rao, Q. Wu, S. Ding, S. Carter, W. Wing, A. Banerjee, D. Ghosal, B. Mukherjee, “Control plane for advance bandwidth scheduling in ultra high-speed networks,” in Proc. IEEE INFOCOM High-Speed Networking Workshop: The Terabits Challenge, Apr. 2006, pp. 1–5.

F. Arshad, S. R. Ramay, S. Tanwir, L. Battestilli, S. M. H. Zaidi, “Advance reservation and dynamic scheduling of point to multipoint lightpaths,” in Proc. IEEE Int. Symp. on High-Capacity Optical Networks and Enabling Technologies (HONET), pp. 69–74, Nov. 2008.

T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.

M. Beck, T. Moore, “Logistical networking: a global storage network,” J. Phys.: Conf. Ser., vol. 16, pp. 531–535, 2005.

B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, “On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks,” in Proc. IEEE Broadnets 2005, Oct. 2005, pp. 13–22.

B. Mukherjee, Optical WDM Networks. Springer, 2006.

M. P. Barcellos, M. Nekovee, M. Daw, “High-performance reliable multicasting for grid applications,” in Proc. IEEE/ACM Int. Workshop on Grid Computing, Nov. 2004, pp. 342–349.

A. Elghirani, R. Subrata, A. Y. Zomaya, “Intelligent scheduling and replication in datagrids: a synergistic approach,” in Proc. 7th IEEE Int. Symp. on Cluster Computing and the Grid, May 2007, pp. 179–182.

B. Wang, Y. Fan, X. Luo, “Multicast service provisioning under a scheduled traffic model in WDM optical networks,” in Proc. Int. Conf. on Communications and Computer Networks, Oct. 2005.

M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan, “Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic,” in Proc. IEEE Global Telecommunications Conf., Nov. 2001, pp. 1520–1525.

Open Grid Forum informational document, “Grid network services use cases from the e-Science community,” T. Ferrari, Ed., July 2006.

European Organization for Nuclear Research (CERN), www.cern.ch/.

Large Hadron Collider (LHC) Computing Project, http://lcg.web.cern.ch/lcg/.

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

Fig. 1
Fig. 1

Example for computing the possible start times vector P l , w [for a given wavelength link ( l , w ) ].

Fig. 2
Fig. 2

Splitting a multicast tree T into two independent subtrees (depending on T’s topology), with independent start times.

Fig. 3
Fig. 3

Example that considers buffering capability in the network.

Fig. 4
Fig. 4

A 19-node backbone US network topology [13].

Fig. 5
Fig. 5

Unprovisioned bandwidth and impact of N for Base and Rand MDDR provisioning approaches.

Fig. 6
Fig. 6

Performance of MDDRP_AllSlots approaches and comparison between unicast and our multicast algorithms.

Fig. 7
Fig. 7

Wavelength and link utilizations for MDDRP and unicast approaches.

Fig. 8
Fig. 8

Performance of multicast and unicast for varying ranges of nodes in multicast group M.

Fig. 9
Fig. 9

Performance of our MDDR_Break multicast provisioning approach.

Fig. 10
Fig. 10

Performance of the independent trees provisioning approach.

Fig. 11
Fig. 11

Performance improvement by considering buffering.

Fig. 12
Fig. 12

Impact of file partitioning on our MDDRP approaches.

Fig. 13
Fig. 13

MDDR provisioning in Opaque versus All Optical networks.

Fig. 14
Fig. 14

Impact of time-window length on MDDR provisioning.

Fig. 15
Fig. 15

Effect of the number of multicast sources on MDDRP.

Tables (4)

Tables Icon

Table 1 Algorithm 1 Multicast Data-Distribution Request Provisioning (MDDRP)—Rand

Tables Icon

Table 2 Algorithm 2 MDDRP AllSlots SmallTree

Tables Icon

Table 3 Algorithm 3 MDDRP-BREAK Into Subtrees With Independent Start Times

Tables Icon

Table 1 Percentage of Delayed Multicast Requests for MDDRP_RAND_N3