{"title":"基于窗口的公平聚合器在骨干网中支持可扩展的QoS保证:实验性能研究","authors":"Mustafa Sanli, A. Pehlivanli, E. G. Schmidt","doi":"10.1109/ICCNC.2016.7440598","DOIUrl":null,"url":null,"abstract":"Video and voice traffic currently have the biggest share in the Internet. These applications require end-to-end Quality of Service (QoS) guarantees for each flow. The packet schedulers in the routers play an important role in providing end-to-end QoS support in the Internet. It is important that the implementation of packet schedulers scale with the steady increase in the data rates and the number of flows. In our previous work we proposed Window Based Fair Aggregator (WBFA) to decrease the number of flows. WBFA aggregates the flows preserving their end-to-end delay bounds with a relatively small aggregation delay. In this paper we present a detailed simulation study to demonstrate the features of WBFA and its effect on the performance of fair packet schedulers.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Window based fair aggregator for the scalable support of QoS guarantees in the backbone: An experimental performance study\",\"authors\":\"Mustafa Sanli, A. Pehlivanli, E. G. Schmidt\",\"doi\":\"10.1109/ICCNC.2016.7440598\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Video and voice traffic currently have the biggest share in the Internet. These applications require end-to-end Quality of Service (QoS) guarantees for each flow. The packet schedulers in the routers play an important role in providing end-to-end QoS support in the Internet. It is important that the implementation of packet schedulers scale with the steady increase in the data rates and the number of flows. In our previous work we proposed Window Based Fair Aggregator (WBFA) to decrease the number of flows. WBFA aggregates the flows preserving their end-to-end delay bounds with a relatively small aggregation delay. In this paper we present a detailed simulation study to demonstrate the features of WBFA and its effect on the performance of fair packet schedulers.\",\"PeriodicalId\":308458,\"journal\":{\"name\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2016.7440598\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2016.7440598","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Window based fair aggregator for the scalable support of QoS guarantees in the backbone: An experimental performance study
Video and voice traffic currently have the biggest share in the Internet. These applications require end-to-end Quality of Service (QoS) guarantees for each flow. The packet schedulers in the routers play an important role in providing end-to-end QoS support in the Internet. It is important that the implementation of packet schedulers scale with the steady increase in the data rates and the number of flows. In our previous work we proposed Window Based Fair Aggregator (WBFA) to decrease the number of flows. WBFA aggregates the flows preserving their end-to-end delay bounds with a relatively small aggregation delay. In this paper we present a detailed simulation study to demonstrate the features of WBFA and its effect on the performance of fair packet schedulers.