IEICE Trans - Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling

Equivalence of SCFQ and CBFQ Schemes in Packet Scheduling

Jaesung CHOI
Myungwhan CHOI

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B    No.9    pp.2592-2595
Publication Date: 2007/09/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.9.2592
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
Keyword: 
fair queueing,  scheduling,  SCFQ,  CBFQ,  

Full Text: PDF(84.1KB)>>
Buy this Article


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.