A two-queue, one-server model with priority for the longer queue
Queueing Systems: Theory and Applications
Journal of the ACM (JACM)
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Design and analysis of a congestion-free overlay on a high-speed network
IEEE/ACM Transactions on Networking (TON)
Buffer size requirements under longest queue first
Proceedings of the IFIP WG 7.3 International Conference on Performance of Distributed Systems and Integrated Communication Networks
Statistical analysis of the generalized processor sharing scheduling discipline
IEEE Journal on Selected Areas in Communications
Design of a fair bandwidth allocation policy for VBR traffic in ATM networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this paper, we propose a generalized longest queue first (GLQF) service discipline for ATM networks. We classify sources so that sources in one class have the same cell loss probability requirement. Assume that there are N classes of traffic. Under this discipline, buffer i is assigned a positive number wi for the weight of buffer i. The scheduler transmits a cell from the buffer that has the maximal weighted queue length. The advantage of this discipline is that it can adapt to temporary overload quickly. We approximate the queue length distribution by decomposing the system into N single server queues with probabilistic service discipline. Our method is an iterative one, which we prove to be convergent by using stochastic dominance arguments and the coupling technique. For high utilization, we present a heavy traffic limit theorem.