Size-Based Resource Scheduling for Wireless Message Transport

Masugi INOUE  Hiroyuki MORIKAWA  Moriyuki MIZUMACHI  

IEICE TRANSACTIONS on Communications   Vol.E80-B   No.3   pp.466-475
Publication Date: 1997/03/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Signaling System and Communication Protocol
wireless access,  multimedia transport,  best-effort service,  resource allocation,  message traffic,  

Full Text: PDF>>
Buy this Article

This paper presents severl radio resource scheduling algorithms which aim to provide best-effort service for non-real-time unit-oriented, or message traffic. The objective of resource scheduling algorithm is to distribute radio resources between competing message traffic sources while attaining throughput as high and fair as possible for each source without any explicit quality-of-service (QoS) guarantee. Computer simulations are carried out to evaluate the performance in terms of the average of allocation plus transfer delay, the average of throughput, the variance of throughput, and the usage of resources. The message-size distributions of homepages in World-Wide-Web and e-mails obtained by actual measurement are used. Message size-based resource scheduling algorithms are found to provide high and fair throughput as well as efficient use of the resources.