• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.359-369
• /
• 2005

Delay estimation is a difficult Problem in computer networks. Accurate one-way delay estimation is crucial because it serves a very important role in network performance and thus application design. RTT(Round Trip Time) is often used as an approximation of the delay, but because it is a sum of the forward and reverse delays, the actual one-way delay cannot be estimated accurately from RTT. To estimate one-way delay accurately, this paper proposes a new scheme that analytically derives one-way delay, forward and reverse delay respectively. We show that the performance of TCP can improve dramatically in asymmetric networks using our scheme. A key contribution of this paper is that our one-way deiay estimation is much more accurate than RTT estimation so that TCP can quickly find the network capacity in the slow start phase. Since RTT is the sum of the forward and reverse delays, our scheme can be applied to any protocol that is based on RTT.

• Journal of Korea Multimedia Society
• /
• v.24 no.5
• /
• pp.676-683
• /
• 2021

Wi-Fi Round-trip timing (RTT) based location estimation technology estimates the distance between the user and the AP based on the transmission and reception time of the signal. This is because reception instability and signal distortion are greater than that of a Received Signal Strength Indicator (RSSI) based fingerprint in an indoor NLOS environment, resulting in a large position error due to multipath fading. To solve this problem, in this paper, we propose an end-to-end based WiFi Trilateration Net (WTN) that combines neural network-based RTT correction and trilateral positioning network, respectively. The proposed WTN is composed of an RNN-based correction network to improve the RTT distance accuracy and a neural network-based trilateral positioning network for real-time positioning implemented in an end-to-end structure. The proposed network improves learning efficiency by changing the trilateral positioning algorithm, which cannot be learned through differentiation due to mathematical operations, to a neural network. In addition, in order to increase the stability of the TOA based RTT, a correction network is applied in the scanning step to collect reliable distance estimation values from each RTT AP.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.919-926
• /
• 2016

In a wireless network, TCP causes the performance degradation because of mistaking packet loss, which is caused by characteristics of wireless link and throughput oscillation due to change of devices connected on a limited bandwidth. Delay based TCP is not affected by packet loss because it controls window size by using the RTT. Therefore, it can solve the problem of unnecessary degradation of the rate caused by misunderstanding reason of packet loss. In this paper, we propose an algorithm for improving the remaining problems by using delay based TCP. The proposed scheme can change throughput adaptively by adding the RTT, which rapidly reflects the network conditions to BaseRTT. It changes the weight of RTT and the increases and decreases window size based on the remaining amount of the buffer. The simulation indicated that proposed scheme can alleviate the throughput oscillation problem, as compared to the legacy TCP Vegas.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.65-72
• /
• 2003

Internet roundtrip delay/time (RTT) prediction plays an important role in detecting packet losses in reliable transport protocols for traditional web applications and determining proper transmission rates in many rate-based TCP-friendly protocols for Internet-based real-time applications. The widely adopted autoregressive and moving average (ARMA) model with fixed-parameters is shown to be insufficient for all scenarios due to its intrinsic limitation that it filters out all high-frequency components of RTT dynamics. In this paper, we introduce a novel parameter-varying RTT model for Internet roundtrip time prediction based on the information theory and the maximum entropy principle (MEP). Since the coefficients of the proposed RTT model are updated dynamically, the model is adaptive and it tracks RTT dynamics rapidly. The results of our experiments show that the MEP algorithm works better than the ARMA method in both RTT prediction and RTO estimation.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.437-442
• /
• 2005

The measurement of RTT (Round Trip Time) can be used for the analysis of Internet congestion. However, simple measuring of RTT which measures only hun around time of a packet can not infer a packet forward/backward delay variation. In this thesis, we present a new algorithm which can be used for the estimation of forward/backward delay variation of packets. These delay variations are implication of network congestion state. In this algorithm, the reference forward/backward delay can be determined based on the minimum RTT value. The delay variation of each packet can be calculated by comparing reference delay with the packet delay. We verified our proposed algorithm by NS-2 simulation and delay measuring in a real network.

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.381-388
• /
• 2015

TCP, which performs congestion control in congestion condition, is able to help a reliable transmission. However, packet loss can be increased because congestion window is increased by the time the packet is dropped in the process of congestion avoidance. In this paper, to solve the above problem, we propose a new congestion estimation based TCP congestion control scheme using the weighted average value of the RTT. After measuring a SRTT, which means the weighted average value of RTTs, at this point of time when a buffer overflow is occurred by an overloaded packet, the proposed scheme estimates the time, when the same SRTT is made in packet transmission, as a congestion time and then decreases the congestion window. The simulation results show that the proposed schem has a good performance in terms of packet loss rate and throughput when the packet loss due to buffer overflow is larger than that due to wireless channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7C
• /
• pp.608-615
• /
• 2007

Generally time of arrival (TOA) information via two way communications can be derived by accurate round trip time (RTT) between two devices. However, response time demanded in RTT measurement is long, a serious TOA error is caused by each different clock drift between two devices. In order to solve this problem, we propose the TOA and time difference of arrival (TDOA) estimation scheme with mitigating clock drift effect. To verify the performance of proposed method, we compared the proposed scheme with one way based TDOA acquisition method introduced by IEEE 802.15.4a Task Group and then we could conclude that the proposed method has better performance over other methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1038-1041
• /
• 2010

오늘날 대부분의 네트워크는 수십 Gb/s 를 지원하는 광네트워크다. 이러한 고속 네트워크에서 대부분 TCP 전송 프로토콜을 사용하고 있다. TCP 전송 프로토콜은 AIMD 방식의 특성으로 인해 고속 네트워크에 적합하지 않다. 반면 UDT 는 DAIMD 방식을 사용하기 때문에 고속 네트워크에서 가용대역폭을 충분히 활용 가능하다. 그러나 UDT 는 sync-interval 간격으로 rate control 이 이루어 지기 때문에 sync-interval 동안 가용 대역폭을 충분히 활용하지 못하는 문제점이 발생한다. 본 논문에서는 RTT 예측을 통한 sync-interval 구간에서의 rate control 기법을 제안한다. sync-interval 구간 동안 RTT 예측을 통해 rate control 을 함으로써 기존 UDT에 비해 고속 네트워크 환경에서 보다 빠르게 가용대역폭을 활용할 수 있다. 네트워크 시뮬레이션 결과 기존 UDT 에 비해 throughput 및 안정성이 향상되었다.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.353-358
• /
• 2006

Unlike TCP Reno, TCP Vegas recognizes network congestion through the measuring of RTT (Round Trip Time) and decides the main congestion control parameters, such as Windows size. But, congestion avoidance scheme of Vegas poorly reflects asymmetric characteristics of packet path because TCP Vegas uses the measuring of RTT that reflects forward/backward packet transmission delay as a forward delay. The RTT can't infer the forward/backward transmission delay variation because it only measures the packet's turn around time. In this paper, We have designed and implemented a new Vegas congestion control algorithm that can distinguish forward/backward network congestion. We have modified the source codes of TCP Vegas in Linux 2.6 kernel and verified their performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.649-652
• /
• 2015

Previous marking policy for the AF service of TCP traffic in the Diffserv network have no sufficient consideration on the effect of RTT and target rate. In this paper, in order to improve fairness Index by the effect RTT difference of TCP traffic, we propose the modified TSW3CDM(Time Sliding Window Three Color Dynamic Marker) based on average transfer rate estimation and the flow state. The proposed algorithm is dynamic marking policy that do allocate band width in proportion to transmission rate. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed TSW3CDM algorithm improves fairness index by comparison with TSW3CM.