Title :
A theoretical framework for developing distributed admissions control over delay-sensitive media flows
Author_Institution :
Comput. Sci. Dept., Univ. of North Dakota, Grand Forks, ND, USA
Abstract :
The performance of most real-time streaming media applications is sensitive to transmission delays. This paper describes a distributed admissions control method to ensure the required sending rates for the real-time media streams. A utility function is first developed to model the satisfaction of delay sensitive media streams. Then, the optimal admissions control on streams are formulated into a social optimum oriented network utility maximization (NUM) problem. The existence of an optimal solution to the NUM problem has been demonstrated through constructing a centralized algorithm for the determining the admissions for all streams. The centralized algorithm provides insights to find the optimal solution through a distributed algorithm. A distributed admissions control method can be developed based on the dual decomposition of the primal problem. The construction of this distributed admissions control method follows the DiffServ approach.
Keywords :
media streaming; telecommunication congestion control; centralized algorithm; delay-sensitive media flows; distributed admissions control; optimal admissions control; real-time streaming media applications; social optimum oriented network utility maximization problem; theoretical framework; transmission delays; utility function; Admission control; Approximation methods; Bismuth; Delay; Mathematical model; Media; Real time systems; Delay-Sensitive Media Streams; Distributed Admissions Control; Network Utility Maximization; Pricing Schemes;
Conference_Titel :
Quality of Service (IWQoS), 2011 IEEE 19th International Workshop on
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4577-0104-7
Electronic_ISBN :
1548-615X
DOI :
10.1109/IWQOS.2011.5931317