Skip to main content
SpringerLink
Log in

Online multicasting in WDM networks with shared light splitter bank

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

We study online multicasting in WDM networks with shared light splitter bank. Our objective is either to maximize the network throughput or to minimize the blocking probability. Due to the nature of dynamic requesting for network resources by online multicast requests, the network usually is unable to allocate the resources needed for each request in advance. Instead, it either accepts the request by building an economic multicast tree for the request, in terms of the utilization of the network resources if it has sufficient resources available, or rejects the request, otherwise. It is desirable that the cost of realizing each multicast request be minimized, and the network throughput will be maximized ultimately through the cost saving on each individual request. Since optical light splitting and wavelength conversion switching in optical networks is cost expensive and its fabrication is difficult, it is assumed that only a limited number of light splitters and wavelength converters are installed at a node, which will be shared by all the incoming signals at the node. In addition, it is further assumed that only a fraction of nodes in the network are installed with such optical switches. In this article we first propose a cost model for realizing an online multicast request under such network environments with limited light splitters and wavelength converters, which models the cost of utilization of network resources, particularly in modeling the light splitting and wavelength conversion ability at nodes. We then show that finding a cost-optimal multicast tree for a multicast request under the proposed cost model is NP-complete, and instead devise approximation and heuristic algorithms for it. We finally conduct experiments to evaluate the performance of the proposed algorithms. The results show that the proposed algorithms are efficient and effective in terms of network throughput.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sahasrabuddhe L.H., Mukherjee B.: Light-trees: optical multicasting for improved performance in wavelength-routed networks. IEEE Commun. Mag. 37(2), 67–73 (1999)

    Article  Google Scholar 

  2. Ali M., Deogun J.: Power-efficient design of multicast wavelength-routed networks. IEEE J. Select. Areas Commun. 18(10), 1852–1862 (2000)

    Article  Google Scholar 

  3. Rouskas G.N.: Optical layer multicast: rational, building blocks, and challenges. IEEE Netw. 17(1), 60–65 (2003)

    Article  Google Scholar 

  4. Zhou Y., Poo G.S.: Optical multicast over wavelength-routed WDM networks: a survey. Opt. Switch. Network. 2(3), 176–197 (2005)

    Article  Google Scholar 

  5. Ramaswami R.: Multiwavelength lightwave networks for computer communication. IEEE Commun. Mag. 31(2), 78–88 (1993)

    Article  Google Scholar 

  6. Vitter R.J., Du D.H.C.: Distributed computing with high-speed optical networks. IEEE Comput. 26(2), 8–18 (1993)

    Google Scholar 

  7. Zhang, Z., Yang, Y.: Online optimal wavelength assignment in WDM networks with shared wavelength converter pool. In: Proceedings of IEEE INFOCOM’05, vol. 1, pp. 694–705, Miami, USA (2005)

  8. Zhang, X., Wei, J., Qiao, C.: Constrained multicast routing in WDM networks with sparse light splitting. In: Proceedings of IEEE INFOCOM’00, vol. 3, pp. 1781–1790, Tel-Aviv, Israel (2000)

  9. Liang, W., Shen, H.: Multicasting and broadcasting in large WDM networks. In: Proceedings of Twelfth International Parallel Processing Symposium, pp. 365–369. IEEE Computer Society Press (1998)

  10. Chen B., Wang J.: Efficient routing and wavelength assignment for multicast in WDM networks. IEEE J. Select. Areas Commun. 20(1), 97–109 (2002)

    Article  Google Scholar 

  11. Znati T.F., Alrabiah T., Melhem R.: Low-cost delay-bounded point-to-point multipoint communication to support multicasting over WDM networks. Comput. Netw. 38(4), 423–445 (2002)

    Article  Google Scholar 

  12. Jia X.-H., Du D.-Z., Hu X.-D.: Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks. Comput. Commun. 24(14), 1390–1399 (2001)

    Article  Google Scholar 

  13. Libeskind-Hadas R., Melhem R.: Multicast routing and wavelength assignment in multi-hop optical networks. IEEE/ACM Trans. Network. 10(5), 621–629 (2002)

    Article  Google Scholar 

  14. Bermond J.-C., Gargano L., Perennes S., Rescigno A., Vaccaro U.: Efficient collective communication in optical networks. Theor. Comput. Sci. 233, 165–189 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Libeskind-Hadas, R.: Efficient collective communication in WDM networks with a power budget. In: Proceedings of Ninth International Conference on Computer Communications and Networks, pp. 612–616. Las Vegas, NV, USA (2000)

  16. Sahin, G., Azizoglu, M.: Multicast routing and wavelength assignment in wide-area networks. In: Proceedings of SPIE All-Optical Network, vol. 3531, pp. 196–208, Boston, MA, USA, Nov. 1998

  17. Malli, R., Zhang, X., Qiao, C.: Benefit of multicasting in all-optical networks. In: Proceedings of SPIE All-Optical Network, vol. 3531, pp. 209–220, Boston, MA, USA, Nov. 1998

  18. Xin, Y., Rouskas, G.N.: Multicast routing under optical layer constraints. In: Proceedings of IEEE INFOCOM’04, vol. 4, pp. 2731–2742, Hong Kong, March 2004

  19. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)

  20. Galbiati G., Maffioli F., Morzenti A.: A short note on the approximability of the maximum leaves spanning tree problem. Inf. Process. Lett. 52(1), 45–49 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  21. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 229–234. Chicago, IL, USA, May 1988

  22. Charikar M., Chekuri C., Cheung T.-Y., Dai Z., Goel A., Guha S., Li M.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73–91 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Klein P.N., Ravi R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104–114 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  24. Lund C., Yannakakis M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960–981 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  25. Guha S., Khuller S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150(1), 57–74 (1999)

    Article  MathSciNet  Google Scholar 

  26. Waxman B.: Routing of multipoint connections. IEEE J. Select. Areas Commun. 6(9), 1617–1622 (1988)

    Article  Google Scholar 

  27. Bauer F., Varma A.: ARIES: a rearrangeable inexpensive edge-based online Steiner algorithm. IEEE J. Select. Areas Commun. 15(3), 382–397 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Australian National University, Canberra, ACT 0200, Australia

    Yuzhen Liu & Weifa Liang

Authors
  1. Yuzhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weifa Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuzhen Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Y., Liang, W. Online multicasting in WDM networks with shared light splitter bank. Photon Netw Commun 17, 1–9 (2009). https://doi.org/10.1007/s11107-008-0138-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-008-0138-x

Keywords

Search

Navigation