For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling
Jaesung CHOI Myungwhan CHOI
IEICE TRANSACTIONS on Communications
Publication Date: 2007/09/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
fair queueing, scheduling, SCFQ, CBFQ,
Full Text: PDF>>
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.