Routing and scheduling for energy and delay minimization in the powerdown model

计算机科学 调度(生产过程) 静态路由 网络数据包 地铁列车时刻表 计算机网络 多路径等成本路由 拓扑(电路) 能源消耗 数学优化 路由协议 实时计算 数学 工程类 电气工程 操作系统
作者
Matthew Andrews,Antonio Fernández Anta,Lisa Zhang,Wenbo Zhao
出处
期刊:Networks [Wiley]
卷期号:61 (3): 226-237 被引量:15
标识
DOI:10.1002/net.21474
摘要

Abstract Energy conservation is drawing increasing attention in data networking. As networks are designed for peak traffic, network elements typically operate at full speed and consume maximum power even when carrying low traffic. One school of thought believes that a dominant amount of power saving comes from turning off network elements. The difficulty is that transitioning between the active and sleeping modes consumes considerable energy and time. This results in an obvious trade‐off between saving energy and provisioning performance guarantees such as end‐to‐end delays. We study the following routing and scheduling problem in a network in which each network element either operates in the full‐rate active mode or the zero‐rate sleeping mode. For a given network and traffic matrix, routing determines the path that each traffic stream traverses. For frame‐based periodic scheduling, a schedule determines the active period per element within each frame and prioritizes packets within each active period. For a line topology, we present a schedule with close‐to‐minimum delay for a minimum active period per element. For an arbitrary topology, we partition the network into a collection of lines and use the near‐optimal schedule along each line. Additional delay is incurred only when a path switches from one line to another. By minimizing the number of switchings via routing, we show a logarithmic approximation for both power consumption and end‐to‐end delays. If routing is given as input, we present two schedules one of which has active period proportional to the traffic load per network element, and the other has active period proportional to the maximum load over all elements. The end‐to‐end delay of the latter is much improved compared to the delay for the former. This demonstrates the trade‐off between power and delay. Finally, we provide simulation results to validate our algorithmic approaches. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
何帅帅完成签到,获得积分10
1秒前
1秒前
2秒前
款款发布了新的文献求助10
2秒前
顾矜应助轻松的火龙果采纳,获得10
2秒前
2秒前
LIZHEN发布了新的文献求助10
3秒前
顾矜应助闪闪落雁采纳,获得10
3秒前
4秒前
4秒前
5秒前
Phe完成签到,获得积分10
5秒前
bbanshan完成签到,获得积分10
5秒前
cxq应助nenoaowu采纳,获得10
5秒前
5秒前
077完成签到,获得积分10
5秒前
6秒前
眼圆广志完成签到,获得积分10
6秒前
小马甲应助yys采纳,获得10
7秒前
高高碧发布了新的文献求助30
7秒前
感动友桃完成签到,获得积分10
8秒前
8秒前
8秒前
9秒前
yuanyiyuan发布了新的文献求助10
9秒前
10秒前
10秒前
量子星尘发布了新的文献求助10
10秒前
nenoaowu完成签到,获得积分10
10秒前
轻松的火龙果完成签到,获得积分20
11秒前
12秒前
小丽完成签到,获得积分10
12秒前
VV完成签到,获得积分10
13秒前
lmno发布了新的文献求助10
13秒前
13秒前
13秒前
13秒前
14秒前
LIZHEN发布了新的文献求助10
15秒前
banana发布了新的文献求助10
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Kinesiophobia : a new view of chronic pain behavior 2000
Cronologia da história de Macau 1600
BRITTLE FRACTURE IN WELDED SHIPS 1000
Lloyd's Register of Shipping's Approach to the Control of Incidents of Brittle Fracture in Ship Structures 1000
Developmental Peace: Theorizing China’s Approach to International Peacebuilding 1000
Traitements Prothétiques et Implantaires de l'Édenté total 2.0 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6132939
求助须知:如何正确求助?哪些是违规求助? 7960174
关于积分的说明 16519669
捐赠科研通 5249470
什么是DOI,文献DOI怎么找? 2803319
邀请新用户注册赠送积分活动 1784404
关于科研通互助平台的介绍 1655208