A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity

• Published in: ETRI journal Vol. 25; no. 6; pp. 475 - 488
• Main Authors: Kwak, Dong‐Yong, Ko, Nam‐Seok, Kim, Bongtae, Park, Hong‐Shik
• Format: Journal Article
• Language: English
• Published: Taejon Electronics and Telecommunications Research Institute 01.12.2003
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer science; control theory; systems; Computer systems; Electronics; Exact sciences and technology; Fair queuing; Hardware; packet scheduling algorithm; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Theoretical computing; WFQ; Packet switching; Algorithmics; Scheduling; Algorithm; Computational complexity; Implementation; Scheduling algorithm; Computation time; Computer hardware; Algorithm performance; Queueing system; Virtual reality; Telecommunication network; System simulation; Delay time; Computer system; System analysis
• ISSN: 1225-6463; 2233-7326
• DOI: 10.4218/etrij.03.0102.0008

In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate‐proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head‐of‐line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.