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 proceedingConference 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 languageEnglish
Title of host publication1999 Internet Workshop, IWS 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages137-144
Number of pages8
ISBN (Electronic)0780359259, 9780780359253
DOIs
Publication statusPublished - 1999 Jan 1
Externally publishedYes
Event1999 Internet Workshop, IWS 1999 - Suita, Osaka, Japan
Duration: 1999 Feb 181999 Feb 20

Publication series

Name1999 Internet Workshop, IWS 1999

Conference

Conference1999 Internet Workshop, IWS 1999
CountryJapan
CitySuita, Osaka
Period99/2/1899/2/20

ASJC Scopus subject areas

  • Information Systems and Management
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Comparisons of packet scheduling algorithms for fair service among connections'. Together they form a unique fingerprint.

Cite this