光网中预定光路需求的节能任播路由

Ying Chen, A. Jaekel, Kevin Li
{"title":"光网中预定光路需求的节能任播路由","authors":"Ying Chen, A. Jaekel, Kevin Li","doi":"10.1109/QBSC.2014.6841174","DOIUrl":null,"url":null,"abstract":"Optical grids are attractive candidates to meet the large-scale computing, storage and data transmission capabilities in a number of emerging application areas. In many grid applications, it may be possible to select one out of a number of possible destinations to execute a specific job. This is known as anycasting, and in this paper we exploit the inherent flexibility of anycasting for energy efficient routing in optical grids. We propose an optimal integer linear program (ILP) formulation for selecting routes and destinations to minimize the total energy consumption of a set of scheduled lightpath demands. Our approach takes into consideration energy consumption at the network nodes and along the optical fibers, as well as the start time and duration of each scheduled demand. To the best of our knowledge, this is the first work to address the problem of energy-aware routing of scheduled demands in optical grids. Simulation results demonstrate that significant improvements in energy consumption can be achieved compared to both existing energy-aware unicast routing and holding-time-unaware approaches.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Energy efficient anycast routing for scheduled lightpath demands in optical grids\",\"authors\":\"Ying Chen, A. Jaekel, Kevin Li\",\"doi\":\"10.1109/QBSC.2014.6841174\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optical grids are attractive candidates to meet the large-scale computing, storage and data transmission capabilities in a number of emerging application areas. In many grid applications, it may be possible to select one out of a number of possible destinations to execute a specific job. This is known as anycasting, and in this paper we exploit the inherent flexibility of anycasting for energy efficient routing in optical grids. We propose an optimal integer linear program (ILP) formulation for selecting routes and destinations to minimize the total energy consumption of a set of scheduled lightpath demands. Our approach takes into consideration energy consumption at the network nodes and along the optical fibers, as well as the start time and duration of each scheduled demand. To the best of our knowledge, this is the first work to address the problem of energy-aware routing of scheduled demands in optical grids. Simulation results demonstrate that significant improvements in energy consumption can be achieved compared to both existing energy-aware unicast routing and holding-time-unaware approaches.\",\"PeriodicalId\":314871,\"journal\":{\"name\":\"2014 27th Biennial Symposium on Communications (QBSC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 27th Biennial Symposium on Communications (QBSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QBSC.2014.6841174\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 27th Biennial Symposium on Communications (QBSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QBSC.2014.6841174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

在许多新兴应用领域,光网格是满足大规模计算、存储和数据传输能力的有吸引力的候选者。在许多网格应用程序中,可以从许多可能的目的地中选择一个来执行特定的作业。这就是所谓的任意映射,在本文中,我们利用任意映射的固有灵活性来实现光网中的节能路由。我们提出了一个最优整数线性规划(ILP)公式,用于选择路线和目的地,以最小化一组预定光路需求的总能耗。我们的方法考虑了网络节点和光纤的能量消耗,以及每个计划需求的开始时间和持续时间。据我们所知,这是第一个解决光电网中调度需求的能量感知路由问题的工作。仿真结果表明,与现有的能量感知单播路由和保持时间不感知路由方法相比,该方法可以显著改善能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy efficient anycast routing for scheduled lightpath demands in optical grids
Optical grids are attractive candidates to meet the large-scale computing, storage and data transmission capabilities in a number of emerging application areas. In many grid applications, it may be possible to select one out of a number of possible destinations to execute a specific job. This is known as anycasting, and in this paper we exploit the inherent flexibility of anycasting for energy efficient routing in optical grids. We propose an optimal integer linear program (ILP) formulation for selecting routes and destinations to minimize the total energy consumption of a set of scheduled lightpath demands. Our approach takes into consideration energy consumption at the network nodes and along the optical fibers, as well as the start time and duration of each scheduled demand. To the best of our knowledge, this is the first work to address the problem of energy-aware routing of scheduled demands in optical grids. Simulation results demonstrate that significant improvements in energy consumption can be achieved compared to both existing energy-aware unicast routing and holding-time-unaware approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信