PRIORITIZED MULTIACCESS PROTOCOL FOR DISTRIBUTED REAL-TIME APPLICATIONS.

Taieb Znati, Lionel M. Ni

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

3 Citations (Scopus)

Abstract

Design requirements for distributed real-time applications at the network level are addressed. An idealized protocol for handling messages with different priority classes should take advantage of both CSMA/CD and token-passing bus protocols. The proposed multiaccess protocol, based on the virtual token concept, is able to achieve the desired design requirements and perform closely to the idealized case. Fault management in the proposed protocol is simpler than the token-passing protocol because no physical token is involved. It is shown that a simple static binary search scheme is sufficient to assess the channel priority and to eliminate the inherent computational complexity needed in the dynamic search scheme. Simulation results have shown that the overhead spent in implementing the protocol is relatively small.

Original languageEnglish
Title of host publicationProceedings - International Conference on Distributed Computing Systems
EditorsR. Popescu-Zeletin, G. Le Lann, K.H. Kim
PublisherIEEE
Pages324-331
Number of pages8
ISBN (Print)0818608013
Publication statusPublished - 1987
Externally publishedYes
EventProc Int Conf Distrib Comput Syst 7th - Berlin, West Ger
Duration: Sep 21 1987Sep 25 1987

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Conference

ConferenceProc Int Conf Distrib Comput Syst 7th
CityBerlin, West Ger
Period9/21/879/25/87

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'PRIORITIZED MULTIACCESS PROTOCOL FOR DISTRIBUTED REAL-TIME APPLICATIONS.'. Together they form a unique fingerprint.

Cite this