TY - GEN
T1 - Equalizing throughputs in random-access networks
AU - Ven, van de, P.M.
AU - Borst, S.C.
AU - Denteneer, T.J.J.
AU - Janssen, A.J.E.M.
AU - Leeuwaarden, van, J.S.H.
PY - 2010
Y1 - 2010
N2 - 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
AB - 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
U2 - 10.1145/1870178.1870192
DO - 10.1145/1870178.1870192
M3 - Conference contribution
T3 - ACM SIGMETRICS Performance Evaluation Review
SP - 39
EP - 41
BT - 12th Workshop on Mathematical Performance Modeling and Analysis (MAMA 2010, New York NY, USA, June 18, 2010; in conjunction with SIGMETRICS 2010)
ER -