TY - GEN
T1 - Throughput of random access without message passing
AU - Proutière, Alexandra
AU - Yi, Yung
AU - Chiang, Mung
PY - 2008
Y1 - 2008
N2 - We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are shown to provide high throughput performance: they achieve the same performance as that of some maximal scheduling algorithms, e.g. Maximum Size scheduling algorithms.
AB - We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are shown to provide high throughput performance: they achieve the same performance as that of some maximal scheduling algorithms, e.g. Maximum Size scheduling algorithms.
UR - http://www.scopus.com/inward/record.url?scp=51849167395&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51849167395&partnerID=8YFLogxK
U2 - 10.1109/CISS.2008.4558579
DO - 10.1109/CISS.2008.4558579
M3 - Conference contribution
AN - SCOPUS:51849167395
SN - 9781424422470
T3 - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems
SP - 509
EP - 514
BT - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems
T2 - CISS 2008, 42nd Annual Conference on Information Sciences and Systems
Y2 - 19 March 2008 through 21 March 2008
ER -