TY - JOUR
T1 - Object-based multimedia scheduling based on bipartite graphs
AU - Sun, Huey Min
AU - Chen, Chia Mei
AU - Shu, Lihchyun
PY - 2005/1
Y1 - 2005/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=27544445361&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27544445361&partnerID=8YFLogxK
U2 - 10.1093/ietcom/E88-B.1.372
DO - 10.1093/ietcom/E88-B.1.372
M3 - Article
AN - SCOPUS:27544445361
SN - 0916-8516
VL - E88-B
SP - 372
EP - 383
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
IS - 1
ER -