Comparisons of packet scheduling algorithms for fair service among connections

Takahiro Matsuo; Go Hasegawa; Masayuki Murata; Hideo Miyahara

doi:10.1109/IWS.1999.811005

Comparisons of packet scheduling algorithms for fair service among connections

Takahiro Matsuo, Go Hasegawa, Masayuki Murata, Hideo Miyahara

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

We investigate the performance of TCP under several packet scheduling algorithms at the router. Our main focus is how fair service can be provided for elastic applications sharing the link capacity. For this purpose, we consider the following three packet scheduling algorithms; FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines the RED and DRR algorithm in order to prevent an unfairness property of the original DRR algorithm.

Original language	English
Title of host publication	1999 Internet Workshop, IWS 1999
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	137-144
Number of pages	8
ISBN (Electronic)	0780359259, 9780780359253
DOIs	https://doi.org/10.1109/IWS.1999.811005
Publication status	Published - 1999 Jan 1
Externally published	Yes
Event	1999 Internet Workshop, IWS 1999 - Suita, Osaka, Japan Duration: 1999 Feb 18 → 1999 Feb 20

Publication series

Name	1999 Internet Workshop, IWS 1999

Conference

Conference	1999 Internet Workshop, IWS 1999
Country/Territory	Japan
City	Suita, Osaka
Period	99/2/18 → 99/2/20

ASJC Scopus subject areas

Information Systems and Management
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1109/IWS.1999.811005

Cite this

Comparisons of packet scheduling algorithms for fair service among connections. / Matsuo, Takahiro; Hasegawa, Go; Murata, Masayuki; Miyahara, Hideo.

1999 Internet Workshop, IWS 1999. Institute of Electrical and Electronics Engineers Inc., 1999. p. 137-144 811005 (1999 Internet Workshop, IWS 1999).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Matsuo, T, Hasegawa, G, Murata, M & Miyahara, H 1999, Comparisons of packet scheduling algorithms for fair service among connections. in 1999 Internet Workshop, IWS 1999., 811005, 1999 Internet Workshop, IWS 1999, Institute of Electrical and Electronics Engineers Inc., pp. 137-144, 1999 Internet Workshop, IWS 1999, Suita, Osaka, Japan, 99/2/18. https://doi.org/10.1109/IWS.1999.811005

@inproceedings{dfd955cfa3704593b2f8cfc344982e87,

title = "Comparisons of packet scheduling algorithms for fair service among connections",

abstract = "We investigate the performance of TCP under several packet scheduling algorithms at the router. Our main focus is how fair service can be provided for elastic applications sharing the link capacity. For this purpose, we consider the following three packet scheduling algorithms; FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines the RED and DRR algorithm in order to prevent an unfairness property of the original DRR algorithm.",

author = "Takahiro Matsuo and Go Hasegawa and Masayuki Murata and Hideo Miyahara",

year = "1999",

month = jan,

day = "1",

doi = "10.1109/IWS.1999.811005",

language = "English",

series = "1999 Internet Workshop, IWS 1999",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "137--144",

booktitle = "1999 Internet Workshop, IWS 1999",

note = "1999 Internet Workshop, IWS 1999 ; Conference date: 18-02-1999 Through 20-02-1999",

}

TY - GEN

T1 - Comparisons of packet scheduling algorithms for fair service among connections

AU - Matsuo, Takahiro

AU - Hasegawa, Go

AU - Murata, Masayuki

AU - Miyahara, Hideo

PY - 1999/1/1

Y1 - 1999/1/1

N2 - We investigate the performance of TCP under several packet scheduling algorithms at the router. Our main focus is how fair service can be provided for elastic applications sharing the link capacity. For this purpose, we consider the following three packet scheduling algorithms; FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines the RED and DRR algorithm in order to prevent an unfairness property of the original DRR algorithm.

AB - We investigate the performance of TCP under several packet scheduling algorithms at the router. Our main focus is how fair service can be provided for elastic applications sharing the link capacity. For this purpose, we consider the following three packet scheduling algorithms; FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis results, we discuss the degree of achieved fairness in those scheduling algorithms. Furthermore, we propose a new algorithm which combines the RED and DRR algorithm in order to prevent an unfairness property of the original DRR algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0347147282&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347147282&partnerID=8YFLogxK

U2 - 10.1109/IWS.1999.811005

DO - 10.1109/IWS.1999.811005

M3 - Conference contribution

AN - SCOPUS:0347147282

T3 - 1999 Internet Workshop, IWS 1999

SP - 137

EP - 144

BT - 1999 Internet Workshop, IWS 1999

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1999 Internet Workshop, IWS 1999

Y2 - 18 February 1999 through 20 February 1999

ER -

Comparisons of packet scheduling algorithms for fair service among connections

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this