Leila Boukhalfa, P. Minet, Serge Midonnet, L. George
{"title":"MANET中CBQ和PriQueue的比较评估","authors":"Leila Boukhalfa, P. Minet, Serge Midonnet, L. George","doi":"10.1109/MAHSS.2005.1542784","DOIUrl":null,"url":null,"abstract":"More and more applications supported by MANETs require quality of service (QoS). QoS can be expressed in terms of bandwidth or delay. In this paper, we study the impact of the scheduling policy used by each MANET node on the QoS granted to flows. We first show how to use WCBQ, a class based queueing scheduling, in a wireless network. We then compare the performances achieved by WCBQ and priority queueing. Simulation results show that WCBQ protects flows with low throughput. All flows receive a bandwidth proportionally to their weights. WCBQ tends to minimize the variations of the average bandwidth granted to a flow as well as the end-to-end delay. We finally propose two solutions allowing the coexistence of flows with delay requirements and bandwidth requirements. These solutions guarantee a low delay to low throughput flows without penalizing the bandwidth granted to other flows","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Comparative evaluation of CBQ and PriQueue in a MANET\",\"authors\":\"Leila Boukhalfa, P. Minet, Serge Midonnet, L. George\",\"doi\":\"10.1109/MAHSS.2005.1542784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"More and more applications supported by MANETs require quality of service (QoS). QoS can be expressed in terms of bandwidth or delay. In this paper, we study the impact of the scheduling policy used by each MANET node on the QoS granted to flows. We first show how to use WCBQ, a class based queueing scheduling, in a wireless network. We then compare the performances achieved by WCBQ and priority queueing. Simulation results show that WCBQ protects flows with low throughput. All flows receive a bandwidth proportionally to their weights. WCBQ tends to minimize the variations of the average bandwidth granted to a flow as well as the end-to-end delay. We finally propose two solutions allowing the coexistence of flows with delay requirements and bandwidth requirements. These solutions guarantee a low delay to low throughput flows without penalizing the bandwidth granted to other flows\",\"PeriodicalId\":268267,\"journal\":{\"name\":\"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MAHSS.2005.1542784\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MAHSS.2005.1542784","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparative evaluation of CBQ and PriQueue in a MANET
More and more applications supported by MANETs require quality of service (QoS). QoS can be expressed in terms of bandwidth or delay. In this paper, we study the impact of the scheduling policy used by each MANET node on the QoS granted to flows. We first show how to use WCBQ, a class based queueing scheduling, in a wireless network. We then compare the performances achieved by WCBQ and priority queueing. Simulation results show that WCBQ protects flows with low throughput. All flows receive a bandwidth proportionally to their weights. WCBQ tends to minimize the variations of the average bandwidth granted to a flow as well as the end-to-end delay. We finally propose two solutions allowing the coexistence of flows with delay requirements and bandwidth requirements. These solutions guarantee a low delay to low throughput flows without penalizing the bandwidth granted to other flows