Dynamic erasure-coded data retrieval in elastic optical data center networks

Juzi Zhao, V. Vokkarane
{"title":"Dynamic erasure-coded data retrieval in elastic optical data center networks","authors":"Juzi Zhao, V. Vokkarane","doi":"10.1109/SARNOF.2016.7846769","DOIUrl":null,"url":null,"abstract":"A flexible data retrieval service is needed in data center networks, where erasure coding has been widely adopted. Elastic Optical Networks, based on Nyquist wavelength division multiplexing or optical orthogonal frequency division multiplexing is an ideal backbone for data centers, since they can efficiently utilize the optical fiber's bandwidth in an elastic manner by partitioning the bandwidth into hundreds or even thousands of subcarriers. In this paper, we study the erasure-coded data retrieval problem for dynamic traffic in elastic optical networks, the objective is to minimize the blocking ratio. A heuristic based on List Scheduling was proposed. Simulation results show that the blocking ratio is reduced in comparison to a benchmark method.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 37th Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2016.7846769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A flexible data retrieval service is needed in data center networks, where erasure coding has been widely adopted. Elastic Optical Networks, based on Nyquist wavelength division multiplexing or optical orthogonal frequency division multiplexing is an ideal backbone for data centers, since they can efficiently utilize the optical fiber's bandwidth in an elastic manner by partitioning the bandwidth into hundreds or even thousands of subcarriers. In this paper, we study the erasure-coded data retrieval problem for dynamic traffic in elastic optical networks, the objective is to minimize the blocking ratio. A heuristic based on List Scheduling was proposed. Simulation results show that the blocking ratio is reduced in comparison to a benchmark method.
弹性光数据中心网络中的动态擦除编码数据检索
数据中心网络需要灵活的数据检索服务,擦除编码已被广泛采用。弹性光网络是基于奈奎斯特波分复用或光正交频分复用的数据中心理想的骨干网络,因为它们可以将带宽弹性地划分为数百甚至数千个子载波,从而有效地利用光纤的带宽。本文研究弹性光网络中动态流量的擦除编码数据检索问题,其目标是使阻塞率最小化。提出了一种基于列表调度的启发式算法。仿真结果表明,与基准方法相比,该方法的阻塞率有所降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信