On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Reducing network energy consumption via sleeping and rate-adaptation
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Nearly Tight Low Stretch Spanning Trees
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
Power efficient PoP design and auto-configuration
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Energy-Efficient network routing with discrete cost functions
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Future Generation Computer Systems
Delay-SRLG constrained, backup-shared path protection in WDM networks with sleep scheduling
Computer Communications
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
A hop-by-hop energy efficient distributed routing scheme
ACM SIGMETRICS Performance Evaluation Review
Rate-adaptive weighted fair queueing for energy-aware scheduling
Information Processing Letters
| Hi-index | 0.00 |
Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network elements. The difficulty is that transitioning between the active and sleeping modes consumes considerable energy and time. This results in an obvious trade-off between saving energy and provisioning performance guarantees such as end-toend delays. We study the following routing and scheduling problem in a network in which each network element either operates in the full-rate active mode or the zero-rate sleeping mode. For a given network and traffic matrix, routing determines the path along which each traffic stream traverses. For frame-based periodic scheduling, a schedule determines the active period per element within each frame and prioritizes packets within each active period. For a line topology, we present a schedule with close-tominimum delay for a minimum active period per element. For an arbitrary topology, we partition the network into a collection of lines and utilize the near-optimal schedule along each line. Additional delay is incurred only when a path switches from one line to another. By minimizing the number of switchings via routing, we show a logarithmic approximation for both energy consumption and end-to-end delays. If routing is given as input, we present two schedules one of which has active period proportional to the traffic load per network element, and the other proportional to the maximum load over all elements. The end-to-end delay of the latter is much improved compared to the delay for the former. This demonstrates the trade-off between energy and delay.