A simulation-based study of HighSpeed TCP and its deployment

Souza, Evandro de

doi:10.2172/813586

Cited by 8 publications

(6 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both RED and CHOKe have implantation for ns-2. We used the same parameter settings for both RED and CHOKe as suggested in [12] and described in Table 1.…”

Section: ) Network Topologymentioning

confidence: 99%

Fair Early Drop: An Active Queue Management Scheme for the Control of Unresponsive Flows

Aldabbagh¹,

Rio²,

Darwazeh³

2010

2010 10th IEEE International Conference on Computer and Information Technology

View full text Add to dashboard Cite

In this paper, we present the Fair Early Drop (FED) scheme which aims to prevent the unfairness problem generated by unresponsive flows and treat the various kinds of transport traffic "fairly". Unresponsive flows are managed by making sure they do not consume more than their fair share of network resources; that is, by dropping more packets from them. The dropping decision is simple with O(1) complexity. To reduce queuing delays, FED starts dropping packets once a flow exceeds its fair share of queuing space and does not wait until the queue is full to start dropping packets. FED has shown not only to be able to handle unresponsive traffic, but also to improve the fairness among TCP connections, maximize link utilization and minimize jitter and queuing delay.Keyword-core network: fairness; active queue management; bandwidth; interaction of TCP and UDP

show abstract

“…Both RED and CHOKe have implantation for ns-2. We used the same parameter settings for both RED and CHOKe as suggested in [12] and described in Table 1.…”

Section: ) Network Topologymentioning

confidence: 99%

Fair Early Drop: An Active Queue Management Scheme for the Control of Unresponsive Flows

Aldabbagh¹,

Rio²,

Darwazeh³

2010

2010 10th IEEE International Conference on Computer and Information Technology

View full text Add to dashboard Cite

show abstract

“…Considering the long RTPD of a satellite link (about 500ms), it is more likely that HSCC algorithms are triggered when flows pass through satellite network. But the existing HSCC algorithms are normally evaluated on highly reliable network pipes with high bandwidth and moderate RTPD (≤400ms) with the focus on their efficiency, convergence, RTT fairness, and friendliness to long-lived TCP flows [8][9] [10][11] [12]. Except [9] and [12], these algorithms are also evaluated without large amount of HTTP sessions as background traffic.…”

Section: Introductionmentioning

confidence: 99%

Effects of Applying High-Speed Congestion Control Algorithms in Satellite Network

Chan

Ananda

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-In recent years, many high-speed congestion control (HSCC) algorithms have been proposed for utilizing network pipes with huge bandwidth-delay product (BDP), and some of them have also been implemented in popular operating systems. Considering the extremely long round trip propagation delay (RTPD) of satellite network, it is very likely that these algorithms are triggered when TCP flows pass through satellite network. But the existing algorithms are normally evaluated on network pipes with high bandwidth and moderate RTPD (≤400ms). This paper is an attempt to study these algorithms on a simulated satellite network with moderate bandwidth and extremely long RTPD. Their effects on the existing applications, especially World Wide Web (WWW) and the emerging streaming applications, are emphasized. Different queue sizes are also used in simulation with the aim of investigating how to provision satellite link's queue for well accommodating flows driven by HSCC algorithms.Through this study, we find that Compound-TCP, Cubic-TCP, and H-TCP can not work well on satellite network. Currently, satellite link should use moderate queue size for accommodating flows driven by HSCC algorithms. As for end hosts, when they find that round trip time (RTT) is very long, HS-TCP should be adopted for high throughput while avoiding to hurt the existing applications as little as possible.

show abstract

“…These works mainly deal with the performance of a new proposal or the interaction of standard TCP (Reno) and the new mechanism. In [10], [II], a simulation-based performance analysis of HighSpeed TCP is presented and the fairness to regular TCP is analyzed. In [2], the author deals with the performance of Scalable TCP and analyzes the aggregate throughput of the standard TCP and Scalable TCP based on an experimental comparison.…”

Section: Introductionmentioning

confidence: 99%

Understanding the impacts of short-term dynamics on long-term fairness of competing high speed TCP flows: A root-cause analysis

Sonkoly¹,

Trinh²,

Molnár³

2008

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium

View full text Add to dashboard Cite

The short-term dynamics of competing high speed TCP flows can have strong impacts on their long-term fairness.This leads to severe problems for both the co-existence and the deployment feasibility of different proposals for the next generation networks. However, to our best knowledge, no root cause analysis of the observation is available. In this paper, we try to fill this gap by providing an in-depth root-cause analysis of this phenomenon. We demonstrate that the widely used Jain's index as a fairness metric can not provide sufficient characterization of the phenomena. More precisely, Jain's index does not reflect the dynamic flow behaviors, e.g., starting time of the flows.We provide an analytical and simulation study to show the importance of the flow dynamics on fairness. We also propose a new metric called saturation time for fairness characterization.Both AIMD-based (HighSpeed TCP, BIC TCP) and MIMD based (Scalable TCP) TCP versions are investigated in different topologies, namely dumb-bell and parking-lot topologies. In extreme cases, we also analyze and explain the "starving" effect of competing high speed TCP flows, when a flow forces other flows to deviate from their proper operation.

show abstract

A simulation-based study of HighSpeed TCP and its deployment

Cited by 8 publications

References 47 publications

Fair Early Drop: An Active Queue Management Scheme for the Control of Unresponsive Flows

Fair Early Drop: An Active Queue Management Scheme for the Control of Unresponsive Flows

Effects of Applying High-Speed Congestion Control Algorithms in Satellite Network

Understanding the impacts of short-term dynamics on long-term fairness of competing high speed TCP flows: A root-cause analysis

Contact Info

Product

Resources

About