• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1371-1374
• /
• 2004

본 논문에서는 내부 LAN(Local area network)에서 MSS(Maximum segment size)의 변화가 네트워크 성능에 미치는 영향에 대하여 분석한다. 내부 LAN에 웹 클라이언트와 웹 서버를 두고 이더넷(Ethernet)이 허용하는 사이즈 내에서 MSS 값의 변화가 네트워크의 성능에 미치는 영향을 분석한다. 처리량(Throughput), 이용률(Utilization), 분실율, 수신율, RTT(Round Trip Time)를 사용하여 성능을 평가하였다. 실험은 네트워크 시뮬레이터 중의 사실상 표준 도구인 NS-2로 한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.126-134
• /
• 2006

Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.334-348
• /
• 2015

Widespread use of smart devices accompanies increase of use of access point (AP), which enables the connection to the wireless network. If the appropriate security is not served when a user tries to connect the wireless network through an AP, various security problems can arise due to the rogue APs. In this paper, we are going to examine the threat by evil-twin, which is a kind of rogue APs. Most of recent researches for detecting rogue APs utilize the measured time difference, such as round trip time (RTT), between the evil-twin and authorized APs. These methods, however, suffer from the low detection rate in the network congestion. Due to these reasons, in this paper, we suggest a new factor, packet inter-arrival time (PIAT), in order to detect evil-twins. By using both RTT and PIAT as the learning factors for the support vector machine (SVM), we determine the non-linear metric to classify evil-twins and authorized APs. As a result, we can detect evil-twins with the probability of up to 96.5% and at least 89.75% even when the network is congested.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.4
• /
• pp.385-391
• /
• 2005

As the Internet real-time multimedia applications increases, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example satisfying this necessity. The TCP-Friendly Rate Control (TFRC) is an UDP-based protocol that controls the transmission rate that is based on the available round trip time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used in the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In the wireless network, TCP performs poorly because it was originally designed for wired networks and does not take into consideration wireless characteristics such as mobility, high-loss probability, and hidden-terminal problems. In particular, in the wireless multi-hop networks, a large congestion window increases the probability of contention and packet losses, and TCP performance is degraded severely as a result. So, it is necessary to limit the TCP congestion window size in order keep the probability of contention loss in the system to a minimum. In this paper, we propose a new scheme for determining the maximum congestion window size based on the measured bandwidth and Round-Trip-Time (RTT). Using ns-2 simulation, we show that the proposed scheme reduces the probability of packet contention and improves TCP performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.667-669
• /
• 2005

TCP Vegas나 FAST TCP는 RTT(Round Trip Time) 동안 실제 처리량(actual throughput)이 기대 처리량 (expected throughput)보다 특정 임계값보다 더 작으면 혼잡 상황으로 판단하고 송신측에서 내보내는 데이터 양을 감소시킴으로써 혼잡을 제어한다. 그러나 RTT 기반의 처리량(Throughput) 측정은 송수신 경로가 다를 경우 양방향 경로의 혼잡 상황을 구분하지 않는 문제점을 가지고 있다. 따라서 본 논문에서는 TCP Timestamp를 이용하여 양방향 혼잡 상황을 구분하여 혼잡을 제어하는 메커니즘을 제안한다. 그리고 제안한 방식에 대한 성능 분석을 위해 NS-2의 TCP Vegas를 수정하여 시뮬레이션한 결과를 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1569-1572
• /
• 2005

인트라넷은 TCP 를 지원하는 기존의 LAN 환경에서 인터넷 기술을 그대로 채택하였다. 이는 인터넷 기반의 TCP Parameter 값을 그대로 인트라넷에 적용하였음을 의미하며 서로 다른 환경에서 같은 Parameter 값의 적용은 네트워크 성능 저하의 원인이 되기도 한다. 네트워크의 성능을 확인하는 방법으로 Rtt(Round Trip Time:응답시간)와 Thput(Throughput:처리률)이 있다. 이값은 전송 거리와 트래픽 양에 따라 다르게 나타난다. 따라서 본 논문에서는 LAN 기반으로 전송거리에 따른 즉, Topology diameter 와 TCP Parameter 와의 관계를 RTT 와 Thput 을 통해 분석해 보았다.

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

네트워크 기술의 발전으로 이용할 수 있는 대역폭이 증가하고 있다. 그에 따라 증가한 대역폭을 효율적으로 사용하기 위한 전송 기술이 요구되고 있다. TCP Vegas는 RTT(Round Trip Time)를 이용해 혼잡을 미리 예측하여 윈도우 크기를 조절하는 혼잡 제어 알고리즘을 사용한다. UDT는 높은 대역폭과 큰 RTT 환경에서 대용량 데이터를 전송하기 위해 제공된 응용 기반의 전송 프로토콜이다. 본 논문에서는 UDT에 혼잡예측 알고리즘을 적용한 새로운 UDT의 혼잡제어 알고리즘을 제안한다. 혼잡예측을 통해 혼잡한 구간, 혼잡하지 않은 구간을 나누어 혼잡윈도우를 갱신한다. 혼잡하지 않은 구간에서 혼잡윈도우를 증가시키고 혼잡한 구간에서 혼잡윈도우를 감소시킴으로써 기존의 UDT보다 성능이 개선되었음을 확인 할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.469-481
• /
• 2004

Previous works for the AF(Assured Forwarding) service in the Diffserv network have no sufficient consideration on the fairness of bandwidth share based on RTTs, the target rates, and the impact of UDP against TCP. In this paper, in order to solve these problems, we propose a FDSA(Fair Differentiated Service Architecture) composed of TRA3CM(Target rate and RTT Aware 3 Color Marking) and TRBD(Target Rate Based Dropping) mechanisms. The TRA3CM and TRBD mechanisms provide three color marking and fair transmission rates among aggregate flows by considering RTT, target rate, and UDP flows simultaneously. In the results of comparing the performance among existing mechanisms and the TRA3CM-TRBD, the TRA3CM-TRBD mechanism was able to mitigate the RTT and UDP effect better than the former. The TRA3CM-TRBD is shown to provide good performance for transmission rates proportional to various target rates.

• KNOM Review
• /
• v.23 no.1
• /
• pp.26-33
• /
• 2020

Bitcoin is an electronic money that does not rely on centralized institutions such as banks and financial institutions, unlike the world's paper currencies such as dollar, won, euro and yen. In Bitcoin network, a block with transaction details is generated by mining, and the message that the block has been created is broadcast to all participating nodes in a broadcasting method to secure reliability through verification. Likewise, the mining and block propagation methods in the Bitcoin network are greatly affected by the performance of the P2P network. For example, in the case of mining, the node receiving the reward for mining varies depending on whether the block is first mined in the network and the proof of mining is propagated faster. In this paper, we applied local characteristics and Round-to-Trip(RTT) measurement to solve the problems of the existing neighbor connection method and block propagation method performed in Bitcoin network. An algorithm to improve block propagation speed is presented. Through experiments, we compare the performance of the improved algorithm with the existing algorithm to verify that the overall block propagation time is reduced.