Medium Starting Potential Fair Queueing for High-Speed Networks
Summary :
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 recalibrates the system virtual time to the medium value of the minimum possible 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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.1 pp.188-191
- Publication Date
- 2004/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Dong-Yong KWAK, Nam-Seok KO, Hong-Shik PARK, "Medium Starting Potential Fair Queueing for High-Speed Networks" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 1, pp. 188-191, January 2004, doi: .
Abstract: 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 recalibrates the system virtual time to the medium value of the minimum possible 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_1_188/_p
Copy
@ARTICLE{e87-b_1_188,
author={Dong-Yong KWAK, Nam-Seok KO, Hong-Shik PARK, },
journal={IEICE TRANSACTIONS on Communications},
title={Medium Starting Potential Fair Queueing for High-Speed Networks},
year={2004},
volume={E87-B},
number={1},
pages={188-191},
abstract={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 recalibrates the system virtual time to the medium value of the minimum possible 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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Medium Starting Potential Fair Queueing for High-Speed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 188
EP - 191
AU - Dong-Yong KWAK
AU - Nam-Seok KO
AU - Hong-Shik PARK
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2004
AB - 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 recalibrates the system virtual time to the medium value of the minimum possible 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.
ER -
English
