• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.571-580
• /
• 2005

In fast long-distance networks, TCP's congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them This paper presents a new window-based congestion control algorithm, called EM (Exponential Increase/ Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support last fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.12
• /
• pp.813-819
• /
• 2004

This paper infers two patterns of timeout from the characteristics of TCP Reno and confirms the existence of the patterns by conducting actual experiments. All timeouts can be classified into either of these patterns by using the history of RTT value. Based on the observed patterns, the paper proposes two algorithms to improve the performance of TCP Reno. Experimental results show that, when compared with TCP Reno, the proposed algorithms improve the bandwidth utilization by 3 to 12 percent. The paper provides good examples of how timeout-based and delay-based congestion control can efficiently work together.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.12-19
• /
• 2005

Reliable transport protocols such as TCP are tuned to Perform well in traditional networks where packet losses occur mainly because of congestion. In a wireless network, however, packet losses will occur more often due to reasons such as the high bit error rate and the handoff rather than due to congestion. When using TCP over wireless network, TCP responds to losses due to the high bit error rate and the handoff by invoking congestion control and avoidance algorithms, resulting in the degraded end-to-end performance in the wireless network. There have been several schemes for improving TCP performance over wireless links. Among them, SNOOP Is a very promising scheme because of the localized retransmission. In this thesis, an efficient scheme is proposed by modifying SNOOP scheme. The invocation of congestion control mechanism is now minimized by knowing the cause of packet loss.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.10
• /
• pp.18-25
• /
• 2000

In this paper, we analyze TCP congestion control algorithm over ATM-UBR network. TCP congestion control algorithm consists of slow start, congestion avoidance, fast recovery, fast retransmit. We analyze the ATM-UBR network service using the BSD 4.3 TCP Reno, Vanilla. However we found the fact that the characteristic of fast retransmit, recovery algorithm makes a serious degradation of Performance in multiple losses of packets. We propose new fast retransmit, recovery algorithm to improve the problem. The results of performance analysis improve the multiple losses of packets using a proposed fast retransmit, recovery algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.1
• /
• pp.10-18
• /
• 2007

In this paper, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of multiple time scale TCP is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. If source traffic is not extended exceeding, when RTT is 450ms, in self similar burst environment, performance gain of TCP-SSC is up to 45% for ${\alpha}$=1.05. However, its is acquired only 20% performance gain for ${\alpha}$=1.95 relatively. Therefore we showed that by TCP-MTS at large time scale into a rate-based feedback congestion control, we are able to improve two times performance significantly.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.8-17
• /
• 2006

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1352-1355
• /
• 2009

TCP에서 사용되는 혼잡제어(Congestion control)는 많은 이점이 있지만 그에 상응하는 단점이 존재한다. 가장 널리 사용되고 있는 TCP-Reno는 혼잡이 발생되면 혼잡 윈도우(Congestion Window)크기를 절반으로 줄이고 빠른 회복(fast recovery), 빠른 재전송(fast transmit)을 수행한다. 하지만 네트워크가 고속 네트워크로 접어들면서 효율적인 측면에서 이러한 기법들을 적용하기에는 문제가 따른다. 현재 사용되고 있는 TCP는 혼잡이 발생하면 선형적으로 점진적으로 증가 하기 때문에 많은 대역폭을 지원하는 고속 네트워크에서는 이러한 TCP의 혼잡 제어가 오히려 비 효율적이다. 본 논문에서는 이러한 문제점을 해결하기 위해 혼잡 윈도우 증가율을 추가한 혼잡제어 기법인 TCP-FBA(Fast Bandwidth Acquisition)를 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1384-1390
• /
• 2008

The TCP protocol is originally designed for wired network, however it performs very poor in wireless network due to different nature of wireless network from wired networks. In terms of TCP performance improvement in wireless Ad-hoc network, many researches show that small congestion window size of TCP connection can improve TCP performance. We propose a new TCP algorithm to improve TCP performance in wireless Ad-hoc network. The basic idea of our approach is that TCP receiver estimates the optimum window size and then sets congestion window limit of TCP sender to an optimum value by using the advertised window field in TCP ACK packet. From extensive computer simulation, the proposed algorithm shows superior performance than traditional TCP protocols in terms of packet delivery ratio and packet loss.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.297-312
• /
• 2005

The multimedia traffic of continuous video and audio data via streaming service accounts for a significant and expanding portion of the Internet traffic. This streaming data delivery is mostly based on RTP with UDP. However, UDP does not support congestion control. For this reason, UDP causes the starvation of congestion controlled TCP traffic which reduces its bandwidth share during overload situation. In this paper, we propose a new TCP-friendly rate control scheme called 'TF-RTP(TCP-Friendly RTP)'. In the congested network state, the TF-RTP exactly estimates the competing TCP's throughput by using the modified parameters. Then, it controls the sending rate of the video streams. Therefore, the TF-RTP adjusts its sending rate to TCP-friendly and fair share with competing TCP traffics. Through the simulation, we prove that the TF-RTP correctly estimates the TCP's throughput and improves the TCP-friendliness and fairness.