Alpcan, Tansu and Dey, Subhrakanti (2013) An information-theoretic analysis of distributed resource allocation. In: 52nd IEEE Conference on Decision and Control. IEEE, pp. 7327-7332. ISBN 9781467357142

Preview

Download (237kB) | Preview

Abstract

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.

Item Type:	Book Section
Additional Information:	Cite as: T. Alpcan and S. Dey, "An information-theoretic analysis of distributed resource allocation," 52nd IEEE Conference on Decision and Control, 2013, pp. 7327-7332, doi: 10.1109/CDC.2013.6761052.
Keywords:	information; theoretic analysis; distributed; resource allocation;
Academic Unit:	Faculty of Science and Engineering > Electronic Engineering Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	14502
Identification Number:	https://doi.org/10.1109/CDC.2013.6761052
Depositing User:	Subhrakanti Dey
Date Deposited:	03 Jun 2021 14:35
Publisher:	IEEE
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads