ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지

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

  • Received : 2002.08.02
  • Published : 2003.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  1. Proc. of the IEEE v.83 no.10 Service Disciplines for Guaranteed Performance Service in PacketSwitching Networks Zhang, H
  2. ACM Trans. on Computer Systems v.9 no.2 Virtual Clock: A New Traffic Control Algorithm for Packet Switching Zhang, L.
  3. IEEE JSAC v.9 Weighted round-robin cell multiplexing in a general-purpose ATM switch chip Katevenis, M.;Sidiropoulos, S.;Courcoubetis, C.
  4. Proc. of ACM SIGCOMM'95 Efficient Fair Queuing Using deficit round robin Shreedhar, M.;Varghese, G.
  5. Proc. of Tricomm'91 Guaranteeing Delay Jitter Bounds in Packet Switching Networks Verma, D;Zhang, H;Ferrari, D.
  6. Proc. of IEEE GLOBECOM Rate Controlled Servers for Very High-Speed Networks Kalmanek, C.;Morgan, S.;Restrick, R.C.
  7. IEEE JSAC v.9 AFraming Strategy for Congestion Management Golestani, S.
  8. Proc.ofACM SIGCOMM'91 Comparison of Rate-Based Service Disciplines Zhang, H.;Keshav, S.
  9. Proc. of IEEE INFOCOM'92 v.2 A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case Parekh, A.K.;Gallager, R.G.
  10. Proc. of IEEE INFOCOM '94 A Self-Clocked Fair Queuing Scheme for Broadband Applications Golestani, S.J.
  11. IEEE/ACM Trans. Networking v.6 no.2 Efficient Fair Queuing Algorithms for Packet-Switched Networks Stiliadis, D.;Varma, A.
  12. Proc. of IEEE INFOCOM '97 v.1 A General Methodology for Designing Efficient Traffic Scheduling and Shaping Algorithms Stiliadis, D.;Varma, A.
  13. Proc. of IEEE INFOCOM '98 v.3 Minimum-Delay Self-Clocked Fair Queuing Algorithm for Packet-Switched Networks Chiussi, F.M.;Francini, A.
  14. Hot Interconnects v.9 A Family of ASIC Devices for Next Generation Distributed Packet Switches with QoS Supports for IP and ATM Chiussi, F.M.(et al.)
  15. IEEE/ACM Trans. Networking v.10 no.1 Proportional Differentiated Services: Delay Differentiation and Packet Scheduling Dovrolis, C.;Stiliadis, D.
  16. ETRI J. v.22 no.3 Rate Proportional SCFQ (RP-SCFQ) Algorithm for High-Speed Packet-Switched Networks Choi, Byung-Hwan;Park, Hong-Shik
  17. An ASIC Core for Pipelined Heap Management to Support Scheduling in High Speed Networks, FORTH-ICS / TR-278 Ioannou, Aggelos D.