A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Performance of Alternate Routing Methods in All--Optical Switching Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Efficient dynamic traffic grooming in service-differentiated WDM mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reconfiguration of Traffic Grooming Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Throughput maximization in traffic grooming in WDM mesh networks
Journal of High Speed Networks
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks
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
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Dynamic routing and spectrum (re)allocation in future flexgrid optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Traffic grooming in optical WDM mesh networks is a two-layer routing problem to effectively pack low-rate connections onto high-rate lightpaths, which, in turn, are established on wavelength links. The objective of traffic grooming is to improve resource efficiency. However, resource contention between lightpaths and connections may result in inefficient resource usage or even the blocking of some connections. In this work, we employ a rerouting approach to alleviate resource inefficiency and improve the network throughput under a dynamic traffic model. We propose two rerouting schemes, rerouting at lightpath level (RRLP) and rerouting at connection level (RRCON) and a qualitative comparison is made between the two. We also propose two heuristic rerouting algorithms, namely the critical-wavelength-avoiding one-lightpath-limited (CWA-1L) rerouting algorithm and the critical-lightpath-avoiding one-connection-limited (CLA-1C) rerouting algorithm, which are based on the two rerouting schemes. Simulation results show that rerouting reduces the blocking probability of connections significantly.