{"title":"无线蜂窝网络的端到端调度研究","authors":"W. Saad, Z. Dawy, S. Sharafeddine","doi":"10.1109/ISSSTA.2008.99","DOIUrl":null,"url":null,"abstract":"Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.","PeriodicalId":334589,"journal":{"name":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On End-to-End Scheduling in Wireless Cellular Networks\",\"authors\":\"W. Saad, Z. Dawy, S. Sharafeddine\",\"doi\":\"10.1109/ISSSTA.2008.99\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.\",\"PeriodicalId\":334589,\"journal\":{\"name\":\"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSSTA.2008.99\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.2008.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On End-to-End Scheduling in Wireless Cellular Networks
Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services that require end-to-end guarantees. Unlike existing literature that mainly focuses on downlink only or uplink only scheduling algorithms, the proposed algorithm aims at ensuring an end-to-end utility value reflecting end-to-end QoS in terms of delay and channel quality. By jointly considering the time varying channel conditions in both uplink and downlink directions, the proposed end-to-end scheduling algorithm achieves an increased number of active connections and a lower packet drop in comparison to other schemes. These gains are achieved with a tradeoff cost in terms of complexity and signaling overhead. For overhead reduction, we propose an implementation over clusters within the network.