• Title/Summary/Keyword: Downward Vertical Handover

Search Result 2, Processing Time 0.017 seconds

Improving TCP Performance for Downward Vertical Handover (하향식 수직적 핸드오버를 위한 무선 TCP 성능 향상 기법과 성능 분석)

  • Kim, Ho-Jin;Lee, Su-Kyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.10B
    • /
    • pp.638-643
    • /
    • 2007
  • Interconnecting wireless local area networks (WLANs) with third generation (3G) cellular networks has become an issue of great interest. However, a Vertical Handover (VHO) causes an abrupt change in link bandwidth. Due to such a change, TCP triggers unnecessary fast retransmission during a Downward VHO (DVHO) from a cellular network to a WLAN, causing throughput degradation. Thus, we propose a new reordering mechanism for DVHO that suppresses unnecessary retransmission due to the spurious duplicate acknowledgments. We analytically investigate the throughput of TCP in the literature and our proposed scheme. Through the numerical and simulation results, it is shown that our proposed TCP achieves better performance in terms of throughput, compared with Nodupack with SACK.

A Novel Sender-Based TCP Congestion Control for Downward Vertical Handover (하향 수직 핸드오버 상황에서 송신자에 기반을 둔 TCP 혼잡 제어 기법)

  • Choi, Yeo-Min;Song, Joo-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6B
    • /
    • pp.430-439
    • /
    • 2008
  • In this paper, we propose a sender-based TCP congestion control scheme for downward vertical handover (DVHO), in which mobile node moves from a cellular network to a wireless LAN. DVHO can give rise to severe performance problems in TCP throughput because it causes a drastic change of link characteristics. Particularly, TCP executes falsely congestion control by packet reordering, which is occurred from link delay difference between a cellular link and a wireless LAN link. Therefore, the congestion window is reduced. And unnecessary retransmissions wastes bandwidth. To solve these problems, we propose a method using estimated round-trip time in cellular link to process duplicated ACKs from reordering. Furthermore, the duplicated ACKs are used to the control congestion window size. Simulation result shows that the proposed scheme can solve problems. Moreover, the proposed scheme can have better performance than TCP New Reno and nodupack.