A protocol and correctness proofs for real-time high-performance broadcast networks
Novel real time applications require high performance real time distributed systems, and therefore high performance real time networks. We examine a Hard Real Time Distributed Multiaccess problem which arises with such application problems. We present a solution, based on broadcast LANs or busses, s...
Saved in:
Published in: | Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183) pp. 360 - 369 |
---|---|
Main Authors: | , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
1998
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Novel real time applications require high performance real time distributed systems, and therefore high performance real time networks. We examine a Hard Real Time Distributed Multiaccess problem which arises with such application problems. We present a solution, based on broadcast LANs or busses, such as Gigabit Ethernets or busses internal to ATM nodes, associated with a deterministic Ethernet-like protocol called CSMA/Deadline Driven Collision Resolution. We give an analysis of balanced m ary tree algorithms which are used by CSMA/DDCR, and derive feasibility conditions for the HRTDM problem. |
---|---|
ISBN: | 9780818682926 0818682922 |
ISSN: | 1063-6927 2575-8411 |
DOI: | 10.1109/ICDCS.1998.679740 |