{"title":"Network Coding in Passive Optical Networks","authors":"K. Miller, T. Biermann, H. Woesner, H. Karl","doi":"10.1109/NETCOD.2010.5487683","DOIUrl":null,"url":null,"abstract":"One of the most promising technologies for high-speed access to the Internet are Passive Optical Networks as they provide high data rates at low cost. We integrate network coding into the Ethernet Passive Optical Network architecture to increase downlink throughput by up to 50% without changing the physical layer. In contrast to previous work, we suggest to code packets not only between pairs of nodes but also between an arbitrary number of nodes forming a cycle. We characterize the expected gain analytically and by means of simulations and investigate the trade-off between queuing delay, traffic variability, and throughput gain. We show that in practical scenarios, a simple scheme already achieves a reasonable amount of the maximum possible coding gain.","PeriodicalId":347232,"journal":{"name":"2010 IEEE International Symposium on Network Coding (NetCod)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Network Coding (NetCod)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETCOD.2010.5487683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42
Abstract
One of the most promising technologies for high-speed access to the Internet are Passive Optical Networks as they provide high data rates at low cost. We integrate network coding into the Ethernet Passive Optical Network architecture to increase downlink throughput by up to 50% without changing the physical layer. In contrast to previous work, we suggest to code packets not only between pairs of nodes but also between an arbitrary number of nodes forming a cycle. We characterize the expected gain analytically and by means of simulations and investigate the trade-off between queuing delay, traffic variability, and throughput gain. We show that in practical scenarios, a simple scheme already achieves a reasonable amount of the maximum possible coding gain.