Medium Starting Potential Fair Queueing for High-Speed Networks(Network)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proposes an efficient fair queuing algorithm, called Medium Starting Potential Fair Queuing (MSPFQ), which has O(1) complexity for the virtual time computation while it has delay and fairness properties similar to Starting-Potential Fair Queueing (SPFQ). The key idea of MSPFQ algorithm is that it recalihrates the system virtual time to the medium value of the minimum possihie virtual start times of HOL packets in each backlogged session. We show that MSPFQ belongs to the class of Rate-Proportional Server (RPS). In addition, we analytically prove that our algorithm has good delay and fairness properties.

• 社団法人電子情報通信学会の論文
• 2004-01-01

著者

• Park H‐s

  Information And Communication Univ. Daejeon Kor

• PARK Hong-Shik

  School of Engineering, Information and Communications University

• Park Hong-shik

  School Of Engineering Information And Communication University

• KWAK Dong-Yong

  ETRI

• KO Nam-Seok

  ETRI

• Kwak D‐y

  Etri Gajeong-dong Yuseong-gu Daejeon

• Ko Nam-seok

  Etri Gajeong-dong Yuseong-gu Daejeon

• Park Hong-shik

  School Of Engineering Icu (information And Communications Univ.)

関連論文

• Performance Evaluation and Fairness Improvement of TCP over ATM GFR in FIFO-Based Mechanisms
• Policing and Spacing of Multiplexed ATM Traffic
• Shared Sub-Path Protection with Overlapped Protection Areas in WDM Networks(Network Management/Operation)
• Establishment of Protection Paths Using Maximum Degree of Sharing in WDM Networks
• Medium Starting Potential Fair Queueing for High-Speed Networks(Network)
• Medium Starting Potential Fair Queueing for High-Speed Networks
• Enhanced Class-of-Service Oriented Packet Scheduling Scheme for EPON Access Networks
• Global Traffic Control in ATM Networks
• Emulated Weighted Fair Queueing Algorithm for High-Speed Packet-Switched Networks

スポンサーリンク