A multi-access window protocol for transmission of time constrained messages

6 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 384-392
https://doi.org/10.1109/dcs.1988.12540

Abstract

A novel window protocol for transmitting time-constrained messages in a multiaccess network is proposed that explicitly takes time constraints into account. The window is formed on the basis of latest time to send a message (LS). A newly arriving message is immediately considered for transmission if its LS is less than those of the all pending messages in the system. As a result, the protocol closely approximates the optimal minimum-laxity-first policy. A performance evaluation by simulation shows that the protocol performs well in a wide range of environments, even under overloaded conditions.

Keywords

This publication has 15 references indexed in Scilit:

Channel characteristics in local-area hard real-time systems
Computer Networks and ISDN Systems, 1987
Virtual Time CSMA: Why Two Clocks Are Better than One
IEEE Transactions on Communications, 1985
Analysis of a stack algorithm for random multiple-access communication
IEEE Transactions on Information Theory, 1985
Controlling window protocols for time-constrained communication in a multiple access environment
Published by Association for Computing Machinery (ACM) ,1983
Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes
IEEE Transactions on Communications, 1980
Distributed broadcast channel access
Computer Networks (1976), 1979
BRAM: The Broadcast Recognizing Access Method
IEEE Transactions on Communications, 1979
An Assigned-Slot Listen-Before-Transmission Protocol for a Multiaccess Data Channel
IEEE Transactions on Communications, 1979
An Adaptive Technique for Local Distribution
IEEE Transactions on Communications, 1978
Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
IEEE Transactions on Communications, 1975