Skip to main content

Resource Allocation and Multicast Routing Protocol for Optical WDM Networks

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 101))

Abstract

In traditional data networks, a multicast tree which is starting at the source is built with branches across all the destinations to admit a multicast session. In a highly dynamic and traffic changing environment, a routing and bandwidth allocation scheme has to be developed in the optical WDM networks. Without requiring detection of traffic changes in real time, the dynamic traffic will be routed with the quality-of-service (QoS) guarantees. In this paper, we propose to develop a Resource Allocation and Multicast Routing (RAMR) protocol. In this protocol, the incoming traffic is sent from the multicast source to a set of intermediate junction nodes and then, from the junction nodes to the final destinations. The traffic is distributed to the junction nodes in predetermined proportions that depend on the capacities of intermediate nodes. Bandwidth required for these paths depends on the ingress–egress capacities, and the traffic split ratios. The traffic split ratio is determined by the arrival rate of ingress traffic and the capacity of intermediate junction nodes. By simulation, we show that our proposed protocol attains increased throughput and bandwidth utilization with reduced delay.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Rajkumar, A., Murthy Sharma, N.S.: A Distributed Priority Based Routing Algorithm for Dynamic Traffic in Survivable WDM Networks. IJCSNS International Journal of Computer Science and Network Security 8(11) (2008)

    Google Scholar 

  2. Ou, C., Zang, H., Singhal, N., Zhu, K., Sahasrabuddhe, L.H., Macdonald, R.A., Mukherjee, B.: Sub path Protection For Scalability And Fast Recovery In Optical WDM Mesh Networks. IEEE Journal On Selected Areas In Communications 22(9) (2004)

    Google Scholar 

  3. Le, V.T., Ngo, S.H., Jiang, X.H., Horiguchi, S., Inoguchi, Y.: A Hybrid Algorithm for Dynamic Light path Protection in Survivable WDM Optical Networks. IEEE (2005)

    Google Scholar 

  4. Wikipedia, http://en.wikipedia.org/wiki/Multicasting

  5. Fen, Z., Miklos, M., Bernard, C.: Distance Priority Based Multicast Routing in WDM Networks Considering Sparse Light Splitting. In: IEEE 11th Singapore International Conference on Communication Systems (2008)

    Google Scholar 

  6. Jia, X.-H., Du, D.-Z., Hu, X.-D., Lee, M.-K., Gu, J.: Optimization of Wavelength Assignment for QoS Multicast in WDM Networks. IEEE Transactions on Communications 49(2) (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaliammal, N., Gurusamy, G. (2010). Resource Allocation and Multicast Routing Protocol for Optical WDM Networks. In: Das, V.V., Vijaykumar, R. (eds) Information and Communication Technologies. ICT 2010. Communications in Computer and Information Science, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15766-0_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15766-0_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15765-3

  • Online ISBN: 978-3-642-15766-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics