{"title":"基于ieee802.16网络QoS混合调度算法的端到端时延性能评价","authors":"K. Vinay, N. Sreenivasulu, D. Jayaram, D. Das","doi":"10.1109/WOCN.2006.1666587","DOIUrl":null,"url":null,"abstract":"IEEE 802.16 standard supports real time and non-real time services at each node. However, it has flexibility to develop customized scheduling algorithms according to different priority-based traffic's quality of service (QoS) requirements. Hence, it is imperative to obtain optimum scheduling schemes for different kinds of traffic (i.e., services). Earliest due date (EDD) is one of the highly referred scheduling algorithms for real time communication. In this presentation, our study shows that the proposed hybrid algorithms (EDD along with weighted fair queue (WFQ)) in a node gives better performance for real time services instead of EDD only. Moreover, the results reveal that, scheduling schemes from base station (BS) to subscriber station (SS) like grant per SS (GPSS) impacts less delay than grant per connection (GPC)","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"81","resultStr":"{\"title\":\"Performance evaluation of end-to-end delay by hybrid scheduling algorithm for QoS in IEEE 802.16 network\",\"authors\":\"K. Vinay, N. Sreenivasulu, D. Jayaram, D. Das\",\"doi\":\"10.1109/WOCN.2006.1666587\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IEEE 802.16 standard supports real time and non-real time services at each node. However, it has flexibility to develop customized scheduling algorithms according to different priority-based traffic's quality of service (QoS) requirements. Hence, it is imperative to obtain optimum scheduling schemes for different kinds of traffic (i.e., services). Earliest due date (EDD) is one of the highly referred scheduling algorithms for real time communication. In this presentation, our study shows that the proposed hybrid algorithms (EDD along with weighted fair queue (WFQ)) in a node gives better performance for real time services instead of EDD only. Moreover, the results reveal that, scheduling schemes from base station (BS) to subscriber station (SS) like grant per SS (GPSS) impacts less delay than grant per connection (GPC)\",\"PeriodicalId\":275012,\"journal\":{\"name\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"81\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2006.1666587\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IFIP International Conference on Wireless and Optical Communications Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2006.1666587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 81
摘要
IEEE 802.16标准支持每个节点的实时和非实时业务。但是,它可以灵活地根据不同优先级流量的QoS (quality of service)需求开发自定义调度算法。因此,针对不同类型的流量(即服务)获得最优调度方案势在必行。最早到期日调度算法(EDD)是一种被高度引用的实时通信调度算法。在本报告中,我们的研究表明,在节点中提出的混合算法(EDD和加权公平队列(WFQ))比仅EDD提供更好的实时服务性能。此外,结果表明,从基站(BS)到用户站(SS)的调度方案,如每SS授予(GPSS)对延迟的影响小于每连接授予(GPC)。
Performance evaluation of end-to-end delay by hybrid scheduling algorithm for QoS in IEEE 802.16 network
IEEE 802.16 standard supports real time and non-real time services at each node. However, it has flexibility to develop customized scheduling algorithms according to different priority-based traffic's quality of service (QoS) requirements. Hence, it is imperative to obtain optimum scheduling schemes for different kinds of traffic (i.e., services). Earliest due date (EDD) is one of the highly referred scheduling algorithms for real time communication. In this presentation, our study shows that the proposed hybrid algorithms (EDD along with weighted fair queue (WFQ)) in a node gives better performance for real time services instead of EDD only. Moreover, the results reveal that, scheduling schemes from base station (BS) to subscriber station (SS) like grant per SS (GPSS) impacts less delay than grant per connection (GPC)