Optimal throughput allocation in general random-access networks

Piyush Gupta, Alexander L. Stolyar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider a model for random-access communication in networks of arbitrary topology. We characterize the efficient (Pareto) boundary of the network throughput region as the family of solutions optimizing weighted proportional fairness objective, parameterized by link weights. Based on this characterization we propose a general distributed scheme that uses dynamic link weights to "move" the link-throughput allocation within the Pareto boundary to a desired point optimizing a specific objective. As a specific application of the general scheme, we propose an algorithm seeking to optimize weighted proportional fairness objective subject to minimum link-throughput constraints. We study asymptotic behavior of the algorithm and show that link throughputs converge to optimal values as long as link dynamic weights converge. Finally, we present simulation experiments that show good performance of the algorithm.

Original languageEnglish (US)
Title of host publication2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1254-1259
Number of pages6
ISBN (Print)1424403502, 9781424403509
DOIs
StatePublished - 2006
Externally publishedYes
Event2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States
Duration: Mar 22 2006Mar 24 2006

Publication series

Name2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Other

Other2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
Country/TerritoryUnited States
CityPrinceton, NJ
Period3/22/063/24/06

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Optimal throughput allocation in general random-access networks'. Together they form a unique fingerprint.

Cite this