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

doi:10.1007/11516798_12

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

情報工学科

研究成果: Conference article › 査読

6 被引用数 (Scopus)

抄録

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.

本文言語	English
ページ（範囲）	169-183
ページ数	15
ジャーナル	Lecture Notes in Computer Science
巻	3544
DOI	https://doi.org/10.1007/11516798_12
出版ステータス	Published - 2005 1 1
イベント	8th International Conference on Principles of Distributed Systems, OPODIS 2004 - Grenoble, France 継続期間: 2004 12 15 → 2004 12 17

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

文献へのアクセス

10.1007/11516798_12

フィンガープリント「SRF TCP: A TCP-friendly and fair congestion control method for high-speed networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル

@article{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",

month = jan,

day = "1",

doi = "10.1007/11516798_12",

language = "English",

volume = "3544",

pages = "169--183",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "8th International Conference on Principles of Distributed Systems, OPODIS 2004 ; Conference date: 15-12-2004 Through 17-12-2004",

}

TY - JOUR

T1 - SRF TCP

T2 - 8th International Conference on Principles of Distributed Systems, OPODIS 2004

AU - Fukuhara, Masahiko

AU - Hirose, Fumiaki

AU - Hatano, Tomoya

AU - Shigeno, Hiroshi

AU - Okada, Ken Ichi

PY - 2005/1/1

Y1 - 2005/1/1

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

U2 - 10.1007/11516798_12

DO - 10.1007/11516798_12

M3 - Conference article

AN - SCOPUS:26444603804

VL - 3544

SP - 169

EP - 183

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

Y2 - 15 December 2004 through 17 December 2004

ER -