Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/120122
Title: ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS
Authors: WU GAOFENG
Keywords: energy efficiency, optical networks, IP over WDM, traffic splitting, bandwidth varying, minimum cut
Issue Date: 30-Sep-2014
Source: WU GAOFENG (2014-09-30). ENERGY EFFICIENT CONNECTION PROVISIONING IN IP OVER WDM NETWORKS. ScholarBank@NUS Repository.
Abstract: Over the last decade, green networking has attracted a great deal of attention from researchers and engineers in academia and industry due to the huge amount of power consumed by the Information and Communication Technology (ICT) sector and the corresponding CO2 emission which is a major cause of global warming. Optical networks have been widely deployed due to their capability of providing huge bandwidth, low bit error rate, and high security. Moreover, optical networking is generally more power efficient than its electronic counterpart. In this thesis, we investigate the problem of energy efficient connection provisioning in IP over Wavelength-Division-Multiplexing (WDM) optical networks which consist of an IP layer and an optical layer. We first study the problem of power efficient provisioning of static and dynamic connection requests considering traffic splitting and the impact of different power profiles. For static connection requests, we formulate Integer Linear Programming (ILP) models for affine power profile and Integer Quadratic Programming (IQP) models for convex power profile to optimize network-wide power consumption with or without traffic splitting. For dynamic connection requests, we construct an auxiliary graph and assign the weight of each link according to its power consumption; thereby a shortest-path routing algorithm can be used. Next, we investigate the problem of achieving a tradeoff between power efficiency and blocking performance when provisioning connection requests. We propose an algorithm named Balanced Power efficient Integrated Routing (B-PIR), which strives to strike a balance between power efficiency and blocking performance by preventing critical resources from being exhausted too fast. We use the idea of link criticality which is defined as the number of times that a link belongs to the minimum cut sets of s-d pairs in the network. Third, we explore the problem of energy efficient provisioning of bandwidth-varying scheduled connection requests. The key issue is to decide the routing, time and bandwidth allocation schemes for a set of scheduled connection requests (of which continuous and fixed-bandwidth data transmission are not mandatory) such that their energy consumption is minimized while meeting their data transmission deadlines, which has not been studied before to the best of our knowledge. We first present an ILP formulation for scheduling and allocating resources to bandwidth-varying scheduled connection requests, such that the total energy consumption is minimized. We further extend the ILP formulation and propose a computationally simple and efficient heuristic algorithm that provisions one connection request at a time such that the incremental energy consumption of the network due to the admission of the connection request is minimized. Finally, we research on the problem of power efficient provisioning of dynamic connection requests with reliability constraints. We propose a k-shortest path based routing algorithm that tries to find a minimum power consumption path for a connection request while satisfying the reliability requirements. We demonstrate the effectiveness of our proposed energy efficient schemes through numerical results obtained from solving integer programming models or simulation results acquired based on various network topologies and scenarios.
URI: http://scholarbank.nus.edu.sg/handle/10635/120122
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
WuGF.pdf1.7 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

86
checked on Jan 12, 2018

Download(s)

79
checked on Jan 12, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.