{"title":"解耦PFQ算法的带宽、延迟和突发性,用于漏桶约束流量的QoS保证","authors":"WoongChul Choi","doi":"10.1109/LCN.1999.802069","DOIUrl":null,"url":null,"abstract":"Delay and bandwidth are important QoS parameters for connections sharing the output link. PFQ algorithms address various issues for handling those parameters. For a leaky bucket constraint traffic, burstiness is also an important characteristic. In this research, we propose a scheme on decoupling delay, bandwidth and burstiness. By doing that, those QoS parameters are guaranteed in a satisfactory degree.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"502 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Decoupling bandwidth, delay and burstiness of PFQ algorithm for QoS guarantee of a leaky bucket constraint traffic\",\"authors\":\"WoongChul Choi\",\"doi\":\"10.1109/LCN.1999.802069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delay and bandwidth are important QoS parameters for connections sharing the output link. PFQ algorithms address various issues for handling those parameters. For a leaky bucket constraint traffic, burstiness is also an important characteristic. In this research, we propose a scheme on decoupling delay, bandwidth and burstiness. By doing that, those QoS parameters are guaranteed in a satisfactory degree.\",\"PeriodicalId\":265611,\"journal\":{\"name\":\"Proceedings 24th Conference on Local Computer Networks. LCN'99\",\"volume\":\"502 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 24th Conference on Local Computer Networks. LCN'99\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1999.802069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 24th Conference on Local Computer Networks. LCN'99","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1999.802069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decoupling bandwidth, delay and burstiness of PFQ algorithm for QoS guarantee of a leaky bucket constraint traffic
Delay and bandwidth are important QoS parameters for connections sharing the output link. PFQ algorithms address various issues for handling those parameters. For a leaky bucket constraint traffic, burstiness is also an important characteristic. In this research, we propose a scheme on decoupling delay, bandwidth and burstiness. By doing that, those QoS parameters are guaranteed in a satisfactory degree.