Title | Predictability of Message Transfer in CSMA-Networks |
Creator | |
Date Issued | 2000 |
Conference Name | ICA3PP 2000 the 4th International Conference |
Source Publication | Algorithms and Architectures for Parallel Processing
![]() |
ISBN | 978-981-02-4481-1 |
Pages | 97-102 |
Conference Date | DEC 11 – 13, 2000 |
Conference Place | Hong Kong, SAR, China |
Abstract | The paper describes a novel approach to establish predictable message transfer between a set of co-operating nodes controlling a physical process. The protocol allows the coexistence of different classes of criticality in a real-time communication network. The approach exploits a priority scheme to guarantee static preplanned message slots for hard real-time communication and enforces a dynamic earliest deadline first scheduling scheme for SRTMs. Soft real-time or SRTMs can be sent at any time without interfering with the hard real-time traffic. The mechanism is embedded in the media access control (MAC) layer of the communication system and realised by a new variant of the virtual time CSMA (VTCSMA) scheme. One of the benefits of our approach is that it can be applied to all kinds of CSMA-networks including Ethernet and wireless LAN. |
DOI | 10.1142/9789812792037_0009 |
Language | 英语English |
Citation statistics |
Cited Times [WOS]:0
[WOS Record]
[Related Records in WOS]
|
Document Type | Conference paper |
Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/9442 |
Collection | Research outside affiliated institution |
Affiliation | 1.University of Ulm, Department of Computer Structures, Germany 2.Siemens AG, Information and Communication Mobile, Germany 3.City University of Hong Kong, Department of Computer Science, China |
Recommended Citation GB/T 7714 | Kaiser, Jörg,Livani, M. A.,Jia, Weijia. Predictability of Message Transfer in CSMA-Networks[C], 2000: 97-102. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment