• Title/Summary/Keyword: TCP Congestion Control

Search Result 289, Processing Time 0.04 seconds

Energy Efficient Congestion Control Scheme in Ad-hoc Networks (Ad-hoc 통신망의 에너지 효율적인 혼잡 제어 기법)

  • Cho, Nam-Ho;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.369-379
    • /
    • 2006
  • In recent years, there have been many researches about Ad-hoc Networks which is available to communicate freely between mobile devices by using multi-hop without any support of relay base or access point. TCP that used the most widely transport protocol in the Internet repeats packet loss and retransmission because it increases congestion window size by using reactive congestion control until packet loss occurs. As a result of this, energy of mobile device is wasted unnecessarily. In this paper, we propose TCP-New Veno in order to improve the energy efficiency of mobile device. According to the state of network, the scheme adjusts appropriate size of congestion window. Therefore, the energy efficiency of mobile device and utilization of bandwidth are improved by the scheme. From the simulation by using ns-2, we could see more improved energy efficiency with TCP-New Veno than those with TCP in Ad-hoc Networks.

Active Congestion Control Using Active Router′s Feedback Mechanism (액티브 라우터의 피드백 메커니즘을 이용한 혼잡제어 기법)

  • Choe, Gi-Hyeon;Jang, Gyeong-Su;Sin, Ho-Jin;Sin, Dong-Ryeol
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.513-522
    • /
    • 2002
  • Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

A Study on the High Performance TCP over Various Communication Links (다양한 통신 링크에서 고성능 TCP에 관한 연구)

  • Kim, Sang-Mi;Choe, Seon-Wan;Han, Seon-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.197-212
    • /
    • 2002
  • Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

Implementation of TCP-Friendly Internet Video Phone (TCP-Friendly Internet Video Phone의 구현)

  • 이소현;최태욱;박성호;강정구;정기동
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.433-435
    • /
    • 2001
  • 인터넷상에서 화상전화를 구현할 경우, 대용량의 멀티미디어 데이터의 전송은 네트웍 congestion의 원인이 될 수 있다. 이러한 congestion이 일어날 경우, congestion avoidance 알고리즘을 적용하는 TCP 데이터는 스스로 전송률을 줄이게 되므로, congestion 정책을 사용하지 않는 UDP 패킷과 같은 데이터와 함께 전송될 경우, TCP 데이터에 불리하게 된다. 이때, UDP 패킷 데이터에 TCP와 유사한 방법의 congestion avoidance 알고리즘을 적용하여 이를 해결할 수 있는데, 이것은 TCP-friendly Adaptation 알고리즘이다. 본 논문에서는 인터넷 화상전화의 구현에 대해 기술하고 인터넷 환경에서 화성전화를 사용할 때에 congestion을 control 하기 위해서, 그 출력 대역폭을 네트웍 상태에 따라 TCP와 유사한 방식으로 조절하는 TCP-friendly Adaptation 알고리즘을 적용한다.

NJ+: An Efficient Congestion Control Mechanism for Wireless Networks

  • Lee, Jae-Hyung;Kim, Jung-Rae;Park, Min-U;Koo, Ja-Hwan;Choo, Hyun-Seung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.6
    • /
    • pp.333-351
    • /
    • 2008
  • Transmission control protocols have to overcome common problems in wireless networks. TCP employing both packet loss discrimination mechanism and available bandwidth estimation algorithm, known as the good existing solution, shows significant performance enhancement in wireless networks. For instance, TCP New Jersey which exhibits high throughput in wireless networks intends to improve TCP performance by using available bandwidth estimation and congestion warning. Even though it achieves 17% and 85% improvements in terms of goodput over TCP Westwood and TCP Reno, respectively, we further improve it by exploring maximized available bandwidth estimation, handling bit-error-rate error recovery, and effective adjustment of sending rate for retransmission timeout. Hence, we propose TCP NJ+, showing that for up to 5% packet loss rate, it outperforms other TCP variants by 19% to 104% in terms of goodput when the network is in bi-directional background traffic.

Improving the TCP Retransmission Timer Adjustment Mechanism for Constrained IoT Networks

  • Chansook Lim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.29-35
    • /
    • 2024
  • TCP is considered as one of the major candidate transport protocols even for constrained IoT networks..In our previous work, we investigated the congestion control mechanism of the uIP TCP. Since the uIP TCP sets the window size to one segment by default, managing the retransmission timer is the primary approach to congestion control. However, the original uIP TCP sets the retransmission timer based on the fixed RTO, it performs poorly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe. In our previous work, we proposed a TCP retransmission timer adjustment scheme for uIP TCP which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Although our previous work showed that the proposed retransmission timer adjustment scheme can improve performance, we observe that the scheme often causes a node to set the retransmission timer for an excessively too long time period. In this work, we show that slightly modifying the dithering mechanism of the previous scheme is effective for improving TCP fairness.

Performance Improvement of WTCP by Differentiated Handling of Congestion and Random Loss (혼잡 및 무선 구간 손실의 차별적 처리를 통한 WTCP 성능 개선)

  • Cho, Nam-Jin;Lee, Sung-Chang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.9
    • /
    • pp.30-38
    • /
    • 2008
  • The traditional TCP was designed assuming wired networks. Thus, if it is used networks consisting of both wired and wireless networks, all packet losses including random losses in wireless links are regarded as network congestion losses. Misclassification of packet losses causes unnecessary reduction of transmission rate, and results in waste of bandwidth. In this paper, we present WTCP(wireless TCP) congestion control algorithm that differentiates the random losses more accurately, and adopts improved congestion control which results in better network throughput. To evaluate the performance of proposed scheme, we compared the proposed algorithm with TCP Westwood and TCP Veno via simulations.

A Window-Based Congestion Control Algorithm for Wireless TCP in Heterogeneous Networks

  • Byun, Hee-Jung;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.474-479
    • /
    • 2004
  • This paper describes a feedback-based congestion control algorithm to improve TCP performance over wireless network. In this paper, we adjust the packet marking probability at the router for Max-Min fair sharing of the bandwidth and full utilization of the link. Using the successive ECN (Explicit Congestion Notification), the proposed algorithm regulates the window size to avoid the congestion and sees the packet loss only due to the wireless link error. Based on the asymptotic analysis, it is shown that the proposed algorithm guarantees the QoS of the wireless TCP. The effectiveness of the proposed algorithm is demonstrated by simulations.

  • PDF

TCP Congestion Control Using EWLN in Wireless Networks (무선환경에서 EWLN을 이용한 TCP 혼잡제어)

  • Joh, Hang-Ki;Choi, Seung-Jun;Kim, Seok-Hoon;Ryoo, In-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.2
    • /
    • pp.241-247
    • /
    • 2011
  • Most of network congestions are caused by TCP packet losses in the wired network ecosystems. On the contrary, high BER (Bit Error Rate), which is characteristic of the wireless networks, is a main factor in wireless network environments. Many wireless networks carry out the congestion control mechanisms frequently because they estimate that packet losses are not due to the wireless signal qualities but the congestion controls in their networks. To solve this problem, we propose the improved EWLN (Explicit Wireless Loss Notification) algorithm that more efficiently utilize the congestion window size to increase the wireless network throughput than legacy EWLN algorithm.

Congestion Control Scheme for Multimedia Streaming Service in Broadband Wireless Networks (광대역 무선 네트워크에서 멀티미디어 스트리밍 서비스를 위한 혼잡 제어 기법)

  • Lee, Eun-Jae;Chung, Kwang-Sue
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2553-2562
    • /
    • 2013
  • It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.