Loss Recovery Mechanism Research Articles

Traditional vs. Modern Data Paths: A Comprehensive Survey

Recently, many new network paths have been introduced while old paths are still in use. The trade-offs remain vague and should be further addressed. Since last decade, the Internet is playing a major role in people’s lives, and the demand on the Internet in all fields has increased rapidly. In order to get a fast and secure connection to the Internet, the networks providing the service should get faster and more reliable. Many network data paths have been proposed in order to achieve the previous objectives since the 1970s. It started with the Transmission Control Protocol (TCP) and the User Datagram Protocol (UDP) and later followed by several more modern paths including Quick UDP Internet Connections (QUIC), remote direct memory access (RDMA), and the Data Plane Development Kit (DPDK). This raised the question on which data path should be adopted and based on which features. In this work, we try to answer this question using different perspectives such as the protocol techniques, latency and congestion control, head of line blocking, the achieved throughput, middleboxes consideration, loss recovery mechanisms, developer productivity, host resources utilization and targeted application.

T-RACKs: A Faster Recovery Mechanism for TCP in Data Center Networks

Cloud interactive data-driven applications generate swarms of small TCP flows that compete for the small switch buffer space in data-center. Such applications require a small flow completion time (FCT) to be effective. Unfortunately, TCP is myopic with respect to the composite nature of application data. In addition it tends to artificially inflate the FCT of individual flows by several orders of magnitude, because of its Internet-centric design, that fixes the retransmission timeout (RTO) to be at least hundreds of milliseconds. To better understand this problem, in this paper, we use empirical measurements in a small data center testbed to study, at a microscopic level, the effects of various types of packet losses on TCP's performance. In particular, we single out packet losses that impact the tail end of small flows, as well as bursty losses that span a significant fraction of small TCP congestion windows, and show a non-negligible effect of such losses on the FCT. Based on this, we propose the so-called, timely-retransmitted ACKs (or T-RACKs), a simple loss recovery mechanism that conceals the drawbacks of the long RTO even in the presence of heavy packet losses. Interestingly enough, T-RACKS achieves this transparently to TCP itself as it does not require any change to TCP in the tenant's virtual machine (VM) or container. T-RACKs can be implemented as a software shim layer in the hypervisor between the VMs and the server's NIC or in hardware as a networking function in a SmartNIC. Simulation and real testbed results show remarkable performance improvements.

Reducing web latency with coding-based fast multi-path loss recovery

TCP latency is critical to the performance of Web services. However, packet loss greatly impairs the TCP performance due to its poor loss recovery mechanisms. Recent work FUSO addressed this problem by leveraging multi-path diversity for proactive loss recovery, i.e., using “good” paths to proactively retransmit the potentially lost packet on “bad” paths before they are retransmitted after duplicate ACKs or timeout. Nevertheless, since it has no clue about which packet is (or will be) lost, FUSO simply proactively retransmits the oldest unACKed packet whenever there is a chance for proactive loss recovery. Through analysis and comprehensive experiments, we show that although FUSO behaves well in data center networks, which it is originally designed for, in the Internet scenario, such simple proactive retransmission of the oldest unACKed packet is not accurate enough to recover the lost packets, which causes performance penalty. To address the problem, this paper presents CoFUSO, a Coding-Based Fast Multi-Path Loss Recovery. Different from FUSO, when there is a chance for proactive loss recovery, CoFUSO generates a coding packet that codes all (or multiple) unACKed packets together. As such, CoFUSO can always proactively retransmit the “right” lost packet, since the receiver side can decode the lost packet by combining the coding packet with other received packets. We implement CoFUSO in Linux kernel with $$\sim$$ 2K lines of code. Testbed and simulation results show that, under lossy condition, CoFUSO can greatly improve the average and 99th percentile flow completion time (FCT) by $$\sim$$ 12% and $$\sim$$ 59% in the testbed, and up to $$\sim$$ 16.9% and $$\sim$$ 54.5% in the simulation, respectively.

Deep Learning based Loss Recovery Mechanism for Video Streaming over Mobile Information-Centric Network

Deep Learning based Loss Recovery Mechanism for Video Streaming over Mobile Information-Centric Network

Energy-Efficient Target Tracking Algorithm for WSNs

In order to solve the problem of node energy consumption in wireless sensor networks, an energy-efficient tracking cluster structure is proposed. The structure of the tracking cluster is determined by the cooperation between the auxiliary node and the cluster head node, and avoids the redundant nodes participating in the tracking. In order to balance the energy consumption of cluster head nodes, the method predict the position of target in next time by making auxiliary nodes track algorithm, then according to the prediction results, the nodes near prediction position are woken up in advance to reduce the energy consumption in the whole net. In the process of tracking, the loss recovery mechanism is adopted to solve the target loss phenomenon, and the continuous tracking of the target is completed. Finally, experiments are carried out with the improved particle filter algorithm. The simulation results show that the proposed algorithm can reduce the energy consumption of the nodes under the condition that the tracking accuracy is satisfied. Make the whole network energy consumption more balanced.

A Novel Loss Recovery and Tracking Scheme for Maneuvering Target in Hybrid WSNs.

Tracking a mobile target, which aims to timely monitor the invasion of specific target, is one of the most prominent applications in wireless sensor networks (WSNs). Traditional tracking methods in WSNs only based on static sensor nodes (SNs) have several critical problems. For example, to void the loss of mobile target, many SNs must be active to track the target in all possible directions, resulting in excessive energy consumption. Additionally, when entering coverage holes in the monitoring area, the mobile target may be missing and then its state is unknown during this period. To tackle these problems, in this paper, a few mobile sensor nodes (MNs) are introduced to cooperate with SNs to form a hybrid WSN due to their stronger abilities and less constrained energy. Then, we propose a valid target tracking scheme for hybrid WSNs to dynamically schedule the MNs and SNs. Moreover, a novel loss recovery mechanism is proposed to find the lost target and recover the tracking with fewer SNs awakened. Furthermore, to improve the robustness and accuracy of the recovery mechanism, an adaptive unscented Kalman filter (AUKF) algorithm is raised to dynamically adjust the process noise covariance. Simulation results demonstrate that our tracking scheme for maneuvering target in hybrid WSNs can not only track the target effectively even if the target is lost but also maintain an excellent accuracy and robustness with fewer activated nodes.

A Receiver-Driven Loss Recovery Mechanism for Video Dissemination over Information-Centric VANET

Information-Centric Vehicular Ad Hoc Network (IC-VANET) is a promising network architecture for the future intelligent transport system. Video streaming applications over IC-VANET not only enrich infotainment services, but also provide the drivers and pedestrians real-time visual information to make proper decisions. However, due to the characteristics of wireless link and frequent change of the network topology, the packet loss seriously affects the quality of video streaming applications. In this paper, we propose a REceiver-Driven loss reCOvery Mechanism (REDCOM) to enhance video dissemination over IC-VANET. A Markov chain based estimation model is introduced to capture the real-time network condition. Based on the estimation result, the proposed REDCOM recovers the lost packets by requesting additional forward error correction packets. The REDCOM follows the receiver-driven model of IC-VANET and does not require the infrastructure support to efficiently overcome packet losses. Experimental results demonstrate that the proposed REDCOM improves video quality under various network conditions.

ALORT: a transport layer protocol using adaptive loss recovery method for WSN

Recently, critical projects were developed using wireless sensor network (WSN) such as medical and military projects. Performing reliable communication in WSN is extremely important for such projects. To be able to perform reliable communication, packet loss must be minimal. Packet loss, energy and latency are the most serious problems for transport protocols. In this paper, reliable, energy- and delay-sensitive transport layer protocol (ALORT) has been developed for WSN. The proposed protocol provides optimum reliability, optimum packet latency, minimum energy cost and high packet delivery ratio by changing loss recovery mechanism (LRM) according to channel error rates. ALORT algorithm is compared with PSFQ and DTC in terms of packet delivery ratio, end-to-end latency and energy cost by MIXIM framework in OMNET++. ALORT algorithm reduces energy cost and end-to-end latency and increases packet delivery ratio.

Packet dispersion strategy evaluation from the perspective of packet loss pattern and VoIP quality

The appearance of burst packet losses and its devastating effect on Voice over IP (VoIP) service have imposed a requirement for the implementation of loss recovery mechanisms to address VoIP quality during periods when high packet loss is exhibited. Existing loss recovery mechanisms are dependent on end point capabilities, whereas Quality of service (QoS) routing protocols suffer from complexity and scalability issues. In this paper, we examine packet dispersion?s ability to address burst losses and provide a computational model, which is verified using real network testing. A study has been carried out to investigate the effect of different packet dispersion strategies on burst losses, which clearly shows dispersion?s qualitative superiority over single path routing. Furthermore, an analytical approach is proposed resulting in quality estimation obtained by individual strategies. Practical evaluation has shown that each strategy copes differently with various burst scenarios in order to maximize VoIP quality.

Satellite-TCP: A Flow Control Algorithm for Satellite Network

Objective: In this world of advanced technology, satellite communication is the basis for all data communications. TCP was designed to be flexible and robust but it cannot perform efficiently over the satellite links with long delay. The major objective of our work is to propose a novel flow control algorithm for satellite network to prevent the heavy degradation in the network performance due to long propagation delay, high bit error rate and bandwidth asymmetry. Methods: A strong flow control mechanism is necessary to eliminate the network performance degradation due to the satellite link characteristics like long propagation delay, high bit error rate and bandwidth asymmetry. Satellite-TCP is a flow control mechanism based on the negative acknowledgement strategy and connection splitting. The satellite link utilization is monitored and the active connections are assigned with the window values. The window values were considered as it can easily reflect the available bandwidth in the satellite links. Findings: The major problems affecting the performance in satellite links are long propagation delay, high bit error rate and bandwidth asymmetry. The proposed Flow Control Algorithm called Satellite-TCP is based on controlling the flow of Negative Acknowledgement packets (NACK), according to the level of congestion at the network. The two main modules in the proposed system include an enhanced TCP flow control mechanism and a data loss recovery mechanism. Among this the flow control is based on link utilization measurements and throughput calculation techniques. Data loss recovery strategy is based on Negative Acknowledgements coming from the receiver side. In this way, we can decrease the amount of packet loss in the network and even eliminate the packet loss, sometimes. Satellite-TCP adopts a window growth strategy to accelerate the speed of increase in the size of congestion window. The flow control mechanism not only enhanced the throughput of forward link but also greatly reduced the bandwidth occupancy rate in back-ward link in the satellite network. This in turn increases the overall performance of the satellite link. Improvements: If we add a priority based strategy to the new flow control mechanism, it can judge the network performance according to the data loss. Moreover we are expecting that, if we add a priority bit based strategy to the new flow control mechanism, it will help to distinguish the specific reasons for data loss and can take corresponding flow control strategies. While considering the throughput and loss rate, Satellite –TCP is showing excellent performance in the case of forward link but it performs poor in the case of backward link. So we are planning to extend our work in such a way that it will perform well in the case of backward link also.

An Evaluation of Tail Loss Recovery Mechanisms for TCP

Interactive applications do not require more bandwidth to go faster. Instead, they require less latency. Unfortunately, the current design of transport protocols such as TCP limits possible latency reductions. In this paper we evaluate and compare different loss recovery enhancements to fight tail loss latency. The two recently proposed mechanisms "RTO Restart" (RTOR) and "Tail Loss Probe" (TLP) as well as a new mechanism that applies the logic of RTOR to the TLP timer management (TLPR) are considered. The results show that the relative performance of RTOR and TLP when tail loss occurs is scenario dependent, but with TLP having potentially larger gains. The TLPR mechanism reaps the benefits of both approaches and in most scenarios it shows the best performance.

Transmission Power Control with the Guaranteed Communication Reliability in WSN

In a wireless sensor network, sensor nodes are deployed in an ad hoc fashion and they deliver data packets using multihop transmission. However, transmission failures occur frequently in the multihop transmission over wireless media. Thus, a loss recovery mechanism is required to provide end-to-end reliability. In addition, because the sensor nodes are very small devices and have insufficient resources, energy-efficient data transmission is crucial for prolonging the lifetime of a wireless sensor network. This paper proposes a transmission power control mechanism for reliable data transmission, which satisfies communication reliability through recovery of lost packets. The proposed method calculates packet reception rate (PRR) of each hop to maintain end-to-end packet delivery rate (PDR), which is determined based on the desired communication reliability. Then, the transmission power is adjusted based on the PRR to reduce energy consumption. The proposed method was evaluated through extensive simulations, and the results show that it leads to more energy-efficient data transmission compared to existing methods.

Analysis and Improvement of Send-and-Wait Automatic Repeat-reQuest Protocols for Wireless Sensor Networks

Due to the characteristics of wireless sensor networks (WSNs) and the unique communication pattern, it is crucial to disseminate messages in wireless sensor networks by a reliable and energy-efficient way. Although send and wait automatic repeat-request (SW-ARQ) has been the most widely used and well studied mechanism to ensure reliable data transmission in wired network, such as cable networks. Little attention has been paid to SW-ARQ in wireless sensor networks. Unlike wired network, sensor nodes in WSNs are power limited. And the nodal lifetime is the most crucial issue for WSN design. As a result, the ARQ-based packet loss recovery mechanisms proposed for wired network cannot be directly applied to WSNs. In this paper, we present an analysis strategy that characterizes the trade-off between energy consumption and source-to-sink statistical reliability (or simply reliability). Based on the insight gained about the nodal data load and energy consumption, we propose an analysis of strategy to meet the specific requirements of a sensing application in terms of lifetime and reliability in WSNs. More importantly, we propose a new SW-ARQ protocol named $$s$$send and $$w$$wait one $$d$$data $$m$$multi-$$A$$ACK (SW-ODMA) ARQ protocol to improve the energy efficiency and statistically reliability. In this protocol, multiple ACKs are returned after receiving one data packet, although the number of ACK packets sent by nodes is increased, the times of sending data packets that consumes large energy consumption decline. So the nodal energy consumption is reduced and thus the network lifetime is improved. Also, we give the applicability of SW-ODMA, as well as the algorithm that maximizes the lifetime under the premise of the network reliability requirement. Our simulation results are found to be consistent with our theoretical results, and demonstrated that the SW-ODMA protocol boosted the energy efficiency and reliability. Therefore, SW-ODMA protocol can be widely applied in WSNs with important significance.

Performance analysis and improvement of loss recovery mechanisms in star OBS networks

In OBS networks, burst loss affects negatively the performance of the higher layers. Proactive loss recovery mechanisms, such as burst cloning, have the advantage of low burst delay but it suffers from low bandwidth utilization. However, reactive loss recovery mechanisms, such as burst retransmission, have the advantage of high bandwidth utilization but at the cost of high burst delay. In this paper, we present an analysis of this trade-off and we propose two new schemes to improve bandwidth utilization while keeping burst delay as low as possible in star OBS networks. The first scheme controls the retransmissions. The second scheme combines burst cloning and burst retransmission mechanisms. Analytical and simulation results show that the both schemes achieve high bandwidth utilization. The results confirm also that compared to basic burst retransmission scheme, the first scheme reduces burst delay only at moderate and high load, however, the second scheme reduce delay at every load.

Hybrid approach for loss recovery mechanism in OBS networks

This letter reports a study of a hybrid burst assembly and a hybrid burst loss recovery scheme (delay-based burst assembly and hybrid loss recovery (DBAHLR)) which selectively employs proactive or reactive loss recovery techniques depending on the classification of traffic into short term and long term, respectively. Traffic prediction and segregation of optical burst switching network flows into the long term and short term are conducted based on predicted link holding times using the hidden Markov model (HMM). The hybrid burst assembly implemented in DBAHLR uses a consecutive average-based burst assembly to handle jitter reduction necessary in real-time applications, with variations in burst sizes due to the non-monotonic nature of the average delay handled by additional burst length thresholding. This dynamic hybrid approach based on HMM prediction provides overall a lower blocking probability and delay and more throughput when compared with forward segment redundancy mechanism or purely HMM prediction-based adaptive burst sizing and wavelength allocation (HMM-TP).

Reducing web latency

To serve users quickly, Web service providers build infrastructure closer to clients and use multi-stage transport connections. Although these changes reduce client-perceived round-trip times, TCP's current mechanisms fundamentally limit latency improvements. We performed a measurement study of a large Web service provider and found that, while connections with no loss complete close to the ideal latency of one round-trip time, TCP's timeout-driven recovery causes transfers with loss to take five times longer on average. In this paper, we present the design of novel loss recovery mechanisms for TCP that judiciously use redundant transmissions to minimize timeout-driven recovery. Proactive, Reactive, and Corrective are three qualitatively-different, easily-deployable mechanisms that (1) proactively recover from losses, (2) recover from them as quickly as possible, and (3) reconstruct packets to mask loss. Crucially, the mechanisms are compatible both with middleboxes and with TCP's existing congestion control and loss recovery. Our large-scale experiments on Google's production network that serves billions of flows demonstrate a 23% decrease in the mean and 47% in 99th percentile latency over today's TCP.

Evaluating TCP-friendliness in light of Concurrent Multipath Transfer

In prior work, a CMT protocol using SCTP multihoming (termed SCTP-based CMT) was proposed and investigated for improving application throughput. SCTP-based CMT was studied in (bottleneck-independent) wired networking scenarios with ns-2 simulations. This paper studies the TCP-friendliness of CMT in the Internet. In this paper, we surveyed historical developments of the TCP-friendliness concept and argued that the original TCP-friendliness doctrine should be extended to incorporate multihoming and SCTP-based CMT.Since CMT is based on (single-homed) SCTP, we first investigated TCP-friendliness of single-homed SCTP. We discovered that although SCTP’s congestion control mechanisms were intended to be “similar” to TCP’s, being a newer protocol, SCTP specification has some of the proposed TCP enhancements already incorporated which results in SCTP performing better than TCP. Therefore, SCTP obtains larger share of the bandwidth when competing with a TCP flavor that does not have similar enhancements. We concluded that SCTP is TCP-friendly, but achieves higher throughput than TCP, due to SCTP’s better loss recovery mechanisms just as TCP-SACK and TCP-Reno perform better than TCP-Tahoe.We then investigated the TCP-friendliness of CMT. Via QualNet simulations, we found out that one two-homed CMT association has similar or worse performance (for smaller number of competing TCP flows) than the aggregated performance of two independent, single-homed SCTP associations while sharing the link with other TCP connections, for the reason that a CMT flow creates a burstier data traffic than independent SCTP flows. When compared to the aggregated performance of two-independent TCP connections, one two-homed CMT obtains a higher share of the tight link bandwidth because of better loss recovery mechanisms in CMT. In addition, sharing of ACK information makes CMT more resilient to losses. Although CMT obtains higher throughput than two independent TCP flows, CMT’s AIMD-based congestion control mechanism allows other TCP flows to co-exist in the network. Therefore, we concluded that CMT is TCP-friendly, similar to two TCP-Reno flows are TCP-friendly when compared to two TCP-Tahoe flows.

Improving TCP Performance Over Wireless Network With Frequent Disconnections

Presented in this paper is the solution to the problem that arises when the TCP/IP protocol suite is used to provide Internet connectivity through mobile terminals over emerging 802.11 wireless links. Taking into consideration the strong drive towards wireless Internet access through mobile terminals, the problem of frequent disconnections causing serial timeouts is examined and analyzed, with the help of extensive simulations. After a detailed review of wireless link loss recovery mechanism and identification of related problems, a new scheme with modifications at link layer and transport layer is proposed. The proposed modifications which depend on interaction between two layers (i) reduce the idle time before transmission at TCP by preventing timeout occurrences and (ii) decouple the congestion control from recovery of the losses due to link failure. Results of simulation based experiments demonstrate considerable performance improvement with the proposed modifications over the conventional TCP, when a wireless sender is experiencing frequent link failures.

Clustering‐based power‐controlled routing for mobile wireless sensor networks

SUMMARYThis paper presents two new routing protocols for mobile sensor networks, viz. power‐controlled routing (PCR) and its enhanced version, i.e. Enhanced Power‐Controlled Routing (EPCR). In both the protocols, fixed transmission power is employed in the clustering phase but when ordinary nodes are about to send their data to their respective cluster‐heads, they change their transmission power according to their distance from their cluster‐head. While in PCR, the nodes are associated with the cluster‐head on the basis of weight, in EPCR it is done on the basis of distance. In addition to the protocols, we are suggesting a packet loss recovery mechanism for the PCR and EPCR. Both protocols work well for both mobile and static networks and are designed to achieve high network lifetime, high packet delivery ratio, and high network throughput. These protocols are extensively simulated using mass mobility model, with different speeds and different number of nodes to evaluate their performance. Simulation results show that both PCR and EPCR are successful in achieving their objectives by using variable transmission powers and smart clustering. Copyright © 2011 John Wiley & Sons, Ltd.

무선 환경에서 TCP 스퓨리어스 타임아웃 방지를 위한 SR-ARQ 재전송 지속성 관리 방안

To detect and recover packet losses over wireless links is very important in terms of reliability in packet transmission. Most wireless communication systems adopt an automatic repeat request (ARQ) protocol operating at link layer. However, it has been constantly addressed that the interaction not harmonized sufficiently between ARQ and TCP rather degrades TCP performance. In this paper, therefore, we propose an improved scheme from the aspect of the interaction with TCP loss recovery mechanism that can be applied to selective repeat ARQ (SR-ARQ) protocol and prove that the proposed scheme improves TCP performance significantly by OPNET simulations.