Research Article Open Access

Efficient Multipath Routing and Wavelength Allocation Using Traffic Grooming in Optical Wavelength Division Multiplexing Mesh Networks

T. Kavitha1 and V. Rajamani2
  • 1 Indra Ganesan College of Engineering, India
  • 2 NPR College of Engineering and Technology, India
Journal of Computer Science
Volume 8 No. 11, 2012, 1839-1848

DOI: https://doi.org/10.3844/jcssp.2012.1839.1848

Submitted On: 28 May 2012 Published On: 19 September 2012

How to Cite: Kavitha, T. & Rajamani, V. (2012). Efficient Multipath Routing and Wavelength Allocation Using Traffic Grooming in Optical Wavelength Division Multiplexing Mesh Networks. Journal of Computer Science, 8(11), 1839-1848. https://doi.org/10.3844/jcssp.2012.1839.1848

Abstract

In optical WDM mesh networks, traffic grooming is essential in order to utilize the bandwidth efficiently to minimize the cost and meet the user service requirement. By grooming traffic, it is possible to reduce the total cost of all Add drop multiplexer needed. Also for the high processing capability in a WDM network, the path should be capable of carrying the traffic without any failure. In this study, we use a traffic grooming algorithm to establish light paths between node pairs having the largest amounts of traffic. Among the established light paths, the risk-disjoint paths are obtained using the large traffic first algorithm. After establishing light paths, the traffic is routed from the source to the connection node and then traffic is transmitted from the connection node to the destination node. In addition to the efficient routing, we propose a wavelength allocation technique to ensure that the traffic is transferred to the destination with efficient use of the network resources. From the simulation results we show that this algorithm involves additional capacity in the virtual topology to support survivable routing of connections.

  • 901 Views
  • 1,558 Downloads
  • 3 Citations

Download

Keywords

  • WDM Networks
  • Traffic Grooming
  • Wavelength Allocation
  • Routing
  • Establishing Light Paths
  • Survivable Routing
  • Network Resources
  • Risk-Disjoint Paths