一种新的基于簇的PON动态数据传输序列轮询算法

Sujit Basu, M. Hossen, M. Hanawa
{"title":"一种新的基于簇的PON动态数据传输序列轮询算法","authors":"Sujit Basu, M. Hossen, M. Hanawa","doi":"10.1109/TENSYMP50017.2020.9230910","DOIUrl":null,"url":null,"abstract":"Online polling-based passive optical network (PON) effectively reduces the ideal time between two successive time cycles and large grant delay for optical network units (ONUs) than the offline polling-based PON. However, it introduced some other draw backs like unfair bandwidth allocation to the ONUs in different traffic load conditions and absent of priority scheduling to early serve the mostly busy ONUs. In this paper, we propose a new dynamic data transmission sequence algorithm for cluster-based PON that accommodate the advantages of both the existing offline and online polling-based schemes. In the proposed cluster-based PON, in each time cycle, optical line terminal divides all the active ONUs in a number of clusters and unused bandwidth of a cluster is added as a surplus bandwidth to the next cluster. Computer simulated results is obtained in the case of three different performance parameters where the proposed scheme outperforms than the existing offline and online poling-based schemes.","PeriodicalId":6721,"journal":{"name":"2020 IEEE Region 10 Symposium (TENSYMP)","volume":"22 1","pages":"271-274"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Polling Algorithm for Dynamic Data Transmission Sequence of Cluster-based PON\",\"authors\":\"Sujit Basu, M. Hossen, M. Hanawa\",\"doi\":\"10.1109/TENSYMP50017.2020.9230910\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online polling-based passive optical network (PON) effectively reduces the ideal time between two successive time cycles and large grant delay for optical network units (ONUs) than the offline polling-based PON. However, it introduced some other draw backs like unfair bandwidth allocation to the ONUs in different traffic load conditions and absent of priority scheduling to early serve the mostly busy ONUs. In this paper, we propose a new dynamic data transmission sequence algorithm for cluster-based PON that accommodate the advantages of both the existing offline and online polling-based schemes. In the proposed cluster-based PON, in each time cycle, optical line terminal divides all the active ONUs in a number of clusters and unused bandwidth of a cluster is added as a surplus bandwidth to the next cluster. Computer simulated results is obtained in the case of three different performance parameters where the proposed scheme outperforms than the existing offline and online poling-based schemes.\",\"PeriodicalId\":6721,\"journal\":{\"name\":\"2020 IEEE Region 10 Symposium (TENSYMP)\",\"volume\":\"22 1\",\"pages\":\"271-274\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Region 10 Symposium (TENSYMP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENSYMP50017.2020.9230910\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Region 10 Symposium (TENSYMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENSYMP50017.2020.9230910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于在线轮询的无源光网络(PON)比基于离线轮询的无源光网络(PON)有效地减少了光网络单元(onu)两个连续时间周期之间的理想时间间隔和较大的授权延迟。然而,它也带来了一些缺点,如在不同的流量负载条件下对onu的带宽分配不公平,以及缺乏优先级调度来提前服务最繁忙的onu。在本文中,我们提出了一种新的基于集群的PON动态数据传输序列算法,它融合了现有基于离线和在线轮询的PON算法的优点。在本文提出的基于集群的PON中,光线路终端在每个时间周期内将所有活动onu划分到多个集群中,并将一个集群中未使用的带宽作为剩余带宽添加到下一个集群。在三种不同性能参数下的计算机模拟结果表明,该方案优于现有的基于离线和在线轮询的方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Polling Algorithm for Dynamic Data Transmission Sequence of Cluster-based PON
Online polling-based passive optical network (PON) effectively reduces the ideal time between two successive time cycles and large grant delay for optical network units (ONUs) than the offline polling-based PON. However, it introduced some other draw backs like unfair bandwidth allocation to the ONUs in different traffic load conditions and absent of priority scheduling to early serve the mostly busy ONUs. In this paper, we propose a new dynamic data transmission sequence algorithm for cluster-based PON that accommodate the advantages of both the existing offline and online polling-based schemes. In the proposed cluster-based PON, in each time cycle, optical line terminal divides all the active ONUs in a number of clusters and unused bandwidth of a cluster is added as a surplus bandwidth to the next cluster. Computer simulated results is obtained in the case of three different performance parameters where the proposed scheme outperforms than the existing offline and online poling-based schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信