Minimum Cost Multicast Routing Based on High Utilization MC Nodes Suited to Sparse-Splitting Optical Networks (original) (raw)

Abstract

As the Internet traffic continues to grow exponentially, Wavelength Division Multiplexing (WDM) networks with tera bps bandwidth per fiber naturally emerge as backbone for next generation optical Internet. In particular, much research regarding multicast services has progressed for connecting source to destination nodes efficiently because multicast demands are increasing. However, sparse-splitting networks are more realistic than fully-splitting ones, since multicast-capable cross-connectors are expensive. In this paper, a heuristic method to minimize the cost of a multicast tree based mainly on Multicast-Capable nodes in sparse-splitting networks is proposed. According to the results of comprehensive simulations and compared to the previous algorithms, the proposed algorithm provides performance improvement up to about 16% in terms of wavelength channel cost.

This research was supported by the Ministry of Information and Communication, Korea under the Information Technology Research Center support program supervised by the Institute of Information Technology Assessment, IITA-2005-(C1090-0501-0019).

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Mukherjee, B.: Optical Communication Networks. McGraw-Hill, New York (1997)
    Google Scholar
  2. Desurvive, E.: Erbium-Doped Fiber Amplifiers: Principles and Applications. Wiley, New York (1994)
    Google Scholar
  3. Sahasrabuddhe, L.H., Mukherjee, B.: Light Trees: Optical Multicasting for Improved Performance in Wavelength Routed Networks. IEEE Communications Magazine 37(2), 67–73 (1999)
    Article Google Scholar
  4. Yan, S., Deogun, J.: Multi-drop path model for multicast routing and wavelength assignment. IEEE Information Sciences 149, 113–134 (2003)
    Article Google Scholar
  5. Zhou, Y., Poo, G.-S.: A new multiwavelength multicast wavelength assignment (MMWA) algorithm in wavelength-routed WDM networks. IEEE Communications Magazine 3, 1786–1790 (2004)
    Google Scholar
  6. Zhang, X., Wei, J.Y., Qiao, C.: Constrained Multicast Routing in WDM Networks with Sparse Light Splitting. IEEE Journal of Lightwave Technology 18(12), 1917–1927 (2000)
    Article Google Scholar
  7. Tseng, W.-Y., Kuo, S.-Y.: All-optical multicasting on wavelength-routed WDM networks with partial replication. In: IEEE Information Networking, pp. 813–818 (2001)
    Google Scholar
  8. Yan, S., Ali, M., Deogun, J.: Route optimization of multicast sessions in sparse light-splitting optical networks. In: IEEE GLOBECOM, vol. 4, pp. 2134–2138 (2001)
    Google Scholar
  9. Sreenath, N., Krishna Mohan Reddy, N., Mohan, G., Siva Ram Murthy, C.: Virtual Source Based Multicast Routing in WDM Networks with Sparse Light Splitting. In: IEEE High Performance Switching and Routing, pp. 141–145 (2001)
    Google Scholar
  10. Hsieh, C.-Y., Liao, W.: All Optical Multicast Routing in Sparse-Splitting Optical Networks. In: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)
    Google Scholar
  11. Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm For Steiner Trees. IBM Thomas J. Watson Research Center, Acta Informatica 15, 141–145 (1981)
    MATH MathSciNet Google Scholar
  12. Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math. Japanica 24(6), 573–577 (1980)
    MATH MathSciNet Google Scholar
  13. Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)
    Chapter Google Scholar
  14. Calvert, K.: GT-ITM: Georgia Tech Inter-network Topology Models, http://www.cc.gatech.edu/fac/Ken.Calvert
  15. Beasly, J.: An SST-based algorithm for the Steiner problem in graphs. Networks 19, 1–16 (1989)
    Article MathSciNet Google Scholar
  16. Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathemtick 1, 269–271 (1959)
    Article MATH MathSciNet Google Scholar
  17. Prim, R.C.: Shortest Connecting Networks and Some Gener- alizations. Bell System Tech. J. 36, 1389–1401 (1957)
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Korea
    Sang-Hun Cho, Tae-Jin Lee, Min Young Chung & Hyunseung Choo

Authors

  1. Sang-Hun Cho
  2. Tae-Jin Lee
  3. Min Young Chung
  4. Hyunseung Choo

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada
    Marina L. Gavrilova
  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy
    Osvaldo Gervasi
  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA
    Vipin Kumar
  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK
    C. J. Kenneth Tan
  5. Clayton School of IT, Monash University, 3800, Clayton, Australia
    David Taniar
  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy
    Antonio Laganá
  7. School of Computing, Soongsil University, Seoul, Korea
    Youngsong Mun
  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea
    Hyunseung Choo

Rights and permissions

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cho, SH., Lee, TJ., Chung, M.Y., Choo, H. (2006). Minimum Cost Multicast Routing Based on High Utilization MC Nodes Suited to Sparse-Splitting Optical Networks. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588\_31

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us