Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Reducing network energy consumption via sleeping and rate-adaptation
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
An average velocity-based routing protocol with low end-to-end delay for wireless sensor networks
IEEE Communications Letters
Towards green broadband access networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Routing and scheduling for energy and delay minimization in the powerdown model
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Green wave: latency and capacity-efficient sleep scheduling for wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
A differentiated optical services model for WDM networks
IEEE Communications Magazine
Traffic grooming for survivable WDM networks - shared protection
IEEE Journal on Selected Areas in Communications
Fast restoration of ATM networks
IEEE Journal on Selected Areas in Communications
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.24 |
This paper addresses the Delay-Shared Risk Link Groups (SRLG) constrained path protection problem in green WDM networks with sleep scheduling, and presents a Green Delay-SRLG Constrained Protection (GDSCP) approach. In order to balance the QoS (delay, SRLG reliability, etc.) and energy consumption, the path search algorithm in GDSCP adopts different principles in the search of the primary and backup paths. The choice of the primary path is optimal for the end-to-end delay while minimizing the node awaking to save energy. When necessary, the rarely used backup paths are allowed to go through more sleeping nodes that lead to potential node awaking to ensure the disjoint degree, and thus increase the SRLG reliability of the combined path. Besides the traditional wavelength sharing between backup paths, our approach further encourages paths of different connections to wake up common sleeping nodes to increase the utilization of the reserved node awaking and thus reduce the demand for the new node-state switching in the network. Comparing to the traditional energy-aware schemes, simulations show promising results that GDSCP can obtain significant improvement in terms of increasing the sleeping percentage of the network and reducing the number of node-state switching without sacrificing the performance of blocking rate.