Presentation 2004/2/26
Scheduling Algorithm with Low Complexity for Large VoIP Networks
Kohei ONO, Takuya ASAKA, Tatsuro TAKAHASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) VoIP need to transfer its packets with low delay bound. Waiting time at routers influences transfer time in the Internet. Thus we should improve scheduling algorithm for the purpose of transfering VoIP packets with low delay. DFQ scheduler algorithm is suitable for guaranteeing delay bound of VoIP packet, but the complexity of DFQ might be a bottleneck if many VoIP flows are going. In this paper, we propose DFQ with CSFQ(Core Stateless Fair Queueing), which reduces the complexity of DFQ with keeping maximum delay bound and the fairness of bandwidth allocation, and evaluate its performance.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) QoS / VoIP / scheduling algorithm / Maximum Delay Bound / DFQ
Paper # NS2003-267,IN2003-222
Date of Issue

Conference Information
Committee IN
Conference Date 2004/2/26(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 Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Scheduling Algorithm with Low Complexity for Large VoIP Networks
Sub Title (in English)
Keyword(1) QoS
Keyword(2) VoIP
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
3rd Author's Name Tatsuro TAKAHASHI
3rd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2004/2/26
Paper # NS2003-267,IN2003-222
Volume (vol) vol.103
Number (no) 691
Page pp.pp.-
#Pages 4
Date of Issue