Using Traffic Regulation to Meet End-to-End Deadlines in ATM Networks
IEEE Transactions on Computers
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
Utilization-Based Admission Control for Scalable Real-Time Communication
Real-Time Systems
Endpoint Admission Control: Network Based Approach
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Guaranteeing hard real-time traffic constraints with ATM networks
Integrated Computer-Aided Engineering
Improved response time analysis of tasks scheduled under preemptive Round-Robin
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
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
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
| Hi-index | 0.00 |
Abstract: We address the issue of guaranteeing the end-to-end deadlines of hard real-time connections in an ATM network. In an ATM network, a set of hard real-time connections can be admitted only if the end-to-end delays of cells belonging to individual connections are not more than their deadlines. We systematically decompose an ATM network into constant delay and variable delay servers to facilitate the delay analysis. Effective traffic description is the key part of such a process. We propose a comprehensive traffic description function that provides adequate information about the worst case traffic behavior of connections anywhere in the network. We also study some simple approximations of this function that perform reasonably well in practice. We analyze and compare the performance of ATM networks with FCFS and WRR link scheduling policies under different loading conditions.