NDLI: Routing for power minimization in the speed scaling model

Content Provider	ACM Digital Library
Author	Zhang, Lisa Anta, Antonio Fernández Zhao, Wenbo Andrews, Matthew
Copyright Year	2012
Abstract	We study network optimization that considers power minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the power consumption of telecommunication networks by matching the consumption of each network element to the amount of processing required for its carried traffic. Most existing research on speed scaling focuses on a single network element in isolation. We aim for a network-wide optimization. Specifically, we study a routing problem with the objective of provisioning guaranteed speed/bandwidth for a given demand matrix while minimizing power consumption. Optimizing the routes critically relies on the characteristic of the speed-power curve $\textit{f(s)},$ which is how power is consumed as a function of the processing speed $\textit{s}.$ If $\textit{f}$ is superadditive, we show that there is no bounded approximation in general for integral routing, i.e., each traffic demand follows a single path. This contrasts with the well-known logarithmic approximation for subadditive functions. However, for common speed-power curves such as polynomials $\textit{f(s)}$ = $µs^{α},$ we are able to show a constant approximation via a simple scheme of randomized rounding. We also generalize this rounding approach to handle the case in which a nonzero startup cost σ appears in the speed-power curve, i.e., $\textit{f(s)}$ = {0, if $\textit{s}$ = 0 σ + $µs^{α},$ if $\textit{s}$ > 0. We present an $O((σ/µ)^{1/α})-approximation,$ and we discuss why coming up with an approximation ratio independent of the startup cost may be hard. Finally, we provide simulation results to validate our algorithmic approaches.
Starting Page	285
Ending Page	294
Page Count	10
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2011.2159864
Volume Number	20
Issue Number	1
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-02-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Power saving Routing Speed scaling Wireline networks
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Routing for Power Minimization in the Speed Scaling Model

Multipath routing algorithms for congestion minimization

Processor-network speed scaling for energy: delay tradeoff in smartphone applications

A distortion-resistant routing framework for video traffic in wireless multihop networks

Routing in multidomain networks

Optimally Adaptive Power-Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System

An address-light, integrated MAC and routing protocol for wireless sensor networks

Dynamic routing in multiparented networks

Minimum-power multicast routing in static ad hoc wireless networks

Routing for power minimization in the speed scaling model

Similar Documents

Routing for Power Minimization in the Speed Scaling Model

Multipath routing algorithms for congestion minimization

Processor-network speed scaling for energy: delay tradeoff in smartphone applications

A distortion-resistant routing framework for video traffic in wireless multihop networks

Routing in multidomain networks

Optimally Adaptive Power-Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System

An address-light, integrated MAC and routing protocol for wireless sensor networks

Dynamic routing in multiparented networks

Minimum-power multicast routing in static ad hoc wireless networks

Routing for power minimization in the speed scaling model