Equalizing throughputs in random-access networks

P.M. Ven, van de, S.C. Borst, T.J.J. Denteneer, A.J.E.M. Janssen, J.S.H. Leeuwaarden, van

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review


Random-access algorithms such as CSMA provide a popular mechanism for distributed medium access control in largescale wireless networks. In recent years, tractable models have been shown to yield accurate throughput estimates for CSMA networks. We consider the saturated model on a general conflict graph, and prove that for each graph, there exists a vector of activation rates (or mean back-off times) that leads to equal throughputs for all users. We describe an algorithm for computing such activation rates, and discuss a few specific conflict graphs that allow for explicit characterization of these fair activation rates. Keywords: CSMA, fixed point, global invertibility, loss networks, Markov processes, random access, throughput, wireless networks
Originele taal-2Engels
Titel12th Workshop on Mathematical Performance Modeling and Analysis (MAMA 2010, New York NY, USA, June 18, 2010; in conjunction with SIGMETRICS 2010)
StatusGepubliceerd - 2010

Publicatie series

NaamACM SIGMETRICS Performance Evaluation Review
ISSN van geprinte versie0163-5999


Duik in de onderzoeksthema's van 'Equalizing throughputs in random-access networks'. Samen vormen ze een unieke vingerafdruk.

Citeer dit