On causal scheduling of multiclass traffic with deadlines

B. Hajek, P. Seri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Causal scheduling-dropping policies for multiclass traffic with deadlines are considered. Packets with deadlines and class labels arrive in discrete time and are either scheduled by their deadlines or dropped on or possibly before their deadlines. Emphasis is on the case that there are two classes of traffic, and on causal policies which at any given time base decisions on arrivals up to that time. First the causal scheduling-dropping policies that maximize total throughput are identified. Then those scheduling dropping policies with the greatest throughput for the high priority class, subject to being causal and maximizing total throughput, are identified.

Original languageEnglish (US)
Title of host publicationProceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998
Number of pages1
DOIs
StatePublished - Dec 1 1998
Event1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, MA, United States
Duration: Aug 16 1998Aug 21 1998

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1998 IEEE International Symposium on Information Theory, ISIT 1998
CountryUnited States
CityCambridge, MA
Period8/16/988/21/98

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'On causal scheduling of multiclass traffic with deadlines'. Together they form a unique fingerprint.

  • Cite this

    Hajek, B., & Seri, P. (1998). On causal scheduling of multiclass traffic with deadlines. In Proceedings - 1998 IEEE International Symposium on Information Theory, ISIT 1998 [708761] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1998.708761