Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling
Summary :
Self-Clocked Fair Queueing (SCFQ) and Credit-Based Fair Queueing (CBFQ) are well-known fair scheduling schemes for packet-switched network. In this paper, it is shown that SCFQ and CBFQ are equivalent in selecting packets to transmit. For this, we modified the per-packet service tag based SCFQ algorithm to an equivalent per-session service tag based algorithm, SCFQ+, and showed that the service tags for SCFQ+ and CBFQ evolve identically.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.9 pp.2592-2595
- Publication Date
- 2007/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.9.2592
- 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
Jaesung CHOI, Myungwhan CHOI, "Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 9, pp. 2592-2595, September 2007, doi: 10.1093/ietcom/e90-b.9.2592.
Abstract: Self-Clocked Fair Queueing (SCFQ) and Credit-Based Fair Queueing (CBFQ) are well-known fair scheduling schemes for packet-switched network. In this paper, it is shown that SCFQ and CBFQ are equivalent in selecting packets to transmit. For this, we modified the per-packet service tag based SCFQ algorithm to an equivalent per-session service tag based algorithm, SCFQ+, and showed that the service tags for SCFQ+ and CBFQ evolve identically.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.9.2592/_p
Copy
@ARTICLE{e90-b_9_2592,
author={Jaesung CHOI, Myungwhan CHOI, },
journal={IEICE TRANSACTIONS on Communications},
title={Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling},
year={2007},
volume={E90-B},
number={9},
pages={2592-2595},
abstract={Self-Clocked Fair Queueing (SCFQ) and Credit-Based Fair Queueing (CBFQ) are well-known fair scheduling schemes for packet-switched network. In this paper, it is shown that SCFQ and CBFQ are equivalent in selecting packets to transmit. For this, we modified the per-packet service tag based SCFQ algorithm to an equivalent per-session service tag based algorithm, SCFQ+, and showed that the service tags for SCFQ+ and CBFQ evolve identically.},
keywords={},
doi={10.1093/ietcom/e90-b.9.2592},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling
T2 - IEICE TRANSACTIONS on Communications
SP - 2592
EP - 2595
AU - Jaesung CHOI
AU - Myungwhan CHOI
PY - 2007
DO - 10.1093/ietcom/e90-b.9.2592
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2007
AB - Self-Clocked Fair Queueing (SCFQ) and Credit-Based Fair Queueing (CBFQ) are well-known fair scheduling schemes for packet-switched network. In this paper, it is shown that SCFQ and CBFQ are equivalent in selecting packets to transmit. For this, we modified the per-packet service tag based SCFQ algorithm to an equivalent per-session service tag based algorithm, SCFQ+, and showed that the service tags for SCFQ+ and CBFQ evolve identically.
ER -
English
