{"title":"基于先进轮循方法的QoS网络CAC算法","authors":"Tamás Marosits, S. Molnár, J. Sztrik","doi":"10.1109/ISCC.2001.935386","DOIUrl":null,"url":null,"abstract":"In this paper a new traffic control method called advanced round robin (ARR) is presented. It is shown that ARR can provide both worst case and statistical quality of service guarantees without coupling cell loss and delay requirements. A related connection admission control algorithm with performance study is also presented. A comparative performance analysis of ARR using simulation was performed in different real scenarios. Results are compared to a reference system and to the simple round robin method.","PeriodicalId":147986,"journal":{"name":"Proceedings. Sixth IEEE Symposium on Computers and Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"CAC algorithm based on advanced round robin method for QoS networks\",\"authors\":\"Tamás Marosits, S. Molnár, J. Sztrik\",\"doi\":\"10.1109/ISCC.2001.935386\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a new traffic control method called advanced round robin (ARR) is presented. It is shown that ARR can provide both worst case and statistical quality of service guarantees without coupling cell loss and delay requirements. A related connection admission control algorithm with performance study is also presented. A comparative performance analysis of ARR using simulation was performed in different real scenarios. Results are compared to a reference system and to the simple round robin method.\",\"PeriodicalId\":147986,\"journal\":{\"name\":\"Proceedings. Sixth IEEE Symposium on Computers and Communications\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Sixth IEEE Symposium on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2001.935386\",\"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. Sixth IEEE Symposium on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2001.935386","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
CAC algorithm based on advanced round robin method for QoS networks
In this paper a new traffic control method called advanced round robin (ARR) is presented. It is shown that ARR can provide both worst case and statistical quality of service guarantees without coupling cell loss and delay requirements. A related connection admission control algorithm with performance study is also presented. A comparative performance analysis of ARR using simulation was performed in different real scenarios. Results are compared to a reference system and to the simple round robin method.