Object-Based Multimedia Scheduling Based on Bipartite Graphs

Huey-Min SUN
Chia-Mei CHEN
LihChyun SHU

Publication
IEICE TRANSACTIONS on Communications   Vol.E88-B    No.1    pp.372-383
Publication Date: 2005/01/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.1.372
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Multimedia Systems for Communications" Multimedia Systems for Communications
Keyword: 
scheduling,  imprecise computation,  object-based multimedia,  delay,  drop,  quality-of-service (QoS),  optimization,  bipartite matching,  

Full Text: PDF(818.5KB)>>
Buy this Article


Summary: 
In this study, we propose an object-based multimedia model for specifying the QoS (quality of service) requirements, such as the maximum data-dropping rate or the maximum data-delay rate. We also present a resource allocation model, called the net-profit model, in which the satisfaction of user's QoS requirements is measured by the benefit earned by the system. Based on the net-profit model, the system is rewarded if it can allocate enough resources to a multimedia delivery request and fulfill the QoS requirements specified by the user. At the same time, the system is penalized if it cannot allocate enough resources to a multimedia delivery request. We first investigate the problem of how to allocate resources efficiently, so that the QoS satisfaction is maximized. However, the net-profit may be distributed unevenly among the multimedia delivery requests. Thus, the second problem discusses how to allocate the resource efficiently so that the net-profit difference is minimized between any two multimedia requests. A dynamic programming based algorithm is proposed to find such an optimal solution with the minimum net-profit differences.