Presentation 2004/7/9
Scheduling Algorithm with Low Complexity for Real-time Communication
Kohei ONO, Takuya ASAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In IP networks, real-time communication requires packet transfer with low delay. Waiting time at routers influences transfer time in IP networks. Thus we should improve scheduling algorithm in order to transfer packets of interactive flows with low delay. In this paper, we propose guaranteeing delay bound of packets by using DFQ (Decoupled Fair Queueing). In addition, RFQ (Rainbow Fair Queueing) enables routers to reduce the complexity of DFQ and distinguish packets of the same flow with different priority with keeping maximum delay bound and the fairness of bandwidth allocation. We evaluate the performance of this algorithm of DFQ with RFQ.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) QoS / realtime communication / scheduling algorithm / Maximum Delay Bound / DFQ
Paper # NS2004-80,RCS2004-116
Date of Issue

Conference Information
Committee NS
Conference Date 2004/7/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Scheduling Algorithm with Low Complexity for Real-time Communication
Sub Title (in English)
Keyword(1) QoS
Keyword(2) realtime communication
Keyword(3) scheduling algorithm
Keyword(4) Maximum Delay Bound
Keyword(5) DFQ
1st Author's Name Kohei ONO
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Takuya ASAKA
2nd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2004/7/9
Paper # NS2004-80,RCS2004-116
Volume (vol) vol.104
Number (no) 184
Page pp.pp.-
#Pages 4
Date of Issue