The real-time communications problem is distinguished from the standard nonreal-time problem by the introduction of time. In the nonreal-time setting, it is sufficient to verify the functional correctness of a communications solution along with some notion of aggregate throughput and/or average delay. In the real-time setting, the individual message-level timing requirements are an integral part of the functional correctness. The current state of the art and predominant practice of using Time Domain Multiplexing (TDM) techniques to insure timing correctness tends to result in ad hoc, handcrafted timing solutions which are very hard to modify, upgrade and extend. Further, the deadlines of synchronous communications are guaranteed by relegating asynchronous class messages to a noninterfering, background status. This approach often results in poor system responsiveness. This thesis develops a novel approach for scheduling the IEEE 802.5 and SAE-9B token ring LANs for hard real-time applications that not only guarantees deadlines for synchronous messages, but also dramatically reduces the asynchronous messages' response times. Highly responsive guaranteed service is introduced for alert class asynchronous messages. This algorithmic-based scheduling approach supports a priori determination of system timing correctness for arbitrary synchronous and asynchronous message sets without the costly time-line development, testing and tuning associated with TDM techniques. This capability allows token rings to support dynamic, adaptive and reconfigurable run-time environments. In addition, a new Enhanced Responsiveness Protocol that directly embeds real-time scheduling theory into the media access protocol is developed that offers higher performance than is possible with standard-based methods. These new approaches introduce guaranteed alert class service, and dramatically enhanced asynchronous class message service to LANs. The result is highly responsive real-time rings that can form the backbone of predictable, stable extensible real-time systems.
Cited By
- Katcher D, Arakawa H and Strosnider J (2019). Engineering and Analysis of Fixed Priority Schedulers, IEEE Transactions on Software Engineering, 19:9, (920-934), Online publication date: 1-Sep-1993.
- Paul C, Acharya A, Black B and Strosnider J (1991). Reducing problem-solving variance to improve predictability, Communications of the ACM, 34:8, (80-93), Online publication date: 1-Aug-1991.
Recommendations
The timed-token protocol for real-time communications
The timed-token protocol is a token-passing protocol in which each node receives a guaranteed share of the network bandwidth. Partly because of this property, the timed-token protocol has been incorporated into a number of network standards, including ...
Hard Real-Time Communication with the Timed Token Protocol: Current State and Challenging Problems
With the increasing use of distributed real-time systems, the ability of communication networks to handle real-time traffic is becoming more and more important. The timed token medium access control protocol, which has been now incorporated into several ...
Real-time communication and admission control over responsive link
PDCN '08: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and NetworksThis paper presents a framework of real-time communications over Responsive Link, which is one of the communication standards for real-time networks. In the Responsive Link, each packet has a priority at the hardware level and higher-prioritized packets ...