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

Hideyuki Koto; Masaki Fukushima; Shinichi Nomoto; Fumio Takahata

doi:10.1109/WCNC.2005.1424491

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

Hideyuki Koto^*, Masaki Fukushima, Shinichi Nomoto, Fumio Takahata

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

The demand for high-speed data communication and the use of real-time applications in mobile networks are becoming increasingly high, and communication systems that specialize 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 algorithm is that it does not schedule real-time application's 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.

Original language	English
Title of host publication	IEEE Wireless Communications and Networking Conference, WCNC
Pages	151-157
Number of pages	7
Volume	1
DOIs	https://doi.org/10.1109/WCNC.2005.1424491
Publication status	Published - 2005
Event	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off - New Orleans, LA Duration: 2005 Mar 13 → 2005 Mar 17

Other

Other	2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off
City	New Orleans, LA
Period	05/3/13 → 05/3/17

Keywords

1x EV-DO
Buffer Backlog
Mobile Packet Netowrks
Real-Time Application
Scheduling

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/WCNC.2005.1424491

Cite this

Koto, H, Fukushima, M, Nomoto, S & Takahata, F 2005, Scheduling algorithm based on sender buffer backlog for real-time application in mobile packet networks. in IEEE Wireless Communications and Networking Conference, WCNC. vol. 1, PHY07-4, pp. 151-157, 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off, New Orleans, LA, 05/3/13. https://doi.org/10.1109/WCNC.2005.1424491

@inproceedings{1f82cb4cb3984ac5bb510b1906be379a,

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

abstract = "The demand for high-speed data communication and the use of real-time applications in mobile networks are becoming increasingly high, and communication systems that specialize 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 algorithm is that it does not schedule real-time application's 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.",

keywords = "1x EV-DO, Buffer Backlog, Mobile Packet Netowrks, Real-Time Application, Scheduling",

author = "Hideyuki Koto and Masaki Fukushima and Shinichi Nomoto and Fumio Takahata",

year = "2005",

doi = "10.1109/WCNC.2005.1424491",

language = "English",

isbn = "0780389662",

volume = "1",

pages = "151--157",

booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

note = "2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off ; Conference date: 13-03-2005 Through 17-03-2005",

}

TY - GEN

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

AU - Koto, Hideyuki

AU - Fukushima, Masaki

AU - Nomoto, Shinichi

AU - Takahata, Fumio

PY - 2005

Y1 - 2005

N2 - The demand for high-speed data communication and the use of real-time applications in mobile networks are becoming increasingly high, and communication systems that specialize 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 algorithm is that it does not schedule real-time application's 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.

AB - The demand for high-speed data communication and the use of real-time applications in mobile networks are becoming increasingly high, and communication systems that specialize 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 algorithm is that it does not schedule real-time application's 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.

KW - 1x EV-DO

KW - Buffer Backlog

KW - Mobile Packet Netowrks

KW - Real-Time Application

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=24944577177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944577177&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2005.1424491

DO - 10.1109/WCNC.2005.1424491

M3 - Conference contribution

AN - SCOPUS:24944577177

SN - 0780389662

VL - 1

SP - 151

EP - 157

BT - IEEE Wireless Communications and Networking Conference, WCNC

T2 - 2005 IEEE Wireless Communications and Networking Conference, WCNC 2005: Broadband Wirelss for the Masses - Ready for Take-off

Y2 - 13 March 2005 through 17 March 2005

ER -

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

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this