• Title/Summary/Keyword: Packet reordering

Search Result 29, Processing Time 0.029 seconds

Receiver-centric Buffer Blocking-aware Multipath Data Distribution in MPTCP-based Heterogeneous Wireless Networks

  • Cao, Yuanlong;Liu, Qinghua;Zuo, Yi;Ke, Fenfen;Wang, Hao;Huang, Minghe
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4642-4660
    • /
    • 2016
  • One major concern of applying Multipath TCP (MPTCP) to data delivery in heterogeneous wireless networks is that the utilization of asymmetric paths with diverse networking-related parameters may cause severe packet reordering and receive buffer blocking (RB2LOC). Although many efforts are devoting to addressing MPTCP's packet reordering problems, their sender-controlled solutions do not consider balancing overhead between an MPTCP sender and receiver, and their fully MPTCP mode cannot make MPTCP achieve a desired performance. This paper proposes a novel receiver-centric buffer blocking-aware data scheduling strategy for MPTCP (dubbed MPTCP-rec) necessitating the following aims: (1) alleviating MPTCP's packet reordering and RB2LOC problems, (2) improving the MPTCP performance, and (3) balancing load between the MPTCP sender and receiver. Simulation results show that the proposed MPTCP-rec solution outperforms the existing MPTCP solutions in terms of data delivery performance in heterogeneous wireless networks.

TCP Performance Improvement in Network Coding over Multipath Environments (다중경로 환경의 네트워크 코딩에서의 TCP 성능개선 방안)

  • Lim, Chan-Sook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.6
    • /
    • pp.81-86
    • /
    • 2011
  • In one of the most impacting schemes proposed to address the TCP throughput problem over network coding, the network coding layer sends an acknowledgement if an innovative linear combination is received, even when a new packet is not decoded. Although this scheme is very effective, its implementation requires a limit on the coding window size. This limitation causes low TCP throughput in the presence of packet reordering. We argue that a TCP variant detecting a packet loss relying only on timers is effective in dealing with the packet reordering problem in network coding environments as well. Also we propose a new network coding layer to support such a TCP variant. Simulation results for a 2-path environment show that our proposed scheme improves TCP throughput by 19%.

Effects of Packet-Scatter on TCP Performance in Fat-Tree (Fat-Tree에서의 패킷분산이 TCP 성능에 미치는 영향)

  • Lim, Chansook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.215-221
    • /
    • 2012
  • To address the bottleneck problem in data center networks, there have been several proposals for network architectures providing high path-diversity. In devising new schemes to utilize multiple paths, one must consider the effects on TCP performance because packet reordering can make TCP perform poorly. Therefore most schemes prevent packet reordering by sending packets through one of multiple available paths. In this study we show that packet reordering does not occur severely enough to have a significant impact on TCP performance when scattering packets through all available paths between a pair of hosts in Fat-Tree. Simulation results imply that it is possible to find a low-cost solution to the TCP performance problem for Fat-Tree-like topologies.

Enhancing TCP Performance to Persistent Packet Reordering

  • Leung Ka-Cheong;Ma Changming
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.385-393
    • /
    • 2005
  • In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

A New Packet-level Load-balancing Scheme for Fat-Trees (Fat-Tree에서의 새로운 패킷 단위 부하분산 방식)

  • Lim, Chansook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.53-58
    • /
    • 2013
  • A Fat-Tree topology has multiple paths between any pair of hosts. The delay for the multiple paths with an equal number of hops depends mainly on the queuing delay. However, most of the existing load-balancing schemes do not sufficiently exploit the characteristics of Fat-Tree. In most schemes load-balancing is performed at a flow level. Packet-level load-balancing schemes usually require the availability of special transport layer protocols to address packet reordering. In this paper, we propose a new packet-level load-balancing scheme which can enhance network utilization while minimizing packet reordering in Fat-Trees. Simulation results show that the proposed scheme provides as high TCP throughput as a randomized flow-level Valiant load balancing scheme for a best case.

On the Performance Degradation Characteristics of High-Speed Enterprise Network (고속 엔터프라이즈 네트워크에서 성능 저하 특성 규명)

  • Ju, Hong-Taek;Hong, Seong-Cheol;Hong, James Won-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1225-1233
    • /
    • 2009
  • ISPs and Enterprises are equipping their networks with sufficiently high speed facilities and provide large bandwidths members. However the high speed enterprise network does not have satisfying end-to-end network performance within the network in spite of under utilization. The root cause of this performance degradation is a micro-congestion, which is a short-live event of traffic congestion. A micro-congestion causes packet loss, delay and packet reodering, and finally results in end-to-end network performance degradation. In this paper, we propose a micro-congestion detection method and find out the characteristics of performance degradation by analyzing traffic archives which is collected from a network link when a micro-congestion occurs.

SPMLD: Sub-Packet based Multipath Load Distribution for Real-Time Multimedia Traffic

  • Wu, Jiyan;Yang, Jingqi;Shang, Yanlei;Cheng, Bo;Chen, Junliang
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.548-558
    • /
    • 2014
  • Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) How to minimize end-to-end delay and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose sub-packet based multipath load distribution (SPMLD), a new model that splits traffic at the granularity of sub-packet. Our SPMLD model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. Third, in order to describe SPMLD's scheduling policy, we propose two distributed algorithms respectively implemented in the source and destination nodes. We evaluate the performance of SPMLD through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in terms of video peak signal-to-noise ratio, total packet delay, end-to-end delay, and risk of packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.

Packet Scheduling Scheme and Receiver-Based Recovery Scheme for MPTCP in Heterogeneous Networks (이종망에서 MPTCP를 위한 패킷 스케줄링 방법과 수신단 기반의 손실 복구 방법)

  • Oh, Bong-Hwan;Kim, Hanah;Lee, Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.11
    • /
    • pp.975-983
    • /
    • 2012
  • Multi network interface has become common phenomenon for mobile devices such as smart phone which has 3G, LTE-advanced, WiFi. Consequently, there are researches for a transmission strategies using multiple paths below on end-to-end connection. MPTCP which is proposed and being standardized by the IETF as a new transport protocol can perform concurrent multipath transfer using multiple network interfaces. However, current MPTCP has performance degradation when it use heterogeneous networks which have quite different network characteristics. Therefore, this paper proposes the packet scheduling scheme and receiver-based recovery scheme to reduce the performance degradation due to reordering problem. Also, simulation results show that the proposed scheme can improve throughput and retransmission performance.

Performance of DCTCP with per-packet scheduling in data center networks (데이터센터 네트워크의 패킷단위 스케줄링에서의 DCTCP 성능)

  • Lim, Chansook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.1
    • /
    • pp.15-21
    • /
    • 2018
  • Per-packet scheduling is more suitable than per-flow scheduling to reduce the flow completion time by efficiently utilizing resources in data center networks. Recently, many per-packet scheduling schemes utilizing multiple paths have been proposed. However, to mitigate the negative effect of packet reordering on TCP performance, most of the schemes require supplemental measures such as putting packets in order at the lower layer. In this study, we investigate how well DCTCP, which is a representative TCP for data center networks, performs with per-packet scheduling through simulation. Simulation results show that DCTCP keeps the queue length short but that DCTCP shows low fairness due to the way of reducing the congestion window by ECN.

MARS: Multiple Access Radio Scheduling for a Multi-homed Mobile Device in Soft-RAN

  • Sun, Guolin;Eng, Kongmaing;Yin, Seng;Liu, Guisong;Min, Geyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.79-95
    • /
    • 2016
  • In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.