{"title":"A protocol and correctness proofs for real-time high-performance broadcast networks","authors":"J. Hermant, G. L. Lann","doi":"10.1109/ICDCS.1998.679740","DOIUrl":null,"url":null,"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.","PeriodicalId":289230,"journal":{"name":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","volume":"398 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.1998.679740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
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.