{"title":"Comparison of Interleaved Polling with adaptive Cycle Time and Cyclic Demand Proportionality Algorithms","authors":"S. Krijestorac, J. Bagby","doi":"10.1109/ISSPIT.2008.4775646","DOIUrl":null,"url":null,"abstract":"Ethernet passive optical network (EPON) is an access network that delivers essential services of voice, video, and data communications reliably, while at the same time providing expected guarantees of the delivery of those services in terms of defined quality of service measures (QOS). This paper compares performance criteria such as delay, queue size, and packet loss ratio for two dynamic bandwidth allocation (DBA) algorithms: interleaved polling with adaptive cycle time (IPACT), and a new cyclic demand proportionality algorithm (CDP). CDP gives the best performances in terms delay vs. offered load, queue size vs. offered load and packet loss ratio vs. offered load compared to IPACT with the Fixed Allocation Window size for transmission. Improvement is seen for these three parameters when CDP is compared with IPACT with limited allocation window size. A traffic generator that gives traffic with self-similar and long range dependency properties is used in the simulations.","PeriodicalId":213756,"journal":{"name":"2008 IEEE International Symposium on Signal Processing and Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Signal Processing and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2008.4775646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Ethernet passive optical network (EPON) is an access network that delivers essential services of voice, video, and data communications reliably, while at the same time providing expected guarantees of the delivery of those services in terms of defined quality of service measures (QOS). This paper compares performance criteria such as delay, queue size, and packet loss ratio for two dynamic bandwidth allocation (DBA) algorithms: interleaved polling with adaptive cycle time (IPACT), and a new cyclic demand proportionality algorithm (CDP). CDP gives the best performances in terms delay vs. offered load, queue size vs. offered load and packet loss ratio vs. offered load compared to IPACT with the Fixed Allocation Window size for transmission. Improvement is seen for these three parameters when CDP is compared with IPACT with limited allocation window size. A traffic generator that gives traffic with self-similar and long range dependency properties is used in the simulations.