Utilization-Based Admission Control for Scalable Real-Time Communication
Real-Time Systems
Utilization-Based Admission Control for Real-Time Applications
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Endpoint Admission Control: Network Based Approach
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
IEEE/ACM Transactions on Networking (TON)
Distributed Admission Control for Anycast Flows
IEEE Transactions on Parallel and Distributed Systems
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Real-time intrusion detection and suppression in ATM networks
ID'99 Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1
Expert Systems with Applications: An International Journal
Evolvable fuzzy system for ATM cell scheduling
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Static priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constraints of connections. We study delay computation and priority assignment problems in an ATM network with static priority scheduling. Given an ATM network with arbitrary topology, it is possible that the traffic on it may become unstable (i.e., packet delays become unbounded) due to the potential cyclic dependency of the traffic. An unstable network is definitely unacceptable for many delay sensitive applications. We start by formally deriving a simple condition under which the network is guaranteed to be stable. We then develop a numerical method to compute worst case end to end delays in an ATM network with arbitrary topology. Convergence of the method is formally proved and a closed form for the computing error is obtained. Despite its advantages, static priority scheduling remains sensitive to proper priority assignment. We describe two simple priority assignment methods, which we show to outperform other commonly used methods.