Dynamic queue length thresholds for scheduling real-time traffic in ATM networks

New schemes of scheduling real-time traffic in high speed ATM networks are proposed for multiple priority queues based on dynamic queue length thresholds in real-time scheduling. The proposed schemes will provide guaranteed real-time service for each connection and cell sequence integrity for virtual channel/path characteristics. We provide the stochastic Petri net model of these schemes and an approximate analysis technique, which significantly reduce the complexity of the model solution and can be applied to real ATM switch models. Using numerical results we show that our schemes outperform well known schemes such as the head-of-line priority control and the queue length threshold policy