Scheduling communication networks carrying real-time traffic
John P. Lehoczky · 2002
The 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. Edf and fifo scheduling policies are analyzed in detail. 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. The results are extended to a two node non Jackson network. Simulations illustrate the excellent accuracy of the closed form expressions. The formulas developed are used to design system parameters that can attain desired levels of packet lateness.