Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput

Libin Jiang and Jean Walrand

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2009-43
March 28, 2009

http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-43.pdf

Designing efficient scheduling algorithms is an important problem in a general class of networks with resource-sharing constraints, such as wireless networks and stochastic processing networks. In [4], we proposed a distributed scheduling algorithm that can achieve the maximal throughput in such networks under certain conditions. This algorithm was inspired by CSMA (Carrier Sense Multiple Access). In this paper, we prove the convergence and stability of the algorithm, with properly-chosen step sizes and adjustment periods. Convergence of the joint scheduling and rate-control algorithm for utility maximization in [4] can be proved similarly.


BibTeX citation:

@techreport{Jiang:EECS-2009-43,
    Author = {Jiang, Libin and Walrand, Jean},
    Title = {Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2009},
    Month = {Mar},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-43.html},
    Number = {UCB/EECS-2009-43},
    Abstract = {Designing efficient scheduling algorithms is an important problem in a general class of networks with resource-sharing constraints, such as wireless networks and stochastic processing networks. In [4], we proposed a distributed scheduling algorithm that can achieve the maximal throughput in such networks under certain conditions. This algorithm was inspired by CSMA (Carrier Sense Multiple Access). In this paper, we prove the convergence and stability of the algorithm, with properly-chosen step sizes and adjustment periods. Convergence of the joint scheduling and rate-control algorithm for utility maximization in [4] can be proved similarly.}
}

EndNote citation:

%0 Report
%A Jiang, Libin
%A Walrand, Jean
%T Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput
%I EECS Department, University of California, Berkeley
%D 2009
%8 March 28
%@ UCB/EECS-2009-43
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-43.html
%F Jiang:EECS-2009-43