{"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.