Dukkipati et al 2005a - Revision history

Scipediacontent at 14:33, 21 January 2021

2021-01-21T14:33:38Z

Scipediacontent: Scipediacontent moved page Draft Content 468042286 to Dukkipati et al 2005a

2020-10-14T11:08:45Z

Scipediacontent moved page Draft Content 468042286 to Dukkipati et al 2005a

Scipediacontent: Created page with " == Abstract == Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach lead..."

2020-10-14T11:08:42Z

Created page with " == Abstract == Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach lead..."

New page

== Abstract ==

Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and prevents long flows from hogging resources. For example, if a set of flows with the same round trip time share a bottleneck link, TCPs congestion control mechanism tries to achieve PS; so do most of the proposed alternatives, such as eXplicit Control Protocol (XCP). But although they emulate PS well in a static scenario when all flows are long-lived, they do not come close to PS when new flows arrive randomly and have a finite amount of data to send, as is the case in todays Internet. Typically, flows take an order of magnitude longer to complete with TCP or XCP than with PS, suggesting large room for improvement. And so in this paper, we explore how a new congestion control algorithm Rate Control Protocol (RCP) comes much closer to emulating PS over a broad range of operating conditions. In RCP, a router assigns a single rate to all flows that pass through it. The router does not keep flow-state, and does no per-packet calculations. Yet we are able to show that under a wide range of traffic characteristics and network conditions, RCPs performance is very close to ideal processor sharing.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_468042286-beopen297-5940-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.1007/11499169_22 http://dx.doi.org/10.1007/11499169_22]

* [http://yuba.stanford.edu/~nanditad/RCP-IWQoS.pdf http://yuba.stanford.edu/~nanditad/RCP-IWQoS.pdf]

@@ Line 2: / Line 2: @@
 == Abstract ==
-Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and prevents long flows from hogging resources. For example, if a set of flows with the same round trip time share a bottleneck link, TCPs congestion control mechanism tries to achieve PS; so do most of the proposed alternatives, such as eXplicit Control Protocol (XCP). But although they emulate PS well in a static scenario when all flows are long-lived, they do not come close to PS when new flows arrive randomly and have a finite amount of data to send, as is the case in todays Internet. Typically, flows take an order of magnitude longer to complete with TCP or XCP than with PS, suggesting large room for improvement. And so in this paper, we explore how a new congestion control algorithm  Rate Control Protocol (RCP)  comes much closer to emulating PS over a broad range of operating conditions. In RCP, a router assigns a single rate to all flows that pass through it. The router does not keep flow-state, and does no per-packet calculations. Yet we are able to show that under a wide range of traffic characteristics and network conditions, RCPs performance is very close to ideal processor sharing.
+Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and prevents long flows from hogging resources. For example, if a set of flows with the same round trip time share a bottleneck link, TCPâs congestion control mechanism tries to achieve PS; so do most of the proposed alternatives, such as eXplicit Control Protocol (XCP). But although they emulate PS well in a static scenario when all flows are long-lived, they do not come close to PS when new flows arrive randomly and have a finite amount of data to send, as is the case in todayâs Internet. Typically, flows take an order of magnitude longer to complete with TCP or XCP than with PS, suggesting large room for improvement. And so in this paper, we explore how a new congestion control algorithm â Rate Control Protocol (RCP) â comes much closer to emulating PS over a broad range of operating conditions. In RCP, a router assigns a single rate to all flows that pass through it. The router does not keep flow-state, and does no per-packet calculations. Yet we are able to show that under a wide range of traffic characteristics and network conditions, RCPâs performance is very close to ideal processor sharing.
-−
-Document type: Part of book or chapter of book
-−
-== Full document ==
-<pdf>Media:Draft_Content_468042286-beopen297-5940-document.pdf</pdf>
@@ Line 17: / Line 12: @@
 * [http://yuba.stanford.edu/~nanditad/RCP-IWQoS.pdf http://yuba.stanford.edu/~nanditad/RCP-IWQoS.pdf]

← Older revision	Revision as of 11:08, 14 October 2020
(No difference)