• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.7-13
• /
• 2011

While the TCP throughput degradation problem in coded wireless mesh networks is well-known, few effective solutions have been proposed. Most schemes proposed attempts to mask packet reordering by ordering packets at a lower layer or to adjust a packet transmission rate to solve the scarcity problem of coding opportunities. Through the throughput comparison of traditional standard TCP variants, we show that losses and duplication of TCP acknowledgements in coded wireless mesh networks can impact throughput. In addition, we show that a TCP variant that does not rely on duplicate acknowledgements is more suitable for coded wireless mesh networks.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.978-981
• /
• 2007

TCP(Transmission Control Protocol)는 흐름제어와 오류제어 그리고 혼잡제어 등을 통해 목적지까지 효율적으로 데이터를 전송하는 프로토콜이다. 최근 라우터 성능 및 라우팅 알고리즘 등의 발달로 인해 패킷이 비순차적으로 전송되는 패킷 재배치(packet reordering)가 빈번한 발생하여 TCP 성능 저하의 주요 원인이 되고 있다. 패킷 재배치가 TCP 로 하여금 불필요한 재전송(Spurious Retransmission) 및 혼잡제어를 수행하도록 하기 때문이다. 본 논문에서는 TCP 의 신속 재전송(Fast Retransmission)의 중복 응답 임계값(dupthresh)를 동적으로 조절함으로써, 불필요한 재전송 및 혼잡제어의 발생횟수를 효율적으로 줄이는 TCP-DAD(TCP Dynamically Adjusted Dupthresh)기법을 제안한다. 본 논문은 NS-2를 이용한 시뮬레이션을 통해 TCP-DAD 가 다른 TCP 메커니즘보다 평균적으로 약 34%의 성능 향상을 보임을 증명하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.9-15
• /
• 2013

Most of recent studies on data center networks are based on the assumption of symmetrical multi-rooted tree topologies such as a Fat-Tree. While packet scatter schemes are very effective for such a network topology, it is known that various failures can result in an asymmetric topology which degrades TCP performance. In this paper, we reexamine the effects of link failures on packet scatter schemes in Fat-Trees. Our simulation results show that in case of a single link failure in a large-scale Fat-Tree, packet reordering does not occur enough to degrade TCP performance. This implies that we do not necessarily need a complex scheme to make packet schemes robust to link failures.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.597-600
• /
• 2011

멀티패스 전송은 단대 노드간 다중 경로를 동시에 사용함으로써 효과적인 대용량 전송을 실현하는 미래 인터넷 설계의 한 부분이다. 이에 따라 draft-‘TCP Extensions for Multipath Operation with Multiple Addresses'에서 MPTCP 가 언급되었으며 기존 TCP 를 활용한 다중 전송에서 발생할 수 있는 다양한 오픈 이슈가 나오게 되었다. 본 논문에서는 위 논의로부터 나온 다양한 오픈 이슈 중 수신측에서 발생 할 수 있는 패킷의 재조합(packet reordering)을 줄이는데 초점을 둔다. 패킷의 재조합은 불필요한 에너지 소비와 빈번한 패킷 재전송(packet retransmission) 문제를 초래하며, 특히 에너지 효율이 중요한 모바일기기에 있어 반드시 해결되어야 문제라 할 수 있다. 이를 해결하기 위해 본 논문에서는 전송 경로들의 RTT 값을 비교하여 패킷의 스케줄링 하는 기법을 제안하였으며 시뮬레이션을 통해 성능을 검증하였다.

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

Mobile nodes in FHMIPv6 has both advantages of HMIPv6 protocol which reduces signaling delay time and resource consumption during a handover and fast handover algorithm which reduces packet loss. Fast handover algorithm can reduce packet loss by 'tunneling' method ; that transmits a packet from old access router to new access router in case of handover. However, the fast handover algorithm can cause a reordering problem in a receiver between packets tunneled from the previous access router and packets transmitted directly to the new access router, which could degrade the TCP performance due to congestion control. In this paper, we propose two algorithms to solve the reordering problem in fast handover. The first one uses a holding timer for tunneling, the other adds a new algorithm to routers that adopt snoop protocol. We compare the performance of the proposed reseuquencing algorithms with that of the existing FHMIPv6 protocol by simulation. The simulation results show that the proposed algorithms solve the reordering problems and enhance TCP performance by preventing TCP sender entering congestion control.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.411-419
• /
• 2017

The Wireless Mesh Network (WMN) is a multi-hop wireless network consisting of mesh routers and clients, where the mesh routers have minimal mobility and form the backbone. The WMN is primarily designed to access outer network to mesh clients through backhaul gateways. As traffic converges on the gateways, traffic hotspots are likely to form in the neighborhood of the gateways. In this paper, we propose Congestion Aware Multi-path Routing (CAMR) protocol to tackle this problem. Upon congestion, CAMR divides the clients under a mesh STA into two groups and returns a different path for each group. The CAMR protocol triggers multi-path routing in such a manner that the packet reordering problem is avoided. Through simulations, we show that CAMR improves the performance of the WMN in terms of throughput, delay and packet drop ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2354-2370
• /
• 2015

The advantages of employing SCTP-based Concurrent Multipath Transfer (CMT) have been demonstrated to be very useful for data delivery over multi-homed wireless networks. However, there is still significant ongoing work addressing some remaining limitations and challenges. The most important concern when applying CMT to data delivery is related to handling packet reordering and buffer blocking. Another concern on this topic is that current sender-based CMT solutions seldom consider balancing the overhead and sharing the load between the sender and receiver. This paper proposes a novel Receiver-driven Cooperation-based Concurrent Multipath Transfer solution (CMT-Rev) with the following aims: (i) to balance overhead and share load between the sender and receiver, by moving some functions including congestion and flow control from the sender onto receiver; (ii) to mitigate the data reordering and buffer blocking problems, by using an adaptive receiver-cooperative path aggregation model, (iii) to adaptively transmit packets over multiple paths according to their receiver-inspired sending rate values, by employing a new receiver-aware data distribution scheduler. Simulation results show that CMT-Rev outperforms the existing CMT solutions in terms of data delivery performance.

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

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.946-949
• /
• 2007

패킷 리오더링은 패킷을 보낸 순서와 목적지에 도착한 순서가 다른 현상을 말한다. 모바일 환경에서는 모바일노드의 이동에 따라 패킷이 전달되는 경로가 바뀌기 때문에 빈번하게 패킷리오더링이 발생한다. 본 논문은 FMIPv6 환경에서 모바일노드가 핸드오프 할 때 발생하는 패킷리오더링 현상을 개선하기 위한 기법을 제안한다. 제안하는 기법은 대응노드에 버퍼를 두어 패킷리오더링을 유발하게 되는 패킷을 버퍼링 하였다가 새로운 경로가 설정된 후 새로운 경로를 통해 버퍼링 된 패킷을 전송하여 패킷 리오더링 현상을 개선한다. 또한, 본 논문에서는 수신 측인 모바일노드가 패킷의 끊김을 겪지 않고 패킷 리오더링 현상을 개선하기 위하여 정확한 버퍼링 시점을 계산한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6B
• /
• pp.420-429
• /
• 2008

Currently, IEEE 802.11 Network could not support optimized tunneling scheme and buffering scheme based on movement detection to reduce multimedia data packet loss when an MN move from current subnet to new subnet during handover. It is because IEEE 802.11 did not transfer information of movement detection to AP. In this paper, we proposed new fast handover scheme by using advanced access point and optimized snoop protocol for network based Proxy Mobile IPv6 in IEEE 802.11 Networks. During handover, the proposed scheme reduces both the multimedia data packet loss rate and the packet reordering problems without changing MN's mobility stack in IEEE 802.11 Networks.