Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity in the internet

Huaizhong Han; Srinivas Shakkottai; C. V. Hollot; R. Srikant; Don Towsley

doi:10.1109/TNET.2006.886738

Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity in the internet

Huaizhong Han, Srinivas Shakkottai, C. V. Hollot, R. Srikant, Don Towsley

Research output: Contribution to journal › Article › peer-review

Abstract

We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.

Original language	English (US)
Pages (from-to)	1260-1271
Number of pages	12
Journal	IEEE/ACM Transactions on Networking
Volume	14
Issue number	6
DOIs	https://doi.org/10.1109/TNET.2006.886738
State	Published - Dec 1 2006

Keywords

Congestion control
Multipath routing
Nyquist stability
Overlay networks

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/TNET.2006.886738

Fingerprint Dive into the research topics of 'Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity in the internet'. Together they form a unique fingerprint.

Cite this

@article{ae3eaa359daa4b43b024660508fba0e2,

title = "Multi-path TCP: A joint congestion control and routing scheme to exploit path diversity in the internet",

abstract = "We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.",

keywords = "Congestion control, Multipath routing, Nyquist stability, Overlay networks",

author = "Huaizhong Han and Srinivas Shakkottai and Hollot, {C. V.} and R. Srikant and Don Towsley",

year = "2006",

month = dec,

day = "1",

doi = "10.1109/TNET.2006.886738",

language = "English (US)",

volume = "14",

pages = "1260--1271",

journal = "IEEE/ACM Transactions on Networking",

issn = "1063-6692",

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

number = "6",

}

TY - JOUR

T1 - Multi-path TCP

T2 - A joint congestion control and routing scheme to exploit path diversity in the internet

AU - Han, Huaizhong

AU - Shakkottai, Srinivas

AU - Hollot, C. V.

AU - Srikant, R.

AU - Towsley, Don

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.

AB - We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme.

KW - Congestion control

KW - Multipath routing

KW - Nyquist stability

KW - Overlay networks

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

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

U2 - 10.1109/TNET.2006.886738

DO - 10.1109/TNET.2006.886738

M3 - Article

AN - SCOPUS:33947270258

VL - 14

SP - 1260

EP - 1271

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

ER -