Paper Info
Title
QLWFQ: A Queue Length Based Weighted Fair Queueing Algorithm in ATM Networks
Abstract
A work conserving O(1) per-VC queueing algorithm named QLWFQ (Queue Length based Weighted Fair Queueing) for high-speed ATM networks is proposed. The basic process in QLWFQ is the comparison of the current queue length with the weight when a cell arrival or departure occurs. QLWFQ has upward compatibility with Fair Queueing and FIFO, and can be considered to be a simplified version of Weighted Round Robin. A delay bound and a fairness index are derived analytically for the QLWFQ algorithm. The simulation results for heavily and lightly loaded conditions are also presented. The analytical and simulation results show that QLWFQ achieves a better balance between traffic isolation and traffic sharing than timestamp based algorithms.
Year
DOI
Venue
1997
10.1109/INFCOM.1997.644507
INFOCOM
Keywords
DocType
ISSN
queue length,traffic sharing,per-vc queueing algorithm,fair queueing,weighted fair queueing algorithm,weighted round robin,qlwfq algorithm,simulation result,atm networks,basic process,traffic isolation,better balance,algorithm design and analysis,indexation,asynchronous transfer mode,atm,queueing theory,weighted fair queueing,quality of service,intelligent networks,fifo
Conference
0743-166X
ISBN
Citations 
PageRank 
0-8186-7780-5
2
0.38
References 
Authors
16
1
Name
Order
Citations
PageRank
Yoshihiro Ohba123722.87