Coding and Control for Communication Networks
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) Th...
Main Authors: | , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Springer ; Operations Research Society of America
2011
|
Online Access: | http://hdl.handle.net/1721.1/60375 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X |
_version_ | 1826215093808922624 |
---|---|
author | Medard, Muriel Ozdaglar, Asuman E. Chen, Wei Traskov, Danail Heindlmaier, Michael Meyn, Sean P. |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Medard, Muriel Ozdaglar, Asuman E. Chen, Wei Traskov, Danail Heindlmaier, Michael Meyn, Sean P. |
author_sort | Medard, Muriel |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T16:16:47Z |
format | Article |
id | mit-1721.1/60375 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T16:16:47Z |
publishDate | 2011 |
publisher | Springer ; Operations Research Society of America |
record_format | dspace |
spelling | mit-1721.1/603752022-10-02T07:29:26Z Coding and Control for Communication Networks Medard, Muriel Ozdaglar, Asuman E. Chen, Wei Traskov, Danail Heindlmaier, Michael Meyn, Sean P. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Research Laboratory of Electronics Medard, Muriel Medard, Muriel Ozdaglar, Asuman E. 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. National Science Foundation (U.S.) (Grant ECS- 0523620) United States. Defense Advanced Research Projects Agency. Information Theory for Mobile Ad-Hoc Networks Program 2011-01-03T21:45:51Z 2011-01-03T21:45:51Z 2009-12 2009-10 Article http://purl.org/eprint/type/JournalArticle 0257-0130 http://hdl.handle.net/1721.1/60375 Chen, Wei et al. “Coding and control for communication networks.” Queueing Systems 63.1 (2009): 195-216. © 2009, Springer Science + Business Media https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1007/s11134-009-9148-3 Queuing systems Attribution-Noncommercial-Share Alike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Springer ; Operations Research Society of America MIT web domain |
spellingShingle | Medard, Muriel Ozdaglar, Asuman E. Chen, Wei Traskov, Danail Heindlmaier, Michael Meyn, Sean P. Coding and Control for Communication Networks |
title | Coding and Control for Communication Networks |
title_full | Coding and Control for Communication Networks |
title_fullStr | Coding and Control for Communication Networks |
title_full_unstemmed | Coding and Control for Communication Networks |
title_short | Coding and Control for Communication Networks |
title_sort | coding and control for communication networks |
url | http://hdl.handle.net/1721.1/60375 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X |
work_keys_str_mv | AT medardmuriel codingandcontrolforcommunicationnetworks AT ozdaglarasumane codingandcontrolforcommunicationnetworks AT chenwei codingandcontrolforcommunicationnetworks AT traskovdanail codingandcontrolforcommunicationnetworks AT heindlmaiermichael codingandcontrolforcommunicationnetworks AT meynseanp codingandcontrolforcommunicationnetworks |