Presentation 2002/5/10
A Scheduling Algorithm for Input-Buffered Switches with QoS Guarantees
Chun-Xiang CHEN, Masaharu KOMATSU,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a scheduling algorithm for an input-buffered switch to provide the quality of service (QoS) guarantees for various traffic classes. This algorithm is based on the bandwidth reservation of each connections. The novelty of our scheduling algorithm is that it uniformly deals with various traffic classes without strict priority, and it is flexible to effectively use the remaining resources of the switch for any traffic pattern without starvation. By comparing with some well-known algorithms, the effectiveness of our scheduler in terms of throughput, packet delay and delay deviation, is clarified in simulation results.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) QoS guarantee / IB switch / scheduling algorithm
Paper # NS2002-38
Date of Issue

Conference Information
Committee NS
Conference Date 2002/5/10(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Scheduling Algorithm for Input-Buffered Switches with QoS Guarantees
Sub Title (in English)
Keyword(1) QoS guarantee
Keyword(2) IB switch
Keyword(3) scheduling algorithm
1st Author's Name Chun-Xiang CHEN
1st Author's Affiliation Information Processing Center, Hiroshima Prefectural University()
2nd Author's Name Masaharu KOMATSU
2nd Author's Affiliation Faculty of Engineering, Okayama University of Science
Date 2002/5/10
Paper # NS2002-38
Volume (vol) vol.102
Number (no) 53
Page pp.pp.-
#Pages 4
Date of Issue