Blocked and Free Access Real-Time Splitting Protocols

Authors:
Michael J. Markowski;Adarshpal S. Sethi
Affiliations:
(M.J. Markowski is also with the US Army Research Lab- oratory, APG, MD, USA) Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712-1188, USA;Department of Computer Sciences, The University of Texas at Austin, Austin, TX 78712-1188, USA
Venue:
Integrated Computer-Aided Engineering
Year:
1998

Citing 6
Cited 0

Data networks

Data networks
Virtual Time CSMA Protocols for Hard Real-Time Communication

IEEE Transactions on Software Engineering
A Window Protocol for Transmission of Time-Constrained Messages

IEEE Transactions on Computers
Protocols for distributed real-time systems

Protocols for distributed real-time systems
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Evaluation of Wireless Soft Real-Time Protocols

RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Addressing the challenge of packet transmission in a wireless soft real-time system, we present five splitting protocols that take packet deadlines into account. With them, connectionless service with real-time QoS guarantees at the MAC layer can be offered. Three protocols are blocked access and two are free access algorithms. Mathematical models are developed and results compared with simulations. As is the case with non real-time splitting algorithms, the blocked access versions offer higher success rates than the free access versions. We further show that of the two best performing blocked access protocols, under moderate to heavy loads, the Sliding Partition CRA outperforms the Two Cell CRA.