Power-aware routing in networks with quality of services constraints
MetadataShow full item record
Current network infrastructures are over-provisioned and thus exhibit poor power efficiency at low traffic load. We consider networks consisting of bundled links, whereby each link has one or more physical cables that can be switched off independently. The problem at hand is to switch off redundant nodes and cables during off-peak periods, while retaining the quality of services provided to existing traffic demands. Unfortunately, the problem to maximally shutdown redundant nodes and cables is Non-deterministic Polynomial-time (NP)-complete. Henceforth, we design a fast heuristic, called Multiple Paths by Shortest Path First (MSPF), that aims to maximise the number of switched-off nodes and cables subject to satisfying maximum link utilisation (MLU) and path length (PL) constraints. We have extensively evaluated the performance of MSPF on both real and synthetic topologies and traffic demands. Further, we have compared its performance against two state-of-the-art techniques: GreenTE, usable when each link has one cable, and Fast Greedy Heuristic (FGH), which supports bundled links but only for networks without MLU and PL constraints. On the Sprint network, MSPF can save on average 5% more power as compared to GreenTE while incurring only 1% of GreenTE's running time. While yielding equivalent power savings, MSPF requires only 0.35% of FGH's running time. Finally, setting MLU to at most 50% and PL to no longer than the network diameter, MSPF reduces the power usage of the GÉANT topology by up to 91% for links consisting of 10 cables. For experiments on synthetic topologies with bundle size of 30, MSPF yields a power saving of 89.81%. In this paper, we propose a new approach, that is, Multiple Paths by Shortest Path First, to find the minimum set of operational devices, that is, routers and cables, which can be used to route a given set of traffic demands while satisfying users' maximum link utilization and path length constraints. Simulation results show that Multiple Paths by Shortest Path First runs on average 99% faster while improving its power savings by 5% on tested topologies and traffic demands, as compared to GreenTE.
Showing items related by title, author, creator and subject.
Lin, GongQi; Soh, Sieteng; Chin, K. (2015)Current network infrastructures are over-provisioned to increase their resilience against resource failures. Such strategies exhibit poor energy efficiency during off-peak periods. In this respect, energy aware Traffic ...
Lin, Gongqi; Soh, Sieteng; Chin, K.; Lazarescu, Mihai (2013)Current network infrastructures are over-provisioned to increase their resilience against resource failures, e.g., bundled links and nodes, as well as congestion during peak hours. However such strategies waste resources ...
Lin, GongQi; Soh, Sieteng; Lazarescu, Mihai; Chin, K. (2012)This paper addresses the NP-hard problem of switching off bundled links whilst retaining the QoS provided to existing applications. We propose a fast heuristic, called Multiple Paths by Shortest Path First (MSPF), and ...