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.
Title
Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput
Published
2009-03-28
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
EECS-2009-43
Type
Text
Extent
18 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).
