| Assured Service has been proposed within the Differentiated Services architecture to provide relative service differentiation by attempting to allocate bandwidth to different users in a controlled way during periods of network congestion.; In this thesis, we analyze the Assured Service scheme by means of a priority queueing system with state-dependent service scheduling based on thresholds. We consider the case of two classes of priority, carry out a mathematical analysis using a two-dimensional birth-and-death Markov process, and numerically obtain the steady-state probabilities of the queue occupancy for each class. We then 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 emulated two other models, namely Priority Scheduling and Weighted Fair Queueing, and compare our results with the ones obtained using these models. (Abstract shortened by UMI.)... |
