M. Andreozzi, G. Stea, Andrea Bacioccola, Roberto Rossi
{"title":"Flexible scheduling for Real-Time services in High-Speed Packet Access cellular networks","authors":"M. Andreozzi, G. Stea, Andrea Bacioccola, Roberto Rossi","doi":"10.1109/EW.2009.5357977","DOIUrl":null,"url":null,"abstract":"This paper presents the HYbrid Channel-Aware and Real-Time scheduler (HY-CART) for UMTS High-Speed Packet Access networks. The latter works for both downlink and uplink scheduling, with slightly different embodiments due to the different technology constraints. Its basic principle is to select users based on their channel conditions when the deadlines are far ahead: as the deadlines approach, they become progressively more important. Furthermore, resources for scheduled users are allocated sparingly, i.e. enough to serve packets whose deadline is actually near, so as to make room for a possibly larger number of simultaneous users, and keeping into account the user channel state. Simulative evaluation shows that HY-CART performs better than the previous work, allowing more users to be served with the same resources.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"20 15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 European Wireless Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EW.2009.5357977","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
This paper presents the HYbrid Channel-Aware and Real-Time scheduler (HY-CART) for UMTS High-Speed Packet Access networks. The latter works for both downlink and uplink scheduling, with slightly different embodiments due to the different technology constraints. Its basic principle is to select users based on their channel conditions when the deadlines are far ahead: as the deadlines approach, they become progressively more important. Furthermore, resources for scheduled users are allocated sparingly, i.e. enough to serve packets whose deadline is actually near, so as to make room for a possibly larger number of simultaneous users, and keeping into account the user channel state. Simulative evaluation shows that HY-CART performs better than the previous work, allowing more users to be served with the same resources.