Title :
Predictive Scheduling in Drive-Thru Networks with Flow-Level Dynamics and Deadlines
Author :
Yang, Shengbo ; Yeo, Chai Kiat ; Lee, Bu Sung
Author_Institution :
Centre for Multimedia & Network Technol., Nanyang Technol. Univ., Singapore, Singapore
Abstract :
This paper addresses the downlink scheduling issue in drive-thru networks which is characterized by flow-level dynamics and user basis deadlines. Vehicular users requesting for data download service with variable file sizes regularly arrive at and depart from the limited coverage range of roadside access point. If the corresponding data queue at the access point cannot be serviced in a certain time period, it has to be cleared, resulting in degraded QoS. To minimize the number of uncompleted file download jobs in the face of multiple-user contention, a Dynamic Predictive Scheduling (DPS) algorithm is proposed. Based on the prediction of the remaining bandwidth of the different users, a scheduling tree is constructed to facilitate the selection of the data queue to serve at particular time slots. Through extensive simulation, it is shown that DPS consistently outperforms competitive scheduling schemes under varying workloads.
Keywords :
multi-access systems; quality of service; queueing theory; radio access networks; scheduling; trees (mathematics); DPS algorithm; competitive scheduling schemes; data download service; data queue; degraded QoS; downlink scheduling; drive-thru networks; dynamic predictive scheduling algorithm; flow-level deadlines; flow-level dynamics; limited coverage range; multiple-user contention; roadside access point; scheduling tree; uncompleted file download jobs; user basis deadlines; variable file sizes; vehicular users; Dynamic scheduling; Heuristic algorithms; Indexes; Vehicle dynamics; Vehicles;
Conference_Titel :
Communications (ICC), 2011 IEEE International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-61284-232-5
Electronic_ISBN :
1550-3607
DOI :
10.1109/icc.2011.5963358