Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
IEEE Spectrum
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Scaling internet routers using optics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
DYNAMIC TRAFFIC GROOMING: THE CHANGING ROLE OF TRAFFIC GROOMING
IEEE Communications Surveys & Tutorials
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
Energy saving and cost reduction in multi-granularity green optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ECO-ALOC: Energy-efficient resource allocation for cluster-based software routers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy optimization in IP-over-WDM networks
Optical Switching and Networking
Dynamic hybrid grooming based on power efficiency in green IP over WDM networks
Photonic Network Communications
Towards a robust and green internet backbone network
Proceedings of the 8th International Conference on Network and Service Management
Survivable green IP over WDM networks against double-link failures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
The traffic grooming problem in optical networks has been extensively studied. It tackles the problem of aggregating sub-wavelength traffic onto optical lightpaths so that the network cost can be reduced. As of yet, the network cost considered is in terms of the number of wavelengths, SONET ADMs, and the amount of OEO processing. However, in recent years, the steadily rising cost of energy consumption of the network has raised a lot concerns. In this paper, we revisit the traffic grooming problem and provide formulations for green optical network design, and show a simple algorithm working at one of the layers identified by the model.