A deadline-driven window protocol for transmission of hard real-time traffic

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

2 Citations (Scopus)

Abstract

A description is given of a protocol to handle traffic with timing constraints, such as the traffic generated by distributed real-time applications. The protocol uses a dynamic double-window based strategy to implement the optimal minimum-laxity-first policy. The author discusses the major issues involved in the design of the protocol. The tie assessment phase is formally described and its mechanism discussed. The author describes a simulation experiment that aimed at comparing the performance of the proposed scheme with the performance of the standard access mechanisms. The major advantages of the proposed protocol are the adherence of the scheme to the timing requirements of different messages and its preservation of the minimum-laxity-first policy even in the presence of ties among messages.

Original languageEnglish
Title of host publicationConference Proceedings - Annual Phoenix Conference
PublisherPubl by IEEE
Pages667-673
Number of pages7
ISBN (Print)0818621338
Publication statusPublished - Mar 1991
Externally publishedYes
EventProceedings of the 10th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA
Duration: Mar 27 1991Mar 30 1991

Publication series

NameConference Proceedings - Annual Phoenix Conference

Other

OtherProceedings of the 10th Annual International Phoenix Conference on Computers and Communications
CityScottsdale, AZ, USA
Period3/27/913/30/91

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'A deadline-driven window protocol for transmission of hard real-time traffic'. Together they form a unique fingerprint.

Cite this