Effective fairness queuing algorithms

Author

Chonggang, Wang ; Keping, Long ; Xiangyang, Gong ; Shiduan, Cheng

Author_Institution

Nat. Lab. of Switching Technol. & Telecommun. Networks, Beijing Univ. of Posts & Telecommun., China

fYear

2000

fDate

2000

Firstpage

294

Lastpage

301

Abstract

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 scheduling algorithm among others), and uses a system potential function of O(l) complexity. In EFQs, computation of system potential function does not require any division or multiplication operations such as in minimum delay-self clocked fair queuing (MD-SCFQ). Compared to MD-SCFQ, EFQs have lower complexity and can be easily implemented on chips. We verify the effectiveness of the proposed EFQs through theoretical analysis and give some simulation results

Keywords

computational complexity; packet switching; quality of service; queueing theory; scheduling; EFQ; MD-SCFQ; QoS; WFQ; complexity; delay properties; effective fair queuing algorithms; fairness properties; minimum delay-self clocked fair queuing; packet scheduling algorithm; simulation results; system potential function; worst-case fair weighted fair queuing; Bandwidth; Delay; Electronic mail; Finishing; Global Positioning System; Laboratories; Processor scheduling; Quality of service; Scheduling algorithm; Telecommunication switching;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 2000. (ICON 2000). Proceedings. IEEE International Conference on

Print_ISBN

0-7695-0777-8

Type

conf

DOI

10.1109/ICON.2000.875804

Filename

875804