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

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.448-450
• /
• 2007

Peer-to-Peer system has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical location aware topology can cause serious performance degradation. In this paper, we consider the network distance between peers so that it helps peers select neighbors located at the nearest when they exchange queries for sharing of resources. To reduce the unnecessary signaling traffic and delay of query exchange, we propose a location aware topology based Hybrid P2P system. This system calculates the network distance which combines the direct measurement such as RTT (Round Trip Time) with geographic space of peers using IP address

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.41-42
• /
• 2006

In this paper, we propose a rapid asynchronous UWB (Ultra Wide Band) position location scheme based on double RTTs (Round-Trip Transmissions). In the proposed scheme, to avoid performance degradation of the position location in harsh multipath channel environments where LoS (Line-of-Sight) components are not always guaranteed, the remaining RTT information is solved from realistic double RTTs. Simulation results in IEEE 802.15.4a UWB channel models reveal that the proposed scheme can achieve closely comparable position location accuracy of the conventional ToA (Time of Arrival) method based on triple RTTs, while reducing the processing delay required for the calculation of the position locations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.154-157
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffice concentration and bottlenecks near the lore routers since traffice from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1193-1196
• /
• 2002

본 연구는 접속 요구가 많은 웹 서버의 부하를 두개의 웹 서버로 분산시켜 보다 효율적인 웹 서비스를 제공함과 동시에, 두 웹 서버의 용도에 맞게 재전송 타임아웃(RTO:Retransmission Timeout)을 독립적으로 설정하여 네트워크의 효율성을 제고하기 위해 시도되었다. 이를 위해 Linux 기반의 PC에 라우터를 구축하고, 접속의 요구에 따라 두개 중 하나의 Web 서버에 접속되게끔 라우터를 설정하였다. 웹 서버는 내부 접속용과 외부 접속용으로 구분하였으며, 각각의 서버마다 재전송 타임아웃(RTO:Retransmission Timeout)값을 다르게 설정하여 네트워크에서의 지연(delay)을 최적화시켜 클라이언트의 요청에 대한 응답시간을 최소화시켰다. 전송거리가 짧은 내부 접속용 웹 서버에는 패킷 손실이 거의 없으므로 작은 RTO 값을 설정하고, 외부 접속용 웹 서버에는 큰 RTO 값을 설정하였는데 RTT(Round Trip Time:응답시간)와 Tput(Throughput:처리율)의 출력 결과를 통해 Web 서버의 성능 향상을 확인 할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.328-330
• /
• 2019

RTT(Round Trip Time)가 큰 위성링크에서는 TCP의 정상적인 동작이 어렵다. PEP(Performance Enhanced Proxy)은 위성과 지상 통신간의 성능 향상을 위해 개발되었으나. PEP의 위성링크 구간에 적용되는 TCP Cubic, TCP Hybla등 기존의 Enhanced TCP는 충분한 윈도우사이즈를 확보하는데 시간이 걸리는 문제점이 있다. 본 논문에서는 Cubic의 초기 윈도우 값을 높게 설정해 위성 대역폭을 보다 빨리 점유할 수 있는 수정된 혼잡제어 알고리즘을 제안한다. 제안한 방법은 기존 혼잡제어 알고리즘보다 전송률이 약 26% 향상되었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.717-720
• /
• 2011

고속 네트워크 환경에서 AR UDT(Adaptive Rate control UDT)는 표준 전송 프로토콜인 TCP에 비해 뛰어난 성능을 보인다. UDT(UDP-based Data Transfer)를 기반으로 하는 AR UDT의 혼잡제어는 네트워크 상태를 예측하여 패킷 간 전송시간을 변화시킴으로써 기존 UDT보다 향상된 성능을 보인다. 그러나 AR UDT는 네트워크 상태 예측의 오차가 클 뿐만 아니라 rate control만을 공격적으로 조절하기 때문에 수신 버퍼의 초과로 인해 안정적인 성능을 기대하기 어렵다. 본 논문에서는 AR UDT환경에서 네트워크 상태에 따라 적응적으로 혼잡제어를 하는 기법을 제안한다. RTT(Round Trip Time)의 변화량에 따라 네트워크 상태를 예측하여 flow control과 rate control을 적응적으로 조절한다. 네트워크 시뮬레이션 결과를 통하여 AR UDT에 비해 전송속도와 안정성이 향상되었음을 보였다.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2796-2813
• /
• 2014

This paper presents a new algorithm called the adaptive logarithmic increase and adaptive decrease algorithm (A-LIAD), which mainly addresses the Round-Trip Time (RTT) fairness problem in satellite networks with a very high propagation delay as an alternative to the current TCP congestion control algorithm. We defined a new increasing function in the fashion of a logarithm depending on the increasing factor ${\alpha}$, which is different from the other logarithmic increase algorithm adopting a fixed value of ${\alpha}$ = 2 leading to a binary increase. In A-LIAD, the ${\alpha}$ value is derived in the RTT function through the analysis. With the modification of the increasing function applied for the congestion avoidance phase, a hybrid scheme is also presented for the slow start phase. From this hybrid scheme, we can avoid an overshooting problem during a slow start phase even without a SACK option. To verify the feasibility of the algorithm for deployment in a high-speed and long-distance network, several aspects are evaluated through an NS-2 simulation. We performed simulations for intra- and interfairness as well as utilization in different conditions of varying RTT, bandwidth, and PER. From these simulations, we showed that although A-LIAD is not the best in all aspects, it provides a competitive performance in almost all aspects, especially in the start-up and packet loss impact, and thus can be an alternative TCP congestion control algorithm for high BDP networks including a satellite network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1194-1201
• /
• 2003

Measurements of network traffic have shown that self-similarity is a ubiquitous phenomenon spanning across diverse network environments. We have advance the framework of multiple time scale congestion control and show its effectiveness at enhancing performance for fast TCP prototype control. In this paper, we extend the fast TCP prototype 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 fast TCP prototype is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. We explicate out methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under self-similar traffic conditions. We discuss issues arising in comparative performance evaluation under heavy-tailed workload. workload.