Distributed Random Access Algorithm: Scheduling and Congesion Control

Distributed Random Access Algorithm: Scheduling and Congesion Control

This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier sense multiple access (CSMA) algorithms where the random access (or backoff) parameter of each node is adjusted dynamically. These algorithms require only local information and they are easy to implement...

Full description

Bibliographic Details
Main Authors: Jiang, Libin, Shah, Devavrat, Shin, Jinwoo, Walrand, Jean
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2011
Online Access:http://hdl.handle.net/1721.1/61979
https://orcid.org/0000-0003-0737-3259

Internet

http://hdl.handle.net/1721.1/61979
https://orcid.org/0000-0003-0737-3259

Similar Items