Using traffic regulation to meet end-to-end deadlines in ATM networks

Abstract

ÐThis paper considers the support of hard real-time connections in ATM networks. In an ATM network, a set of hard realtime connections can be admitted only if the worst case end-to-end delays of cells belonging to individual connections are less than their deadlines. There are several approaches to managing the network resources in order to meet the delay requirements of connections. This paper focuses on the use of traffic regulation to achieve this objective. Leaky buckets provide simple and userprogrammable means of traffic regulation. An efficient optimal algorithm for selecting the burst parameters of leaky buckets to meet connections' deadlines is designed and analyzed. The algorithm is optimal in the sense that it always selects a set of burst parameters whose mean value is minimal and by which the delay requirements of hard real-time connections can be met. The exponential size of the search space makes this problem a challenging one. The algorithm is efficient through systematically pruning the search space. There is an observed dramatic improvement in the system performance in terms of the connection admission probability when traffic is regulated using this algorithm. Index TermsÐATM network, hard real-time communication, network delay analysis, traffic regulation.

Fair and Smooth Scheduling for Virtual Output Queuing Switches Achieving 100% Throughput

“…In packet switched networks, traffic patterns become increasingly irregular as packets are multiplexed and buffered at the intermediate nodes [1][2]. Schedulers should try to smooth the traffic as much as possible.…”

Using traffic regulation to meet end-to-end deadlines in ATM LANs

“…ystem A performs better than systems 51 and B2 for higher values of U. For a detailed analysis of this phenomenon, see [13]. Generally speaking, r;hese results further strengthen the need for a good fl c8elec-tion algorithm.…”

“…The proof of this theorem (and leach of the subsequent theorems in this subsection) is not provided due to lack of space. The reader is referred to [13] for the proof. Consider, the example in Figure 1.…”

“…In this paper, we use a procedure to compute d, for each of the three traffic descriptors that has been studied and analyzed in [13].…”

“…Given any connection Mi, there exists a constant P y " , such that increasing pi beyond -For the procedure to compute the worst case end-to-end delay of connections, please refer[13].…”