Performance Evaluation of MulTCP in High-Speed Wide Area Networks

Nabeshima, Masayoshi

doi:10.1093/ietcom/e88-b.1.392

Cited by 6 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Accordingly, the congestion window size becomes (N − 1)W + 1 2 W = (1 − 1 2N )NW in MulTCP. For more general MulTCP [19], the parameter pair (a, b) can be tuned for generating a desired sending rate, as long as some relationship between a and b is satisfied. This relationship can be derived from following sending rate equations for TCP-like protocols using AIMD(a, b) [29]:…”

Section: Multcpmentioning

confidence: 99%

See 1 more Smart Citation

Probe-Aided MulTCP

Kuo

2008

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

a c m s i g c o m m ABSTRACT An aggregate congestion control mechanism, namely Probe-Aided MulTCP (PA-MulTCP), is proposed in this paper. It is based on MulTCP, a proposal for enabling an aggregate to emulate the behavior of multiple concurrent TCP connections. The objective of PA-MulTCP is to ensure the fair sharing of the bottleneck bandwidth between the aggregate and other TCP or TCP-friendly flows while keeping lightweightness and responsiveness. Unlike MulTCP, there are two congestion window loops in PA-MulTCP, namely the probe window loop and the adjusting window loop. The probe window loop constantly probes the congestion situation and the adjusting window loop dynamically adjusts the congestion window size for the arriving and departing flows within the aggregate.Our simulations demonstrate that PA-MulTCP is more stable and fairer than MulTCP over a wide range of the weight N in steady conditions as well as in varying congestion conditions. PA-MulTCP is also responsive to flow arrival/departure and thus reduces the latency of short-lived transfers. Furthermore, PA-MulTCP is lightweight, since it enjoys above advantages at the cost of only an extra probe window loop, which has a marginal influence on the implementation complexity. Finally, the design of PA-MulTCP decouples the congestion management from the other functionalities in the aggregate flow management. As a result, PA-MulTCP could be potentially applied to a wider range of scenarios, e.g. wireless TCP proxies, edge-to-edge overlays, QoS provisioning and mass data transport.

show abstract

Section: Multcpmentioning

confidence: 99%

“…It has been shown that a smaller value of a may help mitigate the aggressive behavior in MulTCP [19]. More details can be found in our report [17], where the effect of different values for the parameter (a, b) pair in the adjusting window loop was extensively investigated.…”

Section: Adjusting Window Loopmentioning

confidence: 99%

Probe-Aided MulTCP

Kuo

2008

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…The congestion avoidance algorithm starts to run if TCP in sender side is detect a packet dropping in network link, then TCP sets the value of slow-start threshold (ssthresh) to one-half of the current CWND size [1]. When the capacity of CWND becomes equal or less than the size of ssthresh, that means TCP transmitter side will be in slow-start mode and if its bigger than the ssthresh, then TCP must be in congestion avoidance mode, as shown in formula below [2]:…”

Section: Introductionmentioning

confidence: 99%

K-means Clustering, Unsupervised Classification, K-NN, Euclidean Distance, Genetic Algorithm

Rashid¹

2023

Tikrit J. Pure Sci.

View full text Add to dashboard Cite

In recent days, the need to provide reliable data transmission over Internet traffics or cellular mobile systems becomes very important. Transmission Control Protocol (TCP) represents the prevailing protocol that provide reliability to data transferring in all end-to-end data stream services on the Internet and many of new networks. TCP congestion control has become the key factor manipulating the behavior and performance of the networks. TCP sender can regulates the size of the congestion window (CWND) using the congestion control mechanism and TCP dynamically adjust the window size depending on the packets acknowledgment (ACK) or by indicates the packets losses when occur. TCP congestion control includes two main phases, slow-start and congestion avoidance and these two phases even work separately, but the combination of them controls CWND and the packet injection to the network pipe. Congestion avoidance and slow-start are liberated mechanisms and using unlike objectives, but if the congestion happens, they are executed together. This article provides an efficient and reliable congestion avoidance mechanism to enhancing the TCP performance in large-bandwidth low-latency networks. The proposed mechanism also includes a facility to send multiple flows over same connection with a novel technique to estimate the number of available flows dynamically, where the all experiments to approving the proposed techniques are performed over the network simulation NS-2.

show abstract

“…In order to gain N times throughput that of a single TCP Reno session, the TCP-FIT [8] sets a=N and b= 2 3N+1 . Actually, this modification was firstly proposed in [11]. But the N can be adjusted dynamically according to the end-to-end queuing delay in [8].…”

Section: Introductionmentioning

confidence: 99%

CLTCP: An Adaptive TCP Congestion Control Algorithm Based on Congestion Level

Jiang

Jin

2015

IEEE Commun. Lett.

View full text Add to dashboard Cite

The Transmission Control Protocol (TCP) has been profusely used by diverse applications such as FTP, email and HTTP. In recent decades, numerous TCP variants have been developed to fit the fast increasing of network capacities and improve the performance of TCP algorithms in various scenarios especially in the high bandwidth-delay product (high-BDP) and lossy networks. Although the performance improvements are different for different TCP under different networking conditions, implementing a new congestion control algorithm that is suitable for a wide range of network conditions is still a challenge. In this paper, we propose a novel scheme, the Congestion Level based TCP (CLTCP), which could perform effectively in both high-BDP and lossy networks. Different from the TCP-FIT, the CLTCP doesn't use the delay variation but the congestion level as a signal to control the number of virtual parallel flows in a TCP connection. This could avoid the influence of the delay measurement error in the TCP-FIT. Extensive experiments in NS-2 show that the performance of the CLTCP is significantly improved as compared to other state-of-the-art algorithms, while maintaining good fairness.Index Terms-Virtual parallel TCP, congestion level, high bandwidth-delay product network, lossy network.

show abstract

Performance Evaluation of MulTCP in High-Speed Wide Area Networks

Cited by 6 publications

References 12 publications

Probe-Aided MulTCP

Probe-Aided MulTCP

K-means Clustering, Unsupervised Classification, K-NN, Euclidean Distance, Genetic Algorithm

CLTCP: An Adaptive TCP Congestion Control Algorithm Based on Congestion Level

Contact Info

Product

Resources

About