Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different users in a controlled way during periods of network congestion. In this paper, we analyze the Assured Service scheme by means of a priority queueing system with statedependent service scheduling based on thresholds. We consider the case of two classes of priority, carry out a mathematical analysis and numerically obtain the average delay endured by packets in each priority class and the loss probability for each class. To quantify the gain obtained under our threshold-based priority scheme over static priority based schemes, we also study the Priority Scheduling and Weighted Fair Queuing models, and compared our results with the ones obtained using these two models.
Nzinga D. Kiameso, Hossam S. Hassanein, Hussein T.