Fair and efficient frame-based scheduling algorithm for multimedia networks

T. Al-Khasib, Hussein Alnuweiri, H. Fattah, V. C M Leung

Research output: Contribution to journalConference article

3 Citations (Scopus)

Abstract

The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as Voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.

Original languageEnglish
Pages (from-to)597-603
Number of pages7
JournalProceedings - IEEE Symposium on Computers and Communications
Publication statusPublished - 10 Nov 2005
Externally publishedYes

Fingerprint

Scheduling algorithms
Scheduling Algorithm
Multimedia
Latency
Multimedia Communication
Start-up
Driving Force
Scheduler
Quality of Service
Quality of service
Scheduling
Internet
Communication
Model
Voice

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Fair and efficient frame-based scheduling algorithm for multimedia networks. / Al-Khasib, T.; Alnuweiri, Hussein; Fattah, H.; Leung, V. C M.

In: Proceedings - IEEE Symposium on Computers and Communications, 10.11.2005, p. 597-603.

Research output: Contribution to journalConference article

@article{3e506c07679b45f2899f37c0488b62fc,
title = "Fair and efficient frame-based scheduling algorithm for multimedia networks",
abstract = "The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as Voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.",
author = "T. Al-Khasib and Hussein Alnuweiri and H. Fattah and Leung, {V. C M}",
year = "2005",
month = "11",
day = "10",
language = "English",
pages = "597--603",
journal = "Proceedings - International Symposium on Computers and Communications",
issn = "1530-1346",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Fair and efficient frame-based scheduling algorithm for multimedia networks

AU - Al-Khasib, T.

AU - Alnuweiri, Hussein

AU - Fattah, H.

AU - Leung, V. C M

PY - 2005/11/10

Y1 - 2005/11/10

N2 - The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as Voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.

AB - The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as Voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.

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

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

M3 - Conference article

AN - SCOPUS:27544462341

SP - 597

EP - 603

JO - Proceedings - International Symposium on Computers and Communications

JF - Proceedings - International Symposium on Computers and Communications

SN - 1530-1346

ER -