Show simple item record

dc.contributor.authorMedard, Muriel
dc.contributor.authorOzdaglar, Asuman E.
dc.contributor.authorChen, Wei
dc.contributor.authorTraskov, Danail
dc.contributor.authorHeindlmaier, Michael
dc.contributor.authorMeyn, Sean P.
dc.date.accessioned2011-01-03T21:45:51Z
dc.date.available2011-01-03T21:45:51Z
dc.date.issued2009-12
dc.date.submitted2009-10
dc.identifier.issn0257-0130
dc.identifier.urihttp://hdl.handle.net/1721.1/60375
dc.description.abstractThe 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant ECS- 0523620)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency. Information Theory for Mobile Ad-Hoc Networks Programen_US
dc.language.isoen_US
dc.publisherSpringer ; Operations Research Society of Americaen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s11134-009-9148-3en_US
dc.rightsAttribution-Noncommercial-Share Alike 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleCoding and Control for Communication Networksen_US
dc.typeArticleen_US
dc.identifier.citationChen, Wei et al. “Coding and control for communication networks.” Queueing Systems 63.1 (2009): 195-216. © 2009, Springer Science + Business Mediaen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Research Laboratory of Electronicsen_US
dc.contributor.approverMedard, Muriel
dc.contributor.mitauthorMedard, Muriel
dc.contributor.mitauthorOzdaglar, Asuman E.
dc.relation.journalQueuing systemsen_US
dc.eprint.versionAuthor's final manuscript
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsChen, Wei; Traskov, Danail; Heindlmaier, Michael; Médard, Muriel; Meyn, Sean; Ozdaglar, Asumanen
dc.identifier.orcidhttps://orcid.org/0000-0002-1827-1285
dc.identifier.orcidhttps://orcid.org/0000-0003-4059-407X
dspace.mitauthor.errortrue
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record