|
Volumn , Issue , 2009, Pages 5-7
|
Approaching throughput-optimality in a distributed CSMA algorithm: Collisions and stability
|
Author keywords
CSMA; Distributed scheduling; Markov chain; Maximum throughput
|
Indexed keywords
CARRIER COMMUNICATION;
CARRIER SENSE MULTIPLE ACCESS;
MARKOV PROCESSES;
THROUGHPUT;
CONVERGENCE AND STABILITY;
DISTRIBUTED SCHEDULING;
MAXIMAL THROUGHPUT;
MAXIMUM THROUGH-PUT;
PRODUCT FORMS;
QUASI-REVERSIBILITY;
TASK-PROCESSING;
THROUGHPUT OPTIMALITY;
SCHEDULING ALGORITHMS;
|
EID: 84960935317
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/1540358.1540361 Document Type: Conference Paper |
Times cited : (13)
|
References (7)
|