Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
Quality of service in IP networks: foundations for a multi-service Internet
Quality of service in IP networks: foundations for a multi-service Internet
Analysis of delay and delay jitter of voice traffic in the internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive nonlinear congestion controller for a differentiated-services framework
IEEE/ACM Transactions on Networking (TON)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Proactive resource provisioning
Computer Communications
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Review: A comprehensive survey on scheduler for VoIP over WLAN
Journal of Network and Computer Applications
Hi-index | 0.24 |
Strict priority scheme is one of several ways for the implementation of a service differentiation in a router because of simplicity in implementation and its capability to guarantee the delay requirement of the highest-class of traffic. It is also known that strict priority to highest-priority class traffic starves the lower-classes traffic at the cost of prioritizing the highest-class traffic. Starvation of lower-class traffic may be problematic in case the offered load of highest-class traffic is high. However, under some proper mixing of the traffic and over a high-speed link, the concerns for the starvation problem may not be so serious. In addition, we argue that delay of the highest-class traffic can be influenced by the behaviors of the lower-class traffic even under the strict priority service scheme. The purpose of this work is to present an analytic method which can represent the delay performance of the strict priority scheme in an explicit manner from those two viewpoints, and shows that it may be applied to a service differentiation scheme for the future IP network with low or moderate level of the highest-class traffic. Via numerical experiments we validate our argument.