Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Asynchronous transfer mode: solution for broadband ISDN
Asynchronous transfer mode: solution for broadband ISDN
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Contributions toward real-time services on packet switched networks
Contributions toward real-time services on packet switched networks
Hard real-time communication in multiple-access networks
Real-Time Systems
ATM concepts, architectures, and protocols
Communications of the ACM
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Guaranteeing end-to-end deadlines in ATM networks
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Real-time communications in atm networks
Real-time communications in atm networks
Admission control for hard real-time connections in ATM LANs
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Scheduling real-time traffic in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Traffic-controlled rate-monotonic priority scheduling of ATM cells
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A slot swapping protocol for time-critical internetworking
Journal of Systems Architecture: the EUROMICRO Journal
Modeling and performance evaluation of ATM switches
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Essay on teletraffic models (I)
ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
FGN based telecommunication traffic models
WSEAS Transactions on Computers
Fair and smooth scheduling for virtual output queuing switches achieving 100% throughput
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
| Hi-index | 14.98 |
This paper considers the support of hard real-time connections in ATM networks. In an ATM network, a set of hard real-time 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 user-programmable 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.