• Title/Summary/Keyword: packet reordering

Search Result 29, Processing Time 0.02 seconds

Improving the performance of Multipath TCP using Delay Alerted Path-blocking Scheduler in Heterogeneous Networks (이종 망에서의 지연경보 경로차단 스케줄러를 이용한 MPTCP성능 개선방안)

  • Kim, Min Sub;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.28-37
    • /
    • 2017
  • Multipath TCP (MPTCP), which is a layer 4 protocol that can get the reliability and the efficiency of the transmission by using multipath transfer, was standardized by the IETF. MPTCP provides superior performance when compared to a single TCP when used in a homogeneous network with similar network characteristics. However, MPTCP degrades performance when used in heterogeneous networks with different network characteristics. In this paper, we propose 'Delay-alerted path-blocking scheduler'. It measures the delay of each path and blocks the path with a long delay to reduce the order of packets in the receive buffer. If the duplicated packet is sent to the blocked path to measure the delay and the congestion on the blocking path is reduced, the blocked path is unblocked. For performance analysis, the proposed scheduler was implemented in the Linux kernel and improved performance was obtained in the test bed. We also confirmed that the proposed scheduler reduces the degradation of MPTCP performance in real wireless networks with heterogeneous path characteristics.

A Study on RTP-based Lip Synchronization Control for Very Low Delay in Video Communication (초저지연 비디오 통신을 위한 RTP 기반 립싱크 제어 기술에 관한 연구)

  • Kim, Byoung-Yong;Lee, Dong-Jin;Kwon, Jae-Cheol;Sim, Dong-Gyu
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.8
    • /
    • pp.1039-1051
    • /
    • 2007
  • In this paper, a new lip synchronization control method is proposed to achieve very low delay in the video communication. The lip control is so much vital in video communication as delay reduction. In a general way, to control the lip synchronization, both the playtime and capture time calculated from RTP time stamp are used. RTP timestamp is created by stream sender and sent to the receiver along the stream. It is extracted from the received packet by stream receiver to calculate playtime and capture time. In this paper, we propose the method of searching most adjacent corresponding frame of the audio signal, which is assumed to be played with uniform speed. Encoding buffer of stream sender is removed to reduce the buffering delay. Besides, decoder buffer of receiver, which is used to correct the cracked packet, is resulted to process only 3 frames. These mechanisms enable us to achieve ultra low delay less than 100 ms, which is essential to video communication. Through simulations, the proposed method shows below the 100 ms delay and controlled the lip synchronization between audio and video.

  • PDF

The Study on matrix based high performance pattern matching by independence partial match (독립 부분 매칭에 의한 행렬 기반 고성능 패턴 매칭 방법에 관한 연구)

  • Jung, Woo-Sug;Kwon, Taeck-Geun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.914-922
    • /
    • 2009
  • In this paper, we propose a matrix based real-time pattern matching method, called MDPI, for real-time intrusion detection on several Gbps network traffic. Particularly, in order to minimize a kind of overhead caused by buffering, reordering, and reassembling under the circumstance where the incoming packet sequence is disrupted, MDPI adopts independent partial matching in the case dealing with pattern matching matrix. Consequently, we achieved the performance improvement of the amount of 61% and 50% with respect to TCAM method efficiency through several experiments where the average length of the Snort rule set was maintained as 9 bytes, and w=4 bytes and w=8bytes were assigned, respectively, Moreover, we observed the pattern scan speed of MDPI was 10.941Gbps and the consumption of hardware resource was 5.79LC/Char in the pattern classification of MDPI. This means that MDPI provides the optimal performance compared to hardware complexity. Therefore, by decreasing the hardware cost came from the increased TCAM memory efficiency, MDPI is proven the cost effective high performance intrusion detection technique.

Reducing the Flow Completion Time for Multipath TCP

  • Heo, GeonYeong;Yoo, Joon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.8
    • /
    • pp.3900-3916
    • /
    • 2019
  • The modern mobile devices are typically equipped with multiple network interfaces, e.g., 4G LTE, Wi-Fi, Bluetooth, but the current implementation of TCP can support only a single path at the same time. The Multipath TCP (MPTCP) leverages the multipath feature and provides (i) robust connection by utilizing another interface if the current connection is lost and (ii) higher throughput than single path TCP by simultaneously leveraging multiple network paths. However, if the performance between the multiple paths are significantly diverse, the receiver may have to wait for packets from the slower path, causing reordering and buffering problems. To solve this problem, previous MPTCP schedulers mainly focused on predicting the latency of the path beforehand. Recent studies, however, have shown that the path latency varies by a large margin over time, thus the MPTCP scheduler may wrongly predict the path latency, causing performance degradation. In this paper, we propose a new MPTCP scheduler called, choose fastest subflow (CFS) scheduler to solve this problem. Rather than predicting the path latency, CFS utilizes the characteristics of these paths to reduce the overall flow completion time by redundantly sending the last part of the flow to both paths. We compare the performance through real testbed experiments that implements CFS. The experimental results on both synthetic packet generation and actual Web page requests, show that CFS consistently outperforms the previous proposals in all cases.

Smooth Dupthresh Mechanism for Advanced TCP-DAD (중복 응답 임계값의 완만한 조절 기법을 통한 향상된 TCP-DAD)

  • Park, Min-Woo;Kim, Jong-Myoung;Han, Young-Ju;Kwon, Yoon-Joo;Lee, Gil-Jae;Chung, Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.971-974
    • /
    • 2008
  • 오늘날 네트워크는 장비의 발달로 인해 패킷 재배치(packet reordering)가 빈번히 일어나고 있다. 패킷 재배치는 TCP의 성능을 저하시키는 문제점을 가지는데, 이러한 문제점을 해결하기 위해 TCPDAD 메커니즘이 제안되었다. TCP-DAD는 중복 응답 임계값을 동적으로 조절함으로써, TCP의 패킷 재배치 문제를 완화하는 메커니즘이다. 하지만 TCP-DAD는 중복 응답 임계값을 조절하는 메커니즘에 문제가 있어 패킷 손실이 일어날 경우, 패킷 손실에 대한 복구가 늦어지고 심지어 재전송 타이머가 불필요하게 종료되어 TCP의 성능저하를 야기하기도 한다. 본 논문에서는 이러한 TCP-DAD의 문제점을 해결하기 위해 새로운 중복 응답 임계값 조절 기법으로 Smooth-dupthresh를 제안한다. NS-2를 이용한 시뮬레이션을 통해 Smooth-dupthresh 기법을 적용한 TCP-DAD가 기존의 TCP-DAD 보다 평균적으로 약 8% 향상된 성능을 보임을 증명하였다.

A Comparative Study of Aggregation Schemes for Concurrent Transmission over Multiple WLAN Interfaces (다중 무선랜 인터페이스 전송을 위한 결합 방식의 성능 연구)

  • Saputra, Yuris Mulya;Hwang, Hwanwoong;Yun, Ji-Hoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.7
    • /
    • pp.18-25
    • /
    • 2014
  • To increase wireless capacity, the concurrent use of multiple wireless interfaces on different frequency bands, called aggregation, can be considered. In this paper, we focus on aggregation of multiple Wi-Fi interfaces with packet-level traffic spreading between the interfaces. Two aggregation schemes, link bonding and multipath TCP (MPTCP), are tested and compared in a dualband Wi-Fi radio system with their Linux implementation. Various test conditions such as traffic types, network delay, locations, interface failures and configuration parameters are considered. Experimental results show that aggregation increases throughput performance significantly over the use of a single interface. Link bonding achieves lower throughput than MPTCP due to duplicate TCP acknowledgements (ACKs) resulting from packet reordering and filtering such duplicate ACKs out is considered as a possible solution. However, link bonding is fast responsive to links' status changes such as a link failure. It is shown that different combinations of interface weights for packet spread in link bonding result in different throughput performance, envisioning a spatio-temporal adaptation of the weights. We also develop a mathematical model of power consumption and compare the power efficiency of the schemes applying different power consumption profiles.

Design of Adaptive DCF algorithm for TCP Performance Enhancement in IEEE 802.11 based Mobile Ad-hoc Networks (IEEE 802.11 기반 이동 ad-hoc 망에서 TCP 성능 향상을 위한 적응적 DCF 알고리즘 설계)

  • Kim, Han-Jib;Lee, Gi-Ra;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.10 s.352
    • /
    • pp.79-89
    • /
    • 2006
  • TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

Analysis on Energy Consumption Required for Building DTLS Session Between Lightweight Devices in Internet of Things (사물인터넷에서 경량화 장치 간 DTLS 세션 설정 시 에너지 소비량 분석)

  • Kwon, Hyeokjin;Kang, Namhi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.8
    • /
    • pp.1588-1596
    • /
    • 2015
  • In the Internet of Things (IoT), resource-constrained devices such as sensors are capable of communicating and exchanging data over the Internet. The IETF standard group has specified an application protocol CoAP, which uses UDP as a transport protocol, allows such a lightweight device to transmit data. Also, the IETF recommended the DTLS binding for securing CoAP. However, additional features should be added to the DTLS protocol to resolve several problems such as packet loss, reordering, fragmentation and replay attack. Consequently, performance of DTLS is worse than TLS. It is highly required for lightweight devices powered by small battery to design and implement a security protocol in an energy efficient manner. This paper thus discusses about DTLS performance in the perspective of energy consumption. To analyze the performance, we implemented IEEE 802.15.4 based test network consisting of constrained sensor devices in the Cooja simulator. We measured energy consumptions required for each of DTLS client and server in the test network. This paper compares the energy consumption and amount of transmitted data of each flight of DTLS handshake, and the processing and receiving time. We present the analyzed results with regard to code size, cipher primitive and fragmentation as well.

Fast Handover Mechanism for Multi-Interface MIPv6 Environments and Performance Evaluation (다중 인터페이스 MIPv6 환경에서의 Fast Handover 방안 및 성능 분석)

  • Park, Man-Kyu;Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.34-43
    • /
    • 2007
  • Recently, in addition to the sharp increase of mobile nodes, various kinds of wireless technologies are available for mobile nodes. If IPv6 technology is applied to the network, multi-homing terminals which have several public IP addresses on one interface will be common. Accordingly, there are many research activities on mobility management for multi-interface, multi-homming nodes. In this paper we propose an extended fast handover mechanism for multi-interface MIPv6 environments that uses multi-interface FBU (MFBU) message instead of the existing FBU message. The MFBU message has the "tunnel destination" mobility option that points a specific tunnel destination other than NAR, and "T" flag that indicates the existence of tunnel destination option. The proposed mechanism can improve the TCP performance by mitigating packet reordering during FMIPv6 handover that can cause unnecessary congestion control due to 3 duplicate ACKs. In this paper, we implemented a multi-Interface MIPv6 simulator by extending a single-interface MIPv6 simulator in NS-2, and showed that the performance of TCP traffic is improved by using the proposed multi-interface fast MIPv6.