Multiple-access protocols and time-constrained communication
ACM Computing Surveys (CSUR)
Virtual Time CSMA Protocols for Hard Real-Time Communication
IEEE Transactions on Software Engineering
Channel characteristics in local-area hard real-time systems
Computer Networks and ISDN Systems
Load Sharing in Distributed Real-Time Systems with State-Change Broadcasts
IEEE Transactions on Computers
Hard real-time communication in multiple-access networks
Real-Time Systems
Task behavior monitoring for adaptive real-time communication
Real-Time Systems
Statistical Real-Time Channels on Multiaccess Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
Research: Network access protocol for hard real-time communication systems
Computer Communications
Robustness of real-time local area network protocols
Computer Communications
100Base-T/IEEE 802.12/packet switching
IEEE Communications Magazine
Deterministic protocols for real-time communication in multiple access networks
Computer Communications
Efficient fault-tolerant reliable broadcast in a multi-switch extended LAN
Computer Communications
Dynamic real-time channel establishment in multiple access bus networks
Computer Communications
| Hi-index | 0.24 |
The problem of real-time communication over a multiple access network has been well studied in the recent past. However, there are very few protocols that can bound the worst case channel access time to ensure predictability of message transmission for the LAN environment. In addition, there has been no prior work addressing real-time communication over a switched (extended) local area network (SLAN), where several LAN segments are connected through a switch. In this paper, we propose real-time protocols for the LAN and the SLAN. The proposed protocols are based on CSMA/CD with deterministic collision resolution and belong to the dynamic planning based category, where an admission test is performed for guaranteeing message transmission. The admission test used in the proposed protocols is based on the worst case channel access time that can elapse before a particular node can start transmitting its message. We also compute the worst case buffer requirement at the switch for the proposed SLAN protocols. We study the effectiveness of the proposed protocols through extensive simulation studies.