This paper presents new methods to analyze the performance of certain scheduling algorithms for communication networks carrying real-time traffic and operating in a packet switched mode. The real-time traffic consists of distinct sessions each of which transmits packets with hard deadlines. For the single node case, methods based on real-time queueing theory and heavy traffic queueing theory are applied to develop closed form expressions for the fraction of packets which miss their deadline as a function of the characteristics of the sessions using the node. This paper focuses on the single case, but the results are extended to a simple two node network.
Simulations illustrate the excellent accuracy of the closed-form expressions.
This paper presents new results in real-time queueing theory for the case in which the arrival process is the superposition of distinct streams or sessions, each of which has its own unique arrival rates, service requirements and timing requirements.