题名 | Predictability of Message Transfer in CSMA-Networks |
作者 | |
发表日期 | 2000 |
会议名称 | ICA3PP 2000 the 4th International Conference |
会议录名称 | Algorithms and Architectures for Parallel Processing
![]() |
ISBN | 978-981-02-4481-1 |
页码 | 97-102 |
会议日期 | DEC 11 – 13, 2000 |
会议地点 | Hong Kong, SAR, China |
摘要 | 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 |
语种 | 英语English |
引用统计 | |
文献类型 | 会议论文 |
条目标识符 | https://repository.uic.edu.cn/handle/39GCC9TT/9442 |
专题 | 个人在本单位外知识产出 |
作者单位 | 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 |
推荐引用方式 GB/T 7714 | Kaiser, Jörg,Livani, M. A.,Jia, Weijia. Predictability of Message Transfer in CSMA-Networks[C], 2000: 97-102. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论