• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.4
• /
• pp.1-8
• /
• 2000

A defect of decrease in TCP throughput can be investigated in asymmetric environment of different uplink and downlink bandwidths. Under two-way TCP traffic, the total link utilization is decreased by the successive injection of data packets in buffer. To solve these problems, terminal ACK filtering and packet scheduling mechanisms are introduced in this paper. ACK filtering eliminates the buffered ACK packets and transmits recent ACK packets in the uplink with limited bandwidth. Packet scheduling is the method of preventing 'clustering' and 'ack compression' states which are generated in the two-way TCP traffic. The guarantee of the data traffic in reverse TCP connection and the high throughput in forward TCP connection are investigated by simulation.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.345-350
• /
• 2001

IP 네트워크 상에 TCP 데이터 트래픽의 제공은 처리율과 공정성을 향상시키기 위해 특별한 기법이 필요하다. 여기에는 DT와 RED와 같은 많은 기법들이 제안되었다. RED 알고리즘은 폭주를 회피하고 적은 지연과 높은 처리율을 유지하기 위한 목적으로 제안되었다. 현재의 TCP/IP 환경에서 TCP 근원지는 Slow-Start 단계에 들어감으로써 드롭된 패킷에 반응하지만, 네트워크 이용률은 급속히 떨어진다. 폭주를 탐지하고, 이를 무작위로 선택된 연결에 통보하므로써 RED는 글로벌 동기화 및 공정성 문제를 유발한다. 본 논문에서는 성능을 향상시키기 위해 공정성을 유지하고, 글로벌 동기화 문제를 해결할 수 있는 능동적인 큐 관리 알고리즘을 제안한다. 제안된 알고리즘은 버퍼크기와 임계치 변화에 따른 goodput, 처리율, 공정성의 평가인자를 이용하여 기존의 기법인 DT, RED와 비교 분석을 수행하고, 제안된 기법의 타당성을 보인다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.1 no.2
• /
• pp.102-109
• /
• 2006

In this paper, we improve the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. For example, even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congestion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.1
• /
• pp.75-80
• /
• 2008

Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3098-3103
• /
• 2009

In this paper, self-similar characteristics over statistical approaches and real-time Ethernet network traffic measurements are estimated. It is also shown that the self-similar traffic reflects real Ethernet traffic chareacteristics by comparing TCP-MT source model which is exactly self-similar model to the traditional Poisson model.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.383-395
• /
• 2001

Recent measurement and simulation studies have revealed that wide area network traffic displays complex statistical characteristics-possibly multifractal scaling-on fine timescales, in addition to the well-known properly of self-similar scaling on coarser timescales. In this paper we investigate the performance and network engineering significance of these fine timescale features using measured TCP anti MPEG2 video traces, queueing simulations and analytical arguments. We demonstrate that the fine timescale features can affect performance substantially at low and intermediate utilizations, while the longer timescale self-similarity is important at intermediate and high utilizations. We relate the fine timescale structure in the measured TCP traces to flow controls, and show that UDP traffic-which is not flow controlled-lacks such fine timescale structure. Likewise we relate the fine timescale structure in video MPEG2 traces to sub-frame encoding. We show that it is possibly to construct a relatively parsimonious multi-fractal cascade model of fine timescale features that matches the queueing performance of both the TCP and video traces. We outline an analytical method ta estimate performance for traffic that is self-similar on coarse timescales and multi-fractal on fine timescales, and show that the engineering problem of setting safe operating points for planning or admission controls can be significantly influenced by fine timescale fluctuations in network traffic. The work reported here can be used to model the relevant characteristics of wide area traffic across a full range of engineering timescales, and can be the basis of more accurate network performance analysis and engineering.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.943-954
• /
• 2003

The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS (Universal Mobile Telecommunication Services) system, has to support the packet data service and it will play the major role in the system. By the way, since the Web service is based on TCP, most of the Internet traffic TCP traffic. Therefore, efficient transmission of TCP traffic will take very important role in the performance of packet data service. There are many researches about improving TCP performance over wireless network. In those schemes, the UMTS system adapts the link layer retransmission scheme. However, there are rarely studies about the exact performance of the link layer retransmission scheme in the face of dynamic changes of wireless environment over the UMTS system. The dynamic changes of wireless environment, such as wireless bandwidth, can degrade TCP performance directly. So, in this paper, we simulate and analyze the TCP performance in the UMTS system with dynamic wireless environments. Then, we propose a simple scheme for minimizing TCP performance degradation. As a result of simulation, we can find that when wireless environment is changed dynamically, the probability of TCP timeout is increased, and the TCP performance is degraded very much. In this situation, the proposed simple scheme shows good performance. It saves wireless resources and reduces the degradation of TCP performance without large overhead of the base station.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.7-16
• /
• 2000

초고속 통신의 실현과 다양한 멀티미디어 서비스를 위한 TCP/IP 통신의 전송 메카니즘으로서 ATM이 널리 사용되고 있다. TCP층과 ATM층의 상호작용이 TCP층 뿐만 아니라 ATM층에도 영향을 미쳐 처리율과 공정성의 성능이 저하되므로, ATM상의 TCP 트래픽 파라미터, 즉 TG(timer granularity)와 윈도우 크기를 적절하게 조정함으로써 TCP 흐름제어가 ABR 율제어와 상호작용하지 않는다. 그 결과로 상호작용의 영향을 최소화할 수 있으며, TCP의성능향상을 가져올 수 있다. 본 논문에서는 윈도우 크기와 TG와 같은 TCP 파라미터를 조절하여 VBR서비스상에서의 TCP 트랙픽의 성능평가를 통해 높은 처리율과 공정성을 나타내었다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.286-295
• /
• 2007

This paper presents an intelligent PID control for stochastic systems with nonstationary nature. We optimally determine parameters of a PID controller through learning algorithm and propose an online PID control to compensate system errors possibly occurred in realtime implementations. A dynamic Bayesian network (DBN) model for system errors is additionally explored for making decision about whether an online control is carried out or not in practice. We apply our control approach to traffic control of Transmission Control Protocol (TCP) networks and demonstrate its superior performance comparing to a fixed PID from computer simulations.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.2
• /
• pp.64-72
• /
• 2006

The long propagation delay over satellite internet causes degradation of TCP performance in slow start phase. Especially, web traffic performance is greatly reduced by low throughput in slow start phase. To improve web traffic performance, we propose the Dynamic ACK Generation Scheme which generates ACKs and considers sender RTO in PEP (Performance Enhancing Proxy). The Normal ACK generation mechanism improves TCP throughput, and also decreases sender RTO. if PEP stops generating ACKs, TCP performance will be reduced by frequent RTO expiration. To solve this problem, our scheme adjusts RTO using ACK generation interval. And it supports retransmission mechanism for loss recovery in PEP. The results of the performance analysis provide a good evidence to demonstrate the efficiency of our mechanisms over satellite internet.