Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Analysis of polling systems
The analysis of random polling systems
Operations Research
Queuing analysis of polling models
ACM Computing Surveys (CSUR)
IEEE/ACM Transactions on Networking (TON)
A closed form solution for the asymmetric random polling system with correlated Levy input process
Mathematics of Operations Research
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
Modeling the performance of low latency queueing for emergency telecommunications
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Approximation for a two-class weighted fair queueing discipline
Performance Evaluation
Hi-index | 0.00 |
Class Based Weighted Fair Queueing (CBWFQ) is a very important router discipline that allows different types of Internet Protocol (IP) traffic like voice, video, and best effort data to receive the required quality of service measures they individually need. CBWFQ dynamically allocates the available bandwidth to each traffic class based on the class's weight. This discipline is playing a vital role as IP brings these traffic classes together in a truly converged network. Under stress and in extreme emergencies, it is critical to be able to determine how the CBWFQ discipline will perform. In this paper, we present and discuss the critical role simulation has played in our development of performance analysis tools for the CBWFQ discipline.