Distributed scheduling in wireless data networks with service differentiation

Piyush Gupta, Yogesh Sankarasubramaniam, Alexander Stolyar

Research output: Contribution to journalConference article

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 languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2004
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

Fingerprint

Distributed Scheduling
Service Differentiation
Medium access control
Medium Access Control
Contention
Scheduling
Scheduling algorithms
Parallel algorithms
Distributed Algorithms
Pi
Scheduling Algorithm
Throughput
High Throughput
Traffic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Distributed scheduling in wireless data networks with service differentiation. / Gupta, Piyush; Sankarasubramaniam, Yogesh; Stolyar, Alexander.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2004.

Research output: Contribution to journalConference article

@article{6b097a49949641d08a75f7afc4f5f1d3,
title = "Distributed scheduling in wireless data networks with service differentiation",
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.",
author = "Piyush Gupta and Yogesh Sankarasubramaniam and Alexander Stolyar",
year = "2004",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Distributed scheduling in wireless data networks with service differentiation

AU - Gupta, Piyush

AU - Sankarasubramaniam, Yogesh

AU - Stolyar, Alexander

PY - 2004/10/20

Y1 - 2004/10/20

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=5044244900&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044244900&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:5044244900

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -