• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1600-1610
• /
• 2015

While today's networks have been shown to exhibit HBDP (High Bandwidth Delay Product) characteristics, the legacy TCP increases the size of the congestion window slowly and decreases the size of the congestion window drastically such that it is not suitable for HBDP Networks. In order to solve this problem with the legacy TCP, many congestion control TCP mechanisms have been proposed. C-TCP (Compound-TCP) is a hybrid TCP which is a synergy of delay-based and loss-based approaches. C-TCP adapts the decreasing rate of the delay window without considering the congestion level, leading to degradation of performance. In this paper, we propose a new scheme to improve the performance of C-TCP. By controlling the increasing and decreasing rates according to the congestion level of the network, our proposed scheme can improve the bandwidth occupancy and fairness of C-TCP. Through performance evaluation, we show that our proposed scheme offers better performance in HBDP networks as compared to the legacy C-TCP.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.217-218
• /
• 2012

기기간(M2M, Machine-to-Machin) 통신의 한 응용으로서 스마트 그리드 네트워크는 다수의 기기 통신으로 인한 전송 데이터의 방대한 양을 대표적 특징으로 꼽을 수 있다. 이에 현재 사용가능한 통신 기술들을 그대로 사용할 경우, 병목현상 혹은 네트워크 혼잡 등 네트워크 장애 및 전송 지연이 발생할 수 있다. 특히 스마트 그리드 네트워크의 상향 트래픽은 시간조절이 가능한 주기적 미터링 데이터와 지연민감한 이벤트 데이터로 나뉜다. 이에 본 논문에서는 각 트래픽 특성에 따라 트래픽양의 대다수를 이룰 미터링 데이터의 전송시간 조절을 이용한 혼잡제어 기법을 제안한다. 이를 통해 지연민감한 이벤트 데이터의 지연시간 내 전송 보장 확률을 높이고, 트래픽을 분산시킴으로써 전송 효율을 높이고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1013-1016
• /
• 2000

기존의 end-to-end 방식에서는 네트워크 내부에서 혼잡(congestion)이 발생했을 경우 각 endpoint에서 즉시 알아 낼 수 없기 때문에 일정시간 동안 수신된 packet의 순서에 대한 정보로 혼잡이 발생했는지에 대해 추론하는 것이다. 따라서 네트워크 내부에서 직접적으로 정보를 얻거나 처리를 해 줄 수 있다면 기존 방식보다 처리율이 향상될 것이다. 본 논문에서는 Active Network 메커니즘을 이용하여 라우터를 구성하고 관련 모의실험결과를 보인다. 이를 통해서 기존의 방식보다 향상된 혼잡제어를 제시한다.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2096-2105
• /
• 1998

As there can be coincident bursts which may result in congetsion in a node of ATM network, reactive flow control schemes are required to guarantee user's Quality of Service. But, the high speed characteristics of ATM networks make it difficult to control source transmission rate in reacting to congestions in intermediate nodes. Therefore, flow control in Customer Premise Network may be more efficient than end-to-end flow control. In this paper, we propose a management model for flow ontrol in CPN and new Network Access Flow/Congestsion control scheme to utilize efficiently Virtual Path Connection.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.39-44
• /
• 2003

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Earl Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly We propose the Effective RED algorithm to solve with the weakness of RED In this algorithm the maximum drop probability decides to accept or drop the interning packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS(Network Simulator)-2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.427-434
• /
• 2003

This paper suggests an improved TCP congestion algorithm, which is more robust to lossy wireless environment than other algorithms such as TCP-Reno. The suggested algorithm decides on the size of a congestion window depending on both PER (Packet Error Rate) and its state, which is one of fast recovery state and slow start state. Some simulations are given to validate the suggested algorithm and the algorithm is compared with other TCP congestion algorithm from the point of view of performance measures such as a congestion window and throughput. The suggested algorithm has better throughput than other algorithm over wireless links with high PER and similar throughput to others over wireless links with low BER.

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

패킷 재배치(packet reodering)는 전송한 패킷의 순서가 처음과 다르게 뒤섞여 수신지에 도착하는 현상을 의미한다. 패킷 재배치는 불필요한 재전송이나 불필요한 혼잡 제어를 수행하여 TCP의 성능을 저하시킨다. 패킷 재배치에 의한 TCP 성능 저하를 막기 위해 다양한 접근 방법이 소개되었다. TCP-DAD는 기존 TCP에서 3으로 고정된 중복 응답 임계값을 동적으로 조절하여, 잘못된 혼잡 제어를 예방하고 있다. 일반적으로 전송한 패킷의 수가 많을 때, 패킷 재배치를 경험할 확률이 높으며, 패킷 재배치에 의해 잘못된 혼잡 제어가 일어날 가능성 많다. 고속 네트워크 환경에서는 혼잡 윈도우 크기 변화의 폭이 매우 크다는 점을 고려할 때, 중복 응답 임계값을 조절하는 TCP-DAD는 한계가 있다. 본 논문에서는 고속 네트워크 환경에서의 패킷 재배치 현상으로 인한 TCP 성능저하를 완화하기 위한 새로운 알고리즘 TCP-DT를 소개한다. 이는 중복 응답 수에 의존하지 않고 타이머를 통해 혼잡 제어를 수행하는 메커니즘 이다. 본 논문은 NS-2를 사용하여 고속 네트워크 환경에서의 시뮬레이션을 통해 제안한 TCP-DT의 성능 향상을 증명하였다.

• 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.