Title :
SWFQ: a simple weighted fair queueing scheduling algorithm for high-speed packet switched network
Author :
Wang, Chonggang ; Long, Keping ; Gong, Xiangyang ; Cheng, Shiduan
Author_Institution :
Lab. of Switching Technol. & Telecommun. Networks, Beijing Univ. of Posts & Telecommun., China
Abstract :
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 function does not require such division or multiplication operations as in MD-SCFQ. Compared with MD-SCFQ, SWFQ has lower complexity and can be easily implemented in chips. We verify the effectivity of proposed SWFQ through strict theoretical analysis
Keywords :
computational complexity; computer networks; packet switching; queueing theory; scheduling; RPS model; SWFQ; complexity; high-speed packet switched network; simple weighted fair queueing scheduling algorithm; system potential function; Application software; Clocks; Computer networks; Delay; Finishing; Global Positioning System; Packet switching; Processor scheduling; Scheduling algorithm; Telecommunication switching;
Conference_Titel :
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location :
Helsinki
Print_ISBN :
0-7803-7097-1
DOI :
10.1109/ICC.2001.936551
