Work place: National Institute of Technology (NIT), Durgapur, India
E-mail: tanmayd12@gmail.com
Website:
Research Interests: Computer Networks, Network Architecture, Network Security
Biography
Tanmay De received the B.Tech. degree in Computer Science and Engineering from University of Calcutta, India, in 1996, the M.Tech. degree in Computer Science and Engineering from the Jadavpur University, India, in 1998 and the Ph.D. degree in Department of Computer Science and Engineering, Indian Institute of Technology (IIT), Kharagpur, India, in 2010. Since 1998, he has been a faculty member of National Institute of Technology (NIT) Durgapur, India. His research interests include optical WDM networks, mobile ad hoc networks, and delay tolerant networks.
By Ashok Kumar Pradhan Subhendu Barat Tanmay De
DOI: https://doi.org/10.5815/ijcnis.2014.01.06, Pub. Date: 8 Nov. 2013
Traffic grooming is being considered as a key functionality of WDM networks, in which, multiple low speed traffic requests are groomed into a single high capacity wavelength channel. In this work, multicast traffic grooming problem is addressed to maximize the bandwidth utilization for a set of sessions in an optical WDM mesh topology. We propose a heuristic approach called Prioritized Multicast Traffic Grooming (PMTG) for constructing multicast tree and a first fit algorithm for wavelength assignment. After successful grooming of multicast requests, PMTG algorithm have successfully reduced the maximum number of wavelengths required in a link at the same time bandwidth utilization has greatly improved. We have simulated the heuristic approach PMTG with different network topologies and compared the performance with Multicast Traffic Grooming with Shortest Path (MTG-SP) algorithm. The simulation results show that the proposed heuristic algorithm produces better result than MTG-SP based algorithm.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals