Predictable path establishment in multimedia communication networks

Deadline-driven packet scheduling policies provide highly flexible methods for real-time communication support of distributed multimedia applications. This paper presents a probabilistic approach for analyzing admission control and communication establishment for the general class of non-preemptive deadline-oriented packet scheduling policies. The prediction method can be used for communication and scheduling policy evaluation, routing for multimedia traffic and capacity planning. A large-scale simulation study demonstrates that our method provides highly accurate predictions of acceptance rates for multiple types of multimedia connection requests