Multiple-access protocols and time-constrained communication
ACM Computing Surveys (CSUR)
Communications of the ACM - Special issue: computing in the frontiers of science and engineering
Virtual Time CSMA Protocols for Hard Real-Time Communication
IEEE Transactions on Software Engineering
A simple and efficient bus management scheme that supports continuous streams
ACM Transactions on Computer Systems (TOCS)
Hard real-time communication in multiple-access networks
Real-Time Systems
Statistical Real-Time Channels on Multiaccess Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
Graceful Degradation in Real-time Control Applications Using (m, k)-Firm Guarantee
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Achieving Real-Time Communication over Ethernet with Adaptive Traffic Smoothing
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
Real-Time Communication in Autonomous Robot Systems
ISADS '99 Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems
A Perspective on Distributed Computer Systems
IEEE Transactions on Computers
Research: Network access protocol for hard real-time communication systems
Computer Communications
Deterministic protocols for real-time communication in multiple access networks
Computer Communications
A scheme for real-time channel establishment in wide-area networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
Real-time communication with performance guarantees is becoming very important to many applications, like computer integrated manufacturing, multimedia, and many embedded systems. The timing guarantees required in these applications are not possible without a network protocol which supports the timely and predictable delivery of messages. Multiple access bus networks are being increasingly used in real-time applications because they are simple, economical, and have small propagation delays. In such networks, the nodes have to coordinate with one another in order to transmit data and control messages over the shared channel. Though several real-time protocols have been proposed for the multiple access bus networks, there is no guarantee based protocol which addresses the problem of integrated scheduling of dynamically arriving periodic (i.e. time triggered) and aperiodic (i.e. event triggered) messages. In this paper, we propose two guarantee based protocols, earliest deadline first (EDF) and BUS protocols, which address this problem. The proposed protocols dynamically establish real-time channels for dynamically arriving periodic message streams and thus ensure predictable communication. In our protocols, we employ the concept of aperiodic server for servicing aperiodic messages. In the simulation studies, the performance metrics, success ratio (measure of schedulability) and channel utilization are used to study the performance of the two protocols. It is observed that the EDF protocol offers higher schedulability as compared to the BUS protocol for periodic messages, while the BUS protocol offers better channel utilization for aperiodic messages as compared to the EDF protocol.