DocumentCode :
1859437
Title :
A protocol and correctness proofs for real-time high-performance broadcast networks
Author :
Hermant, Jean-François ; Lann, Gérard Le
Author_Institution :
LIX, Ecole Polytech., Palaiseau, France
fYear :
1998
fDate :
26-29 May 1998
Firstpage :
360
Lastpage :
369
Abstract :
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
Keywords :
broadcasting; carrier sense multiple access; formal verification; local area networks; multi-access systems; protocols; real-time systems; trees (mathematics); ATM nodes; CSMA/DDCR; CSMA/Deadline Driven Collision Resolution; Gigabit Ethernets; HRTDM problem; Hard Real Time Distributed Multiaccess problem; balanced m ary tree algorithms; broadcast LANs; busses; correctness proofs; deterministic Ethernet-like protocol; feasibility conditions; high performance real time distributed systems; high performance real time networks; real time applications; real time high performance broadcast networks; Access protocols; Algorithm design and analysis; Application software; Asynchronous transfer mode; Broadcasting; Ethernet networks; Real time systems; Switches; Systems engineering and theory; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1998. Proceedings. 18th International Conference on
Conference_Location :
Amsterdam
ISSN :
1063-6927
Print_ISBN :
0-8186-8292-2
Type :
conf
DOI :
10.1109/ICDCS.1998.679740
Filename :
679740
Link To Document :
بازگشت