Size-Based Resource Scheduling for Wireless Message Transport

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents several 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.

• 社団法人電子情報通信学会の論文
• 1997-03-25

著者

• Inoue Masugi

  The Faculty Of Engineering The University Of Tokyo

• MORIKAWA Hiroyuki

  the Faculty of Engineering, The University of Tokyo

• MIZUMACHI Moriyuki

  the Faculty of Engineering, The University of Tokyo

• Mizumachi Moriyuki

  The Faculty Of Engineering The University Of Tokyo

• Morikawa Hiroyuki

  The Faculty Of Engineering The University Of Tokyo

関連論文

• Size-Based Resource Scheduling for Wireless Message Transport
• Periodic Reservation for Mobile Satellite Position Reporting Services (Special Issue on Advances in Satellite Communications toward Multimedia Era)

スポンサーリンク