Mean packet delay approximation in the GI-G-1 queueing system with priority scheduling

The main goal of the next generation Internet is to support a wide variety of applications with different Quality-of-Service (QoS) requirements. A multi-service network can be achieved by priority scheduling. When connections setup, packet delay for each priority queue is an important issue for route selection. This paper focuses on the head-of-line (HOL) priority queueing system and provides a simple approximation of mean waiting time in this system. Our approximation is accurate and general from lowest priority to highest priority and from light load to heavy load.