Work place: National Institute of Technology (NIT), Durgapur, India
E-mail: barat.subhendu@gmail.com
Website:
Research Interests: Applied computer science, Computational Science and Engineering, Computer systems and computational processes, Computer Architecture and Organization, Theoretical Computer Science, Data Structures and Algorithms
Biography
Subhendu Barat has completed M. Tech. in the year 2012, from National Institute of Technology (NIT) Durgapur and is currently working as an Assistant Professor in the Department of Computer Science and Engineering at NSHM Knowledge Campus Durgapur Group of Institutions. His research area is Optical Fiber Communication. He is currently pursuing Ph.D. from National Institute of Technology, Durgapur, India.
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