TY - JOUR
T1 - On distributed multimedia scheduling with constrained control channels
AU - Zhou, Liang
AU - Chen, Hsiao Hwa
N1 - Funding Information:
Manuscript received December 12, 2010; revised May 02, 2011; accepted June 19, 2011. Date of publication June 27, 2011; date of current version September 16, 2011. This work was supported in part by a Taiwan National Science Council Grant (No. NSC99-2221-E-006-016-MY3). The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Jiangchuan (JC) Liu.
PY - 2011/10
Y1 - 2011/10
N2 - Traditional multimedia scheduling approaches assumed perfect control channels where each node has access to the knowledge of its neighbors. However, in practice the control channels are always constrained and nodes can only exchange limited information with their neighbors. In this paper, we investigate how imperfect neighbor information affects the multimedia scheduling. First, we formulate the optimal multimedia scheduling problem with the constraints on network information. Specifically, a constrained factor is introduced to capture the profile of control channels. Then, we consider two cases of the constrained factor distribution: 1) the class with finite mean and variance, and 2) a general class that does not employ any parametric representation. In each case, we investigate the relationship between the control gain and scheduling performance based on available network and multimedia information. We show that the control gain can be chosen properly such that the optimal distributed multimedia scheduling can be achieved with an exponential convergence rate. In addition, an explicit equation for asymptotic convergence rate is derived for each case. Finally, we use computer simulations to verify the analytical results.
AB - Traditional multimedia scheduling approaches assumed perfect control channels where each node has access to the knowledge of its neighbors. However, in practice the control channels are always constrained and nodes can only exchange limited information with their neighbors. In this paper, we investigate how imperfect neighbor information affects the multimedia scheduling. First, we formulate the optimal multimedia scheduling problem with the constraints on network information. Specifically, a constrained factor is introduced to capture the profile of control channels. Then, we consider two cases of the constrained factor distribution: 1) the class with finite mean and variance, and 2) a general class that does not employ any parametric representation. In each case, we investigate the relationship between the control gain and scheduling performance based on available network and multimedia information. We show that the control gain can be chosen properly such that the optimal distributed multimedia scheduling can be achieved with an exponential convergence rate. In addition, an explicit equation for asymptotic convergence rate is derived for each case. Finally, we use computer simulations to verify the analytical results.
UR - http://www.scopus.com/inward/record.url?scp=80052930731&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052930731&partnerID=8YFLogxK
U2 - 10.1109/TMM.2011.2160716
DO - 10.1109/TMM.2011.2160716
M3 - Article
AN - SCOPUS:80052930731
VL - 13
SP - 1040
EP - 1051
JO - IEEE Transactions on Multimedia
JF - IEEE Transactions on Multimedia
SN - 1520-9210
IS - 5
M1 - 5934416
ER -