The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Conventional admission control models incur some performance penalty. First, admission control computation can overload a server that is already heavily loaded. Also, in large-scale media systems with geographically distributed server clusters, performing admission control on each cluster can result in long response latency, if the client request is denied at one site and has to be forwarded to another site. Furthermore, in prefix caching, initial frames cached at the proxy are delivered to the client before the admission decisions are made. If the media server is heavily loaded and, finally, has to deny the client request, forwarding a large number of initial frames is a waste of critical network resources. In this paper, a novel distributed admission control model is presented. We make use of proxy servers to perform the admission control tasks. Each proxy hosts an agent to coordinate the effort. Agents reserve media server's disk bandwidth and make admission decisions autonomously based on the allocated disk bandwidth. We develop an effective game theoretic framework to achieve fairness in the bandwidth allocation among the agents. To improve the overall bandwidth utilization, we also consider an aggressive admission control policy where each agent may admit more requests than its allocated bandwidth allows. The distributed admission control approach provides the solution to the stated problems incurred in conventional admission control models. Experimental studies show that our algorithms significantly reduce the response latency and the media server load.</p>
Distributed admission control, disk bandwidth, game theory, quality of service.

P. Li, W. Hao, I. Yen and Z. Xia, "A Distributed Admission Control Model for QoS Assurance in Large-Scale Media Delivery Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 16, no. , pp. 1143-1153, 2005.
92 ms
(Ver 3.3 (11022016))