Title :
A protocol for multiple access communication with real-time delivery constraints
Author :
Marinescu, Dan C.
Author_Institution :
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
Abstract :
A multiple access protocol with real-time delivery constraints is introduced, and its properties are investigated. The modified shortest time to extinction (MSTE) algorithm implements a pseudo shortest time to extinction scheduling policy. The salient features of the algorithm are: it allows transmission of messages belonging to several classes of criticality, it takes into account the actual priority of a message in a given class and it rejects packets with deadlines shorter than a minimum acceptance deadline defined for a particular class
Keywords :
multi-access systems; packet switching; protocols; message priority; message transmission; modified shortest time to extinction; multiple access communication; multiple access protocol; packet switching; real-time delivery constraints; scheduling policy; Access protocols; Algorithm design and analysis; Data communication; Feedback; Media Access Protocol; Processor scheduling; Real time systems; Scheduling algorithm; Terminology; Timing;
Conference_Titel :
INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-8186-2049-8
DOI :
10.1109/INFCOM.1990.91365
