Algorithms: design techniques and analysis
Algorithms: design techniques and analysis
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all optical networks based on clique partitioning
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Traffic grooming based on shortest path in optical WDM mesh networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Routing and wavelength assignment in wavelength division multiplexing networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Traffic grooming algorithm using shortest EDPs table in WDM mesh networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Traffic grooming in mesh WDM optical networks - performance analysis
IEEE Journal on Selected Areas in Communications
A Link Bundled Auxiliary Graph Model for Constrained Dynamic Traffic Grooming in WDM Mesh Networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
An algorithm for traffic grooming in WDM mesh networks using dynamic path selection strategy
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
A multiobjective approach based on the law of gravity and mass interactions for optimizing networks
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
MOEA/D for traffic grooming in WDM optical networks
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
In wavelength routed optical networks, the number of wavelength channels is limited due to several constraints and each wavelength as well as each lightpath support traffic in the Gbps range. On the other hand, the traffic requested by an individual connection is still in the Mbps range. Therefore, to utilize the network resources (such as bandwidth and transceivers) effectively, several low-speed traffic streams have to be efficiently groomed or multiplexed into one or more high-speed lightpaths. The grooming problem of a static demand is considered as an optimization problem. In this work, we have investigated the traffic grooming problem with the objective of maximizing the network throughput for wavelength-routed mesh networks and map this problem to the clique partitioning problem. We have proposed an algorithm to handle general multi-hop static traffic grooming based on the clique partitioning concept. The efficiency of our approach has been established through extensive simulation on different sets of traffic demands with different bandwidth granularities for different network topologies and compared the approach with existing algorithms.