For multimedia transport over the shared radio channel, best-effort service for non-real-time unit-oriented traffic would be necessary as well as a guaranteed service for real-time rate oriented traffic. This paper presents resource allocation algorithms to provide best-effort service for message traffic, whose characteristics is non-real-time and bursty. The objective of resource allocation algorithms is to utilize the shared radio resources among the message traffic for high and fair provision of throughput and efficient use of the resources without any QoS guarantee. Simulation results show that exploiting the information on the message size in the resource allocation stage brings a good improvement in the throughput performance.
展开▼
