Journal of Statistics: Advances in Theory and Applications[1] A. Bedford and P. Zeephongsekul, Simulation studies of a
multipriority dual queue (MPDQ) with preemptive and non-preemptive
scheduling, Lecture Notes in Computer Science 2659 (2003), 179-189.
[2] A. Bedford and P. Zeephongsekul, On a dual queueing system with
preemptive priority service discipline, European J. Oper. Res. 161
(2005), 224-239.
[3] S. Bruell and G. Balbo, Computational Algorithms for Closed
Queueing Networks, Elsevier, Amsterdam, (1980).
[4] P. Dimopoulos, P. Zeephongsekul and Z. Tari, Reducing the user
perceived delay of interactive TCP connections using a dynamic
priority approach, Proceedings of the ICCN 2005, San Diego,
California, (2005), 421-427.
[5] D. Hayes, M. Rumsewicz and L. Andrew, Quality of service driven
packet scheduling disciplines for real-time applications: looking
beyond fairness, IEEE Infocom 99 (1999), 405-412.
[6] G. Latouche and V. Ramaswami, Introduction to Matrix Analytic
Methods in Stochastic Modelling, ASA-SIAM, Philadelphia, (1999).
[7] M. Neuts, Matrix-Geometric Solutions in Stochastic Models, An
Algorithmic Approach, John Hopkins University Press, Baltimore,
(1981).
[8] A. Odlyzko, Paris metro pricing for the internet, Proc. ACM
Conference on Electronic Commerce (1999), 140-147.
[9] R. Ranasinghe, L. Andrew, D. Hayes and D. Everitt, Scheduling
disciplines for multimedia WLANs: embedded round robin and wireless
dual queue, Proceedings IEEE ICC ‘01, Helsinki, Finland, (2001),
1243-1248.
[10] M. Shreedhar and G. Varghese, Efficient fair queuing using
deficit round robin, IEEE/ACM Transactions on Networking 4 (1996),
375-385.
[11] D. Wagner, Waiting times of a finite-capacity multi-server model
with non-preemptive priorities, European J. Oper. Res. 102 (1997),
227-241.
[12] D. Wagner and U. Kreiger, Analysis of a finite buffer with
non-preemptive priority scheduling, Communication in Statistics -
Stochastic Models 15 (1999), 345-365.
[13] P. Zeephongsekul, and A. Bedford, Waiting time analysis of the
multiple dual queue with a preemptive priority service discipline,
European J. Oper. Res. 172 (2006), 886-908.
