In [1] [2], we proposed a family of distributed scheduling and rate control algorithms to achieve the maximal throughput in a general class of networks with interference constraints, as well as approaching the optimal fairness among different data flows. These algorithms were inspired by CSMA (Carrier Sense Multiple Access). In this paper, we analyze and prove the convergence of such a scheduling algorithm and the queue stability it guarantees, with properly-chosen step sizes and adjustment periods. Convergence of other algorithms in [1] [2] can be proved similarly.
Title
Convergence Analysis of a Distributed CSMA Algorithm for Maximal Throughput in a General Class of Networks
Published
2008-12-29
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2008-185
Type
Text
Extent
8 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
