QLWFQ: a queue length based weighted fair queueing algorithm in ATM networks

Author

Ohba, Yoshihiro

Author_Institution

Res. & Dev. Center, Toshiba Corp., Kawasaki, Japan

Volume

2

fYear

1997

fDate

7-12 Apr 1997

Firstpage

566

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

Keywords

asynchronous transfer mode; delays; queueing theory; telecommunication traffic; ATM networks; FIFO; QLWFQ; analytical results; cell arrival; cell departure; delay bound; fairness index; heavily loaded conditions; high-speed networks; lightly loaded conditions; queue length based weighted fair queueing algorithm; simulation results; traffic isolation; traffic sharing; weighted round robin; Algorithm design and analysis; Asynchronous transfer mode; Computational efficiency; Delay effects; Intelligent networks; Quality of service; Round robin; Telecommunication traffic; Traffic control; Virtual colonoscopy;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE

Conference_Location

Kobe

ISSN

0743-166X

Print_ISBN

0-8186-7780-5

Type

conf

DOI

10.1109/INFCOM.1997.644507

Filename

644507