[PDF][PDF] 分组交换网络中队列调度算法的研究及其展望

王重钢, 隆克平, 龚向阳, 程时端 - 电子学报, 2001 - ejournal.org.cn
分组交换网络中队列调度算法的研究及其展望 Page 1 © 1994-2010 China Academic Journal
Electronic Publishing House. All rights reserved. http://www.cnki.net 分组交换网络中队列调度 …

End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms

W Sun, KG Shin - IEEE/ACM Transactions on networking, 2005 - ieeexplore.ieee.org
This paper evaluates, via both analysis and simulation, the end-to-end (e2e) delay
performance of aggregate scheduling with guaranteed-rate (GR) algorithms. Deterministic …

Stochastic bounds on delays of fair queueing algorithms

N Pekergin - IEEE INFOCOM'99. Conference on Computer …, 1999 - ieeexplore.ieee.org
We study the delay characteristics of fair queueing algorithms with a stochastic comparison
approach. In integrated services networks, fair queueing (FQ) policies have received much …

Implementing fair queueing in atm switches: The discrete-rate approach

FM Chiussi, A Francini - … IEEE INFOCOM'98, the Conference on …, 1998 - ieeexplore.ieee.org
The total implementation cost of schedulers which approximate the generalized processor
sharing (GPS) policy is dominated by the complexity of maintaining and sorting the time …

Implementing fair queueing in ATM switches. II. The logarithmic calendar queue

FM Chiussi, A Francini… - GLOBECOM 97. IEEE …, 1997 - ieeexplore.ieee.org
For pt. I see ibid., p. 509-18 (1997). The total implementation complexity of cell schedulers
which aim at approximating the generalized processor sharing (GPS) policy is the …

[图书][B] Stochastic Evaluation of Fair Scheduling with Applications to Quality-of-Service in Broadband Wireless Access Networks

M Hawa - 2003 - search.proquest.com
A prerequisite to providing multimedia services over wireless packet-switched networks is
the provisioning of new mechanisms that allow such networks to treat packets differently …

Stochastic analysis of upper delay bound of GPS-based packetized fair queueing algorithms

J Zhang, T Hamalainen… - Proceedings. 2004 12th …, 2004 - ieeexplore.ieee.org
Fair queueing (FQ) algorithms which aim at approximating the generalized processor
sharing (GPS) policy remain most popular for the provision of quality-of-service guarantees …

SWFQ: a simple weighted fair queueing scheduling algorithm for high-speed packet switched network

C Wang, K Long, X Gong… - ICC 2001. IEEE …, 2001 - ieeexplore.ieee.org
In this paper, we present an effective scheduling algorithm based on the RPS model, called
simple weighted fair queueing (SWFQ). In SWFQ, computation of the system potential …

A low-cost architecture for the implementation of worst-case-fair schedulers in ATM switches

FM Chiussi, A Francini - IEEE GLOBECOM 1998 (Cat. NO …, 1998 - ieeexplore.ieee.org
The discrete-rate approach has been proposed in Bennett et al.(1997) as a low-complexity
solution for the implementation of worst-case-fair schedulers which approximate the …

Effective fairness queuing algorithms

W Chonggang, L Keping, G Xiangyang… - … on Networks 2000 …, 2000 - ieeexplore.ieee.org
In this paper we present two effective fair queuing algorithms (EFQs), which achieves
fairness properties and delay properties similar to WFQ (which is currently the better …