An information-theoretic analysis of distributed resource allocation

Solving a resource allocation problem in a distributed way requires communication between the system and its users. This information exchange is, however, limited by communication constraints, delays, and distortions in most practical problems. This paper presents a quantitative analysis of information (flow) in a well-known distributed resource allocation algorithm using concepts from Shannon information theory. For this purpose, an entropy-based measure is adopted to quantify information which is defined as uncertainty reduction. Then, information flow in a certain class of iterative algorithms is studied. The relationships between the rate and total amount of information exchanged, and convergence of the algorithm are investigated under certain assumptions. The concepts introduced and the obtained results are illustrated using numerical examples.

[1]  Robin J. Evans,et al.  Feedback Control Under Data Rate Constraints: An Overview , 2007, Proceedings of the IEEE.

[2]  Zhu Han,et al.  Game Theory in Wireless and Communication Networks , 2008 .

[3]  Michael L. Honig,et al.  Distributed interference compensation for wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[4]  John N. Tsitsiklis,et al.  Efficiency of Scalar-Parameterized Mechanisms , 2008, Oper. Res..

[5]  Munther A. Dahleh,et al.  Feedback Control in the Presence of Noisy Channels: “Bode-Like” Fundamental Limitations of Performance , 2008, IEEE Transactions on Automatic Control.

[6]  M. Safari Price of Anarchy ⋆ , 2005 .

[7]  Andrey V. Savkin,et al.  An Analogue of Shannon Information Theory for Detection and Stabilization via Noisy Discrete Communication Channels , 2007, SIAM J. Control. Optim..

[8]  E. Maskin Nash Equilibrium and Welfare Optimality , 1999 .

[9]  Stephen P. Boyd,et al.  Notes on Decomposition Methods , 2008 .

[10]  Tansu Alpcan,et al.  A control theoretic approach to noncooperative game design , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  Victor Solo,et al.  Stabilization and Disturbance Attenuation Over a Gaussian Communication Channel , 2010, IEEE Transactions on Automatic Control.

[12]  Robin J. Evans,et al.  Stabilizability of Stochastic Linear Systems with Finite Feedback Data Rates , 2004, SIAM J. Control. Optim..

[13]  Dusit Niyato,et al.  Game Theory in Wireless and Communication Networks: Fundamentals of game theory , 2011 .

[14]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[15]  Derong Liu The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[16]  Bruce E. Hajek,et al.  VCG-Kelly Mechanisms for Allocation of Divisible Goods: Adapting VCG Mechanisms to One-Dimensional Signals , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[17]  Shinji Hara,et al.  Achievable sensitivity bounds for MIMO control systems via an information theoretic approach , 2011, Syst. Control. Lett..

[18]  Tansu Alpcan,et al.  A utility-based congestion control scheme for Internet-style networks with delay , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Lachlan L. H. Andrew,et al.  Adaptive Deterministic Packet Marking , 2006, IEEE Communications Letters.

[20]  Tansu Alpcan,et al.  A globally stable adaptive congestion control scheme for Internet-style networks with delay , 2005, IEEE/ACM Transactions on Networking.

[21]  Walid Saad,et al.  Game Theory in Wireless and Communication Networks: Applications of game theory in communications and networking , 2011 .

[22]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

[23]  Walid Saad,et al.  Game-Theoretic Methods for the Smart Grid: An Overview of Microgrid Systems, Demand-Side Management, and Smart Grid Communications , 2012, IEEE Signal Processing Magazine.

[24]  Richard H. Middleton,et al.  Minimum Variance Control Over a Gaussian Communication Channel , 2008, IEEE Transactions on Automatic Control.

[25]  Sekhar Tatikonda,et al.  Stochastic linear control over a communication channel , 2004, IEEE Transactions on Automatic Control.

[26]  Anant Sahai,et al.  The Necessity and Sufficiency of Anytime Capacity for Stabilization of a Linear System Over a Noisy Communication Link—Part I: Scalar Systems , 2006, IEEE Transactions on Information Theory.

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

[28]  Tansu Alpcan,et al.  A framework for optimization under limited information , 2011, Journal of Global Optimization.

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

[30]  Tansu Alpcan A Decision and Game Theoretic Approach to Networked System Security with Applications to Power Grid (Invited Lecture) , 2013, AISC.

[31]  TANSU ALPCAN,et al.  A Risk-Based Approach to Optimisation under Limited Information , 2012 .

[32]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[33]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.