A Distributed Algorithm for Resource Allocation for Delay Sensitive Services

In this paper, we present a distributed algorithm that dynamically allocates the available resources of a service-oriented network to delay sensitive network services. Our algorithm is based on Gauss-Seidel type iterations. Thus, each node depends on its local information and sends/receives a small number of messages, until convergence is achieved. We use a utility-based framework to differentiate services based on both their relative profitability and quality-of-service requirements. Our performance metric is a network calculus driven, end-to-end delay that a service class experiences in the network. Finally, we evaluate the performance of our system under various scenarios, including an analysis with real instant messaging network traces.

[1]  A. Robert Calderbank,et al.  Congestion Control in Networks with Delay Sensitive Traffic , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[2]  Ness B. Shroff,et al.  Opportunistic power scheduling for dynamic multi-server wireless systems , 2006, IEEE Transactions on Wireless Communications.

[3]  G. Michailidis,et al.  Pricing and Measurement-based Optimal Resource Allocation in Next Generation Network Services , 2007, 2007 IEEE Globecom Workshops.

[4]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[5]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[6]  John N. Tsitsiklis,et al.  Some aspects of parallel and distributed iterative algorithms - A survey, , 1991, Autom..

[7]  James M. Lucas,et al.  Exponentially weighted moving average control schemes: Properties and enhancements , 1990 .

[8]  Shaler Stidham,et al.  Pricing and congestion management in a network with heterogeneous users , 2004, IEEE Transactions on Automatic Control.

[9]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[10]  Ness B. Shroff,et al.  Downlink power allocation for multi-class wireless systems , 2005, IEEE/ACM Transactions on Networking.

[11]  Ness B. Shroff,et al.  Opportunistic power scheduling for multi-server wireless systems with minimum performance constraints , 2004, IEEE INFOCOM 2004.

[12]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[13]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[14]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

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

[16]  Michael Devetsikiotis,et al.  Challenges in Service-Oriented Networking. , 2006 .

[17]  Michael Devetsikiotis,et al.  Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks , 2006, Telecommun. Syst..

[18]  Jun Luo,et al.  On the Performance of Primal/Dual Schemes for Congestion Control in Networks with Dynamic Flows , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  Michael Devetsikiotis,et al.  Distributed and Dynamic Resource Allocation for Delay Sensitive Network Services , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[20]  Ness B. Shroff,et al.  Optimal resource allocation in multi-class networks with user-specified utility functions , 2002, Comput. Networks.

[21]  A. Robert Calderbank,et al.  Utility-optimal random-access control , 2007, IEEE Transactions on Wireless Communications.