Hard Real-Time Communication in ATM Networks (1997) [1 citations — 0 self]
|
Abstract:
We present and evaluate a method for admission control of hard real-time traffic in Asynchronous Transfer Mode (ATM) networks, i.e., the method determines if a new connection with strict requirements on the timely delivery of messages can be admitted without violating the strict timing requirements specified for the new as well as old connections. This type of admission control is required by several multimedia and almost all real-time control applications. Our method, Response-Time Analysis (RTA), is based on traditional real-time CPU schedulability analysis. The only assumption RTA makes about the ATMnetwork is that the switches should be equipped with prioritized output queues, something which is true for many commercial switches. The main focus of this paper is on evaluating RTA. In the evaluation we compare RTA with Weighted Fair Queueing (WFQ) and the Calculus of Network Delays (CND). WFQ is the currently most popular method for providing performance guarantees, and CND provides an alternative analysis for prioritized queueing. The comparison shows that RTA outperforms both WFQ and CND for a set of realistic traffic scenarios. Keywords: Hard real-time systems, Real-time communication, ATM networks, Admission control, End-to-end delays
Citations
| 503 | Virtualclock: A new traffic control algorithm for packet-switched networks – Zhang - 1991 |
| 138 | Rate-controlled service disciplines – Zhang, Ferrari - 1994 |
