A theoretical framework for developing distributed admissions control over delay-sensitive media flows

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.

[1]  Stephen B. Wicker,et al.  Game theory in communications: motivation, explanation, and application to power control , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[2]  A. Ozdaglar,et al.  Min Common/Max Crossing Duality: A Simple Geometric Framework for Convex Optimization and Minimax Theory1 , 2003 .

[3]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[4]  Edward W. Knightly,et al.  Scalable Services via Egress Admission Control , 2001, IEEE Trans. Multim..

[5]  T. Başar,et al.  A HIERARCHICAL NETWORK GAME WITH A LARGE NUMBER OF PLAYERS , 2002 .

[6]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[7]  R. Srikant,et al.  Revenue-maximizing pricing and capacity expansion in a many-users regime , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Ness B. Shroff,et al.  A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks , 1998, TNET.

[9]  Dan Keun Sung,et al.  Measurement-Based Admission Control at Edge Routers , 2008, IEEE/ACM Transactions on Networking.

[10]  Dan Keun Sung,et al.  Measurement-based admission control at edge routers , 2008, TNET.

[11]  S. Lasaulce,et al.  Methodologies for analyzing equilibria in wireless games , 2009, IEEE Signal Process. Mag..

[12]  D. Goodman,et al.  A New Framework for Power Control in Wireless Data Networks: Games, Utility, and Pricing , 2002 .

[13]  R. Srikant,et al.  Network Optimization and Control , 2008, Found. Trends Netw..

[14]  Debasis Mitra,et al.  A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node , 1995, IEEE J. Sel. Areas Commun..

[15]  Lacra Pavel,et al.  An extension of duality to a game-theoretic framework , 2007, Autom..

[16]  Scott Shenker,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.

[17]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[18]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[19]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[20]  Ness B. Shroff,et al.  An approximation of the end-to-end delay distribution , 2003, IWQoS'03.

[21]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated service packet networks , 1997, TNET.

[22]  Costas Courcoubetis,et al.  Pricing Communication Networks , 2003 .

[23]  Dan Keun Sung,et al.  Effective bandwidth for a single server queueing system with fractional Brownian input , 2005, Perform. Evaluation.

[24]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[25]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[26]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

[27]  Tansu Alpcan,et al.  Nash equilibrium design and optimization , 2009, 2009 International Conference on Game Theory for Networks.

[28]  Shengyu Zhang,et al.  Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[29]  T. Basar,et al.  A game-theoretic framework for congestion control in general topology networks , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[30]  David Tse,et al.  A framework for robust measurement-based admission control , 1999, TNET.