By Topic

Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Koto, H. ; KDD Kamifukuoka R&D Labs., Saitama, Japan ; Fukushima, M. ; Nomoto, S. ; Takahata, F.

The demand for high-speed data communication and the use of real-time applications in mobile networks is becoming increasingly high and communication systems that specialise in downlink packet transfer are being developed and deployed. In these high-speed downlink packet networks, scheduling at the base station is one of the key technologies to accomplish such high speed. A scheduling algorithm that is based on the proportional fair criterion is widely used in commercial networks, but the problem with such an algorithm is that it does not schedule real-time application traffic efficiently. This paper proposes a new scheduling algorithm for real-time applications that does not need substantial change in the existing system and coexists efficiently with the proportional fair criterion. We evaluate the characteristics of the proposed algorithm through computer simulation and show that the efficiency of the proposed algorithm is better than that of existing algorithms.

Published in:

Wireless Communications and Networking Conference, 2005 IEEE  (Volume:1 )

Date of Conference:

13-17 March 2005