Paper Info
Title
Scheduling algorithm with delay-limited for VoIP in LTE.
Abstract
The long term evolution (LTE) is a breakthrough technology with respect to the previous generation of cellular networks, as it is based on an all-IP architecture that aims at supporting several high quality services, such as video streaming, voice-over-internet-protocol (VoIP) and everything related to the wideband Internet access. In the recent years, VOIP service is becoming more and more popular and important, while the tight delay requirements and the scarcity of radio resources problem remain the main challenges for it. To solve these problems, we construct a mathematical model and design a novel algorithm for the scheduling problem of VOIP. Limiting the delay, our algorithm solve the scarcity of radio resources problem by minimizing the total number of radio resources scheduled during a certain period of time, which can ensure the quality-of-experience (QOE) of user equipment (UE) and high resource utilization rate. Moreover, the maximum delay of a UE with a certain average transmitting rate is determined theoretically. Finally, we give simulation results of our scheduling algorithm and the comparison with the modified largest weighted delay first (MLWDF) and the exponential/proportional fair (EXP/PF) algorithms, by which we demonstrate the effectiveness of our algorithm on delay and resource utilization.
Year
Venue
Keywords
2015
Asia-Pacific Signal and Information Processing Association Annual Summit and Conference
delay-limited,radio resource,scheduling,VoIP,LTE
Field
DocType
ISSN
Job shop scheduling,Algorithm design,Fair-share scheduling,Scheduling (computing),Computer science,Computer network,Rate-monotonic scheduling,Dynamic priority scheduling,Proportionally fair,Round-robin scheduling,Distributed computing
Conference
2309-9402
Citations 
PageRank 
References 
0
0.34
10
Authors
4
Name
Order
Citations
PageRank
Juan Chen110.80
Wenguo Yang264.20
Suixiang Gao34412.48
Lei Zhou400.34