Scheduling and policing in GPRS based on the minimum laxity threshold algorithm

Yang Hao; Chun-Pin Hou

doi:10.1117/12.561187

19 March 2004 Scheduling and policing in GPRS based on the minimum laxity threshold algorithm

Yang Hao, Chun-Pin Hou

Proceedings Volume 5444, Fourth International Conference on Virtual Reality and Its Applications in Industry; (2004) https://doi.org/10.1117/12.561187
Event: Fourth International Conference On Virtual Reality and Its Applications in Industry, 2003, Tianjin, China

Abstract

The General Packet Radio Service is a packet data service for phase 2+ of Global System for Mobile Communications (GSM). It not only defines the packet-switched data service, but also tries to provide quality of service (QOS) guarantees on data flows. Scheduling is an important aspect in supporting of QOS and GPRS. In this paper, two scheduling algorithms, the Modified Earliest Deadline (MED) and Minimum Laxity threshold (MLT), have been elaborated. Both scheduling algorithms allow GPRS to attain high channel utilization, with MTL performing better than MED.

Citation Download Citation

Yang Hao and Chun-Pin Hou "Scheduling and policing in GPRS based on the minimum laxity threshold algorithm", Proc. SPIE 5444, Fourth International Conference on Virtual Reality and Its Applications in Industry, (19 March 2004); https://doi.org/10.1117/12.561187

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available