• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.351-359
• /
• 2006

In this article, we present a new slow-start variant, which improves the throughput of transmission control protocol (TCP) Vegas. We call this new mechanism Gallop-Vegas because it quickly ramps up to the available bandwidth and reduces the burstiness during the slow-start phase. TCP is known to send bursts of packets during its slow-start phase due to the fast window increase and the ACK-clock based transmission. This phenomenon causes TCP Vegas to change from slow-start phase to congestion-avoidance phase too early in the large bandwidth-delay product (BDP) links. Therefore, in Gallop-Vegas, we increase the congestion window size with a rate between exponential growth and linear growth during slow-start phase. Our analysis, simulation results, and measurements on the Internet show that Gallop-Vegas significantly improves the performance of a connection, especially during the slow-start phase. Furthermore, it is implementation feasible because only sending part needs to be modified.

• 대한공업교육학회지
• /
• v.33 no.2
• /
• pp.248-258
• /
• 2008

Current Internet uses HTTP (Hyper Text Transfer Protocol) as an application layer protocol and TCP (Transmission Control Protocol) as a transport layer protocol to provide web service. SCTP (Stream Control Transmission Protocol) is a recently proposed transport protocol with very similar congestion control mechanisms as TCP, except the initial congestion window during the slow start phase. In this paper, we present a mathematical model of object transfer latency during the slow start phase for HTTP over SCTP and compare with the latency of HTTP over TCP. Validation of the model using experimental result shows that the mean object transfer latency for HTTP over SCTP during the slow start phase is less than that for HTTP over TCP by 11%.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• 대한공업교육학회지
• /
• v.32 no.2
• /
• pp.199-216
• /
• 2007

Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1599-1609
• /
• 2014

TCP does not ensure the bandwidth and delay bound required for multimedia streaming services in broadband wireless network environments. In this paper, we propose a new congestion control scheme for efficient multimedia transmission, called COLO TCP (Concave Increase Slow Start Logarithmic Increase Congestion Avoidance TCP). The COLO TCP prevents the burst packet loss by applying the concave increase algorithm in slow start phase. In the congestion avoidance phase, COLO TCP uses the logarithmic increase algorithm that quickly recovers congestion window after packet loss. To highly utilize network bandwidth and reduce packet loss ratio, COLO TCP uses additive increase algorithm and adaptive decrease algorithm. Through simulation results, we prove that our COLO TCP is more robust for random loss. It is also possible for efficient multimedia transmission.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.229-234
• /
• 2004

In this study, the performance is compared between RFC compatible normal TCP and several speed constraints Ignored TCP. To do these, the main algorithms that constraints the transmit rate of TCP are modified. We have modified TCP protocol stack in a Linux kernel to compare the speeds between the standard TCP and our modified TCP. We find that if the destination is short distance away from the source and packet error is scarce then the speed differences between normal and modified TCP nay be negligible. However, if the destination is far away from the source and slow start algorithm is not adopted then the transfer time for small file is different greatly In addition, if packet error occurred frequently, our modified TCP is faster than the standard TCP regardless of distance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.346-347
• /
• 2012

네트워크의 안정성을 보장하면서 멀티미디어 스트리밍 서비스의 품질을 향상시키기 위해서 TFRC(TCP-Friendly Rate Control) 프로토콜이 제안되었다. 그러나 TFRC의 Slow-start 알고리즘은 TCP와 같이 가용대역폭을 초과하여 패킷을 전송하는 오버슈트 (Overshoot) 문제로 인해 스트리밍 비디오 화질을 열화시키는 패킷 손실을 발생시킨다. 본 논문에서는 TFRC의 오버슈트에 의한 패킷 손실을 줄이기 위한 Slow-start 알고리즘을 제안한다. 제안하는 알고리즘은 네트워크의 혼잡 정도에 따라서 전송률의 증가량을 감소시킴으로써 패킷 손실을 감소시켰다. 시뮬레이션을 통해서 제안하는 알고리즘이 기존의 Slowstart 알고리즘 보다 적은 패킷 손실을 발생시키는 것을 보였다.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.827-833
• /
• 2016

HTTP Adaptive Streaming (HAS) is a technique that adapts its video quality to network conditions for providing Quality of Experience. In the HAS approach, a video content is encoded at multiple bitrates and the encoded video content is divided into several video segments. A HAS player estimates the network bandwidth and adjusts the video bitrate based on estimated bandwidth. However, the segment scheduler in the conventional HAS player requests video segments periodically without considering TCP. If the waiting duration for the next segment request is quite long, the TCP connection can be initialized and it restarts slow-start. Slow-start causes the reduction in TCP throughput and consequentially leads to low-quality video streaming. In this study, we propose a TCP-aware segment scheduling scheme to improve performance of HAS service. The proposed scheme adjusts request time for the next video request to prevent initialization of TCP connection and also considers the point of scheduling time. The simulation proves that our scheme improves the Quality of Service of the HAS service without buffer underflow issue.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.211-213
• /
• 2013

TCP는 네트워크에서 손실 없이 데이터를 전송하는 전송 프로토콜이다. TCP는 전송 초기에 대역폭을 알지 못하는 상황에서 혼잡 윈도우의 지수적 증가를 통하여 전송하는 슬로우 스타트 단계를 수행한다. 지수적 증가의 특성으로 말미암아 폭주 가능성이 발생하고, 이는 네트워크의 변동성이 심할수록 가중된다. 본 논문에서는 이러한 문제점을 해결하기 위해 기존의 Hybrid Start 방법을 개선한 통계적 슬로우 스타트 방법을 제안하며 이를 통하여 TCP 성능을 개선한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1177-1185
• /
• 2000

In this paper, We report on the performance issues faced by TCP based applications on satellite link having long propagation delay and high probability of bit erros and propose ENA(Error Notification Ack) algorithm for TCP Performance Enhancement. TCP Protocol cannot distinguish errored segments(in noisy medium) from losses of genuine network congestion and react as if there is network congestion. Therefore, Slow Start and Congestion avoidance mechanism are initiated. It happen this case in satellite link. Therefore it reduce the transmission rate and drop the performance. So, in this paper We propose ENA algorithm which is distinguished errored segments from losses of network congestion. And We propose the method of algorithm's implementation. And We evaluate the Performance of Tahoe, Reno, Sack TCP with ENA. As results, TCP Performance is better.