Abstract
A class of distributed scheduling algorithms, Regulated Contention Medium Access Control (RCMAC), which provides dynamic prioritized access to users for service differentiation, was discussed. It was found that RCMAC achieves higher throughput when traffic is bursty. In RCMAC the access probabilities of different users pi, i=1,2,..., M , in a slot were found to be dynamic, depending on the user 'state' and some 'system-wide variables' shared among contending users. RCMAC-TBR was shown to achieve significant improvement in user througput.
Original language | English (US) |
---|---|
Pages (from-to) | 246 |
Number of pages | 1 |
Journal | IEEE International Symposium on Information Theory - Proceedings |
State | Published - 2004 |
Externally published | Yes |
Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics