Coding and Control for Communication Networks
Name
Medard_Coding and.pdf
Size
840.22 KB
Format
Adobe PDF
Checksum (MD5)
7b7a1c92e069b368940ccaab88871a72
Author(s)
Medard, Muriel
Ozdaglar, Asuman E.
Chen, Wei
Traskov, Danail
Heindlmaier, Michael
Meyn, Sean P.
Date Issued
December 2009
Journal
Queuing systems
Publisher
Springer ; Operations Research Society of America
Citation
Chen, Wei et al. “Coding and control for communication networks.” Queueing Systems 63.1 (2009): 195-216. © 2009, Springer Science + Business Media
Version
Author's final manuscript
Abstract
The purpose of this paper is to survey techniques for constructing effective policies for controlling complex networks, and to extend these techniques to capture special features of wireless communication networks under different networking scenarios. Among the key questions addressed are:
(i) The relationship between static network equilibria, and dynamic network control.
(ii) The effect of coding on control and delay through rate regions.
(iii) Routing, scheduling, and admission control.
Through several examples, ranging from multiple-access systems to network coded multicast, we demonstrate that the rate region for a coded communication network may be approximated by a simple polyhedral subset of a Euclidean space. The polyhedral structure of the rate region, determined by the coding, enables a powerful workload relaxation method that is used for addressing complexity—the relaxation technique provides approximations of a highly complex network by a far simpler one.
These approximations are the basis of a specific formulation of an h-MaxWeight policy for network routing. Simulations show a 50% improvement in average delay performance as compared to methods used in current practice.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11134-009-9148-3
