NCSU Institutional Repository >
NC State Theses and Dissertations >
Please use this identifier to cite or link to this item:
|Title: ||Power-aware Routing: Grooming Traffic for Reduction of Power Consumption in Wire-line Networks|
|Authors: ||Seshadri, Deepa|
|Advisors: ||Dr. Rudra Dutta, Committee Chair|
Dr. Douglas Reeves, Committee Member
Dr. Subhashish Bhattacharya, Committee Member
|Keywords: ||Power-aware routing|
|Issue Date: ||19-Aug-2008|
|Discipline: ||Computer Science|
|Abstract: ||The Internet has experienced an exponential growth with an increase in the number of end users and network connections. The increased demand has been met by increased bandwidth. However, this tremendous growth has also implied that there is an increase in the power consumption in the networks and routers. Additionally, a lot of heat is generated by the routers and there is an increasing probability that heat management issues become the bottleneck in the operation of network. This work aims to address the issue of power-management in wire-line networks by creating an effective routing (called power-aware routing) that would minimize the total number of network interfaces switched on in the routers.
The problem of power-aware routing is formulated as an Integer Linear Program. However, as the formulation is found to be computationally prohibitive for networks with large number of nodes, heuristic algorithms are proposed.
A path-based heuristic formulation is first proposed. In the path-based algorithm, traffic is routed along the shortest Dijkstra path available over the set of minimum possible 'on' interfaces. While the number of interfaces turned on in this formulation is close to the results from the ILP formulation, the aggressive nature in routing over a minimum possible 'on' interfaces means that the approach is not successful for cases when the traffic load in the network is high. Thus, to obtain solutions for larger range of networks, a second heuristic algorithm, called link-based algorithm, is proposed. In the link-based algorithm, the interfaces are switched on as pairs. The interface-pairs are switched on in the increasing order of their combined power consumption. Although, the number of interfaces that are switched on is higher than what is obtained from the path-based formulation, the link-based heuristic solves for more number of network scenarios. Flow deviation approach is then applied to the solution obtained from the link-based heuristic to provide a tighter upper bound on the number of interfaces required.
The proposed heuristic algorithms are compared with the results from the ILP formulation for eight node and ten node networks. Additionally, these algorithms are also compared against the usual routing methods that are in use today. These comparisons show that by employing power-aware routing, considerable amount of power can be saved as against the usual routing methods that are in use today. The number of interfaces that are turned on by the path-based heuristic algorithm is almost one-third of the interfaces turned on by the basic routing algorithm used in networks (Dijkstra's shortest path routing). The link-based heuristic also performs better than basic routing by switching on only half the number of interfaces than that are switched on by basic routing. The heuristic algorithms were also simulated and compared for node numbers greater than 10.|
|Appears in Collections:||Theses|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.