• Title/Summary/Keyword: TCP 모델 분석 및 평가

Search Result 5, Processing Time 0.019 seconds

Improving Loss Recovery Performance of TCP SACK by Retransmission Loss Recovery (재전송 손실 복구를 통한 TCP SACK의 성능 향상 모델링 및 분석)

  • 김범준;김동민;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.667-674
    • /
    • 2004
  • The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. Although TCP SACK can recover multiple packet losses in a window, it cannot avoid RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose a simple change to TCP SACK, which is called TCP SACK+ in simple. We use a stochastic model to evaluate the performance of TCP SACK+, and compare it with TCP SACK. Numerical results evaluated by simulations show that SACK+ can improve the loss recovery of TCP SACK significantly in presence of random losses.

Performance Analysis of TCP Loss Recovery for Correlated Packet Losses over Wireless Networks (상호 연관성을 갖는 연속적인 패킷 손실에 대한 TCP 손실 복구 성능 분석)

  • 김범준;김석규;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.660-666
    • /
    • 2004
  • Overall TCP performance represented by end-to-end throughput is largely dependent upon its loss recovery performance. In particular non-congestion packet losses caused by transmission errors degrade TCP performance seriously. Using Markov process, we analyze TCP loss recovery performance for correlated packet losses caused by multipath fading. The results show that loss recovery performance can be severely affected by burstiness in packet losses, even if overall packet loss ratio is very low.

Implementation and Performance Evaluation of Transaction Protocol for Wireless Internet Services (무선 인터넷 서비스를 위한 트랜잭션 프로토콜의 구현과 성능평가)

  • Choi, Yoon-Suk;Lim, Kyung-Shik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.447-458
    • /
    • 2002
  • In this paper, we design and implement Wireless Transaction Protocol(WTP) and evaluate it for wireless transaction processing in mobile computing environments. The design and implementation of WTP are based on the coroutine model that might be suitable for light-weight portable devices. We test the compatibility between our product and the other products such as Nokia, Kannel and WinWAP For the evaluation of WTP, we use an Internet simulator that can arbitrary generate random wireless errors based on the Gilbert model. In our experiment, the performance of WTP is measured and compared to those of Transmission Control Protocol(TCP) and TCP for Transactions. The experiment shows that WTP outperforms the other two protocols for wireless transaction processing in terms of throughput and delay. Especially, WTP shows much higher performance In ease of high error rate and high probability of burst errors. This comes from the fact that WTP uses a small number of packets to process a transaction compared to the other two protocols and introduces a fixed time interval for retransmission instead of the exponential backoff algorithm. The experiment also shows that the WTP performance is optimized when the retransmission counter is set to 5 or 6 in case of high burst error rate.

3G+ CDMA Wireless Network Technology Evolution: Application service QoS Performance Study (3G+ CDMA망에서의 기술 진화: 응용 서비스 QoS 성능 연구)

  • 김재현
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.10
    • /
    • pp.1-9
    • /
    • 2004
  • User-Perceived application-level performance is a key to the adoption and success of CDMA 2000. To predict this performance in advance, a detailed end-to-end simulation model of a CDMA network was built to include application traffic characteristics, network architecture, network element details, and protocol features. We assess the user application performance when a Radio Access Network (RAN) and a Core Network (CN) adopt different transport architectures such as ATM and If. For voice Performance, we found that the vocoder bypass scenario shows 8% performance improvement over the others. For data packet performance, we found that HTTP v.1.1 shows better performance than that of HTTP v.1.0 due to the pipelining and TCP persistent connection. We also found that If transport technology is better solution for higher FER environment since the IP packet overhead is smaller than that of ATM for web browsing data traffic, while it shows opposite effect to small size voice packet in RAN architecture. Though simulation results we showed that the 3G-lX EV system gives much better packet delay performance than 3G-lX RTT, the main conclusion is that end-to-end application-level performance is affected by various elements and layers of the network and thus it must be considered in all phases of the technology evolution process.

Analytical Modelling and Heuristic Algorithm for Object Transfer Latency in the Internet of Things (사물인터넷에서 객체전송지연을 계산하기 위한 수리적 모델링 및 휴리스틱 알고리즘의 개발)

  • Lee, Yong-Jin
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.3
    • /
    • pp.1-6
    • /
    • 2020
  • This paper aims to integrate the previous models about mean object transfer latency in one framework and analyze the result through the computational experience. The analytical object transfer latency model assumes the multiple packet losses and the Internet of Things(IoT) environment including multi-hop wireless network, where fast re-transmission is not possible due to small window. The model also considers the initial congestion window size and the multiple packet loss in one congestion window. Performance evaluation shows that the lower and upper bounds of the mean object transfer latency are almost the same when both transfer object size and packet loss rate are small. However, as packet loss rate increases, the size of the initial congestion window and the round-trip time affect the upper and lower bounds of the mean object transfer latency.