Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A randomized algorithm for finding a path subject to multiple QoS requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms
Comparative analysis of path computation techniques for MPLS traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
A New Class of Online Minimum-Interference Routing Algorithms
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Definitive MPLS Network Designs
Definitive MPLS Network Designs
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Reducing power consumption in backbone networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
GreenTE: Power-aware traffic engineering
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Future Generation Computer Systems
A MILP-based heuristic for energy-aware traffic engineering with shortest path routing
INOC'11 Proceedings of the 5th international conference on Network optimization
The green-game: striking a balance between QoS and energy saving
Proceedings of the 23rd International Teletraffic Congress
Profile-based routing and traffic engineering
Computer Communications
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Editorial: Editorial for Computer Networks special issue on "Green communication networks"
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-aware IP traffic engineering with shortest path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Greening data center networks with throughput-guaranteed power-aware routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sleep modes effectiveness in backbone networks with limited configurations
Computer Networks: The International Journal of Computer and Telecommunications Networking
A hop-by-hop energy efficient distributed routing scheme
ACM SIGMETRICS Performance Evaluation Review
Petri net based evaluation of energy consumption in wireless sensor nodes
Journal of High Speed Networks
Energy efficient management framework for multihop TDMA-based wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
A number of studies report that ICT sectors are responsible for up to 10% of the worldwide power consumption and that a substantial share of such amount is due to the Internet infrastructure. To accommodate the traffic in the peak hours, Internet Service Providers (ISP) have overprovisioned their networks, with the result that most of the links and devices are under-utilized most of the time. Thus, under-utilized links and devices may be put in a sleep state in order to save power and that might be achieved by properly routing traffic flows. In this paper, we address the design of a joint admission control and routing scheme aiming at maximizing the number of admitted flow requests while minimizing the number of nodes and links that need to stay active. We assume an online routing paradigm, where flow requests are processed one-by-one, with no knowledge of future flow requests. Each flow request has requirements in terms of bandwidth and m additive measures (e.g., delay, jitter). We develop a new routing algorithm, E^2-MCRA, which searches for a feasible path for a given flow request that requires the least number of nodes and links to be turned on. The basic concepts of E^2-MCRA are look-ahead, the depth-first search approach and a path length definition as a function of the available bandwidth, the additive QoS constraints and the current status (on/off) of the nodes and links along the path. Finally, we present the results of the simulation studies we conducted to evaluate the performance of the proposed algorithm.