SRF TCP

A TCP-friendly and fair congestion control method for high-speed networks

Masahiko Fukuhara, Fumiaki Hirose, Tomoya Hatano, Hiroshi Shigeno, Ken Ichi Okada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

TCP Reno congestion control carries two issues. First, its performance is poor in high-speed networks. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Second, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many approaches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. In this paper, we propose Square Root Fair TCP (SRF TCP). SRF TCP congestion control (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of SRF TCP through computer simulations and compare it with TCP Reno, High-Speed TCP and Scalable TCP.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsT. Higashino
Pages169-183
Number of pages15
Volume3544
Publication statusPublished - 2005
Event8th International Conference on Principles of Distributed Systems, OPODIS 2004 - Grenoble, France
Duration: 2004 Dec 152004 Dec 17

Other

Other8th International Conference on Principles of Distributed Systems, OPODIS 2004
CountryFrance
CityGrenoble
Period04/12/1504/12/17

Fingerprint

HIgh speed networks
Bandwidth
Computer simulation

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Fukuhara, M., Hirose, F., Hatano, T., Shigeno, H., & Okada, K. I. (2005). SRF TCP: A TCP-friendly and fair congestion control method for high-speed networks. In T. Higashino (Ed.), Lecture Notes in Computer Science (Vol. 3544, pp. 169-183)

SRF TCP : A TCP-friendly and fair congestion control method for high-speed networks. / Fukuhara, Masahiko; Hirose, Fumiaki; Hatano, Tomoya; Shigeno, Hiroshi; Okada, Ken Ichi.

Lecture Notes in Computer Science. ed. / T. Higashino. Vol. 3544 2005. p. 169-183.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fukuhara, M, Hirose, F, Hatano, T, Shigeno, H & Okada, KI 2005, SRF TCP: A TCP-friendly and fair congestion control method for high-speed networks. in T Higashino (ed.), Lecture Notes in Computer Science. vol. 3544, pp. 169-183, 8th International Conference on Principles of Distributed Systems, OPODIS 2004, Grenoble, France, 04/12/15.
Fukuhara M, Hirose F, Hatano T, Shigeno H, Okada KI. SRF TCP: A TCP-friendly and fair congestion control method for high-speed networks. In Higashino T, editor, Lecture Notes in Computer Science. Vol. 3544. 2005. p. 169-183
Fukuhara, Masahiko ; Hirose, Fumiaki ; Hatano, Tomoya ; Shigeno, Hiroshi ; Okada, Ken Ichi. / SRF TCP : A TCP-friendly and fair congestion control method for high-speed networks. Lecture Notes in Computer Science. editor / T. Higashino. Vol. 3544 2005. pp. 169-183
@inproceedings{63ae2fd5b33d47c4b405ba10e6826d79,
title = "SRF TCP: A TCP-friendly and fair congestion control method for high-speed networks",
abstract = "TCP Reno congestion control carries two issues. First, its performance is poor in high-speed networks. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Second, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many approaches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. In this paper, we propose Square Root Fair TCP (SRF TCP). SRF TCP congestion control (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of SRF TCP through computer simulations and compare it with TCP Reno, High-Speed TCP and Scalable TCP.",
author = "Masahiko Fukuhara and Fumiaki Hirose and Tomoya Hatano and Hiroshi Shigeno and Okada, {Ken Ichi}",
year = "2005",
language = "English",
volume = "3544",
pages = "169--183",
editor = "T. Higashino",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - SRF TCP

T2 - A TCP-friendly and fair congestion control method for high-speed networks

AU - Fukuhara, Masahiko

AU - Hirose, Fumiaki

AU - Hatano, Tomoya

AU - Shigeno, Hiroshi

AU - Okada, Ken Ichi

PY - 2005

Y1 - 2005

N2 - TCP Reno congestion control carries two issues. First, its performance is poor in high-speed networks. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Second, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many approaches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. In this paper, we propose Square Root Fair TCP (SRF TCP). SRF TCP congestion control (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of SRF TCP through computer simulations and compare it with TCP Reno, High-Speed TCP and Scalable TCP.

AB - TCP Reno congestion control carries two issues. First, its performance is poor in high-speed networks. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both connections coexist. Second, TCP Reno connections share bandwidth unfairly, when TCP flows with different RTTs use the same link. Many approaches have been proposed to solve this issue. However, no single method has been proposed to solve both issues. In this paper, we propose Square Root Fair TCP (SRF TCP). SRF TCP congestion control (1) sends packets efficiently in high-speed networks, (2) is TCP-friendly with TCP Reno and (3) shares fair bandwidth between flows with different RTTs. We evaluate the capabilities of SRF TCP through computer simulations and compare it with TCP Reno, High-Speed TCP and Scalable TCP.

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

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

M3 - Conference contribution

VL - 3544

SP - 169

EP - 183

BT - Lecture Notes in Computer Science

A2 - Higashino, T.

ER -