Evaluation of retransmission strategies in a local area network environment (original) (raw)
Related papers
A Taxonomy and Survey of Retransmission Based Partially Reliable Protocols
The mismatch between the services offered by the two standard transport protocols in the Internet, TCP and UDP, and the services required by distributed multimedia applications has led to the development of a large number of partially reliable transport protocols. That is, protocols which in terms of reliability places themselves between TCP and UDP. This paper presents a taxonomy for retransmission based, partially reliable transport protocols, i.e., the subclass of partially reliable transport protocols that performs error recovery through retransmissions. The taxonomy comprises two classification schemes: one that classifies retransmission based, partially reliable transport protocols with respect to the reliability service they offer and one that classifies them with respect to their error control scheme. The objective of our taxonomy is fourfold: to introduce a unified terminology; to provide a framework in which retransmission based, partially reliable transport protocols can be examined, compared, and contrasted; to make explicit the error control schemes used by these protocols; and, finally, to gain new insights into these protocols and thereby suggest avenues for future research. Based on our taxonomy, a survey was made of existing retransmission based, partially reliable transport protocols. The survey shows how protocols are categorized according to our taxonomy, and exemplifies the majority of reliability services and error control schemes detailed in our taxonomy.
Design Choices for Selective-Repeat Retransmission Protocols
IEEE Transactions on Communications, 1981
The design of selective-repeat retransmission protocols to provide reliable transfer of large data files is discussed. The transmission system is assumed capable of losing, distorting, or reordering the transmitted data frames and acknowledgment frames. The principle design considerations center on methods for managing the finite sequence number space and methods for managing the finite-sized receiver buffer. Under the assumption that there exists a maximum time from transmission of a frame to receipt of an acknowledgment for that frame, methods are described for safe reuse of frame sequence numbers. Previous results by Metzner and Morgan on buffer overflow control are extended to cover non-FIFO transmission systems. A two-dimensional space of design parameters is explored by way of Monte Carlo simulations. For appropriate designs, it is shown that significant increases in throughput over that achieved by the Go-Back4 protocol are possible on high-rate long-delay channels. W 0090-6778/81/0700-0944$00.75 0 1981 IEEE
Analysis of Multi-Messages Retransmission Schemes
2021
Hybrid Automatic ReQuest (HARQ) protocol enables reliable communications in wireless systems. Usually, several parallel streams are sent in successive timeslots following a time-sharing approach. Recently, multi-layer HARQ has been proposed by superposing packets within a timeslot. In this paper, we evaluate the potential of this multi-layer HARQ by playing with some design parameters. We show that a gain in throughput is only obtained at mid-Signal-to-Noise Ratio (SNR).
The Bounded Retransmission Protocol must be on time! Full Version
1997
Abstract This paper concerns the transfer of les via a lossy communication channel. It formally speci es this le transfer service in a property-oriented way and investigates| using two di erent techniques| whether a given bounded retransmission protocol conforms to this service. This protocol is based on the wellknown alternating bit protocol but allows for a bounded number of retransmissions of a chunk, ie, part of a le, only. So, eventual delivery is not guaranteed and the protocol may abort the le transfer.
Taxonomy and survey of retransmission-based partially reliable transport protocols
Computer Communications, 2004
The mismatch between the services offered by the two standard transport protocols in the Internet, TCP and UDP, and the services required by distributed multimedia applications has led to the development of a large number of partially reliable transport protocols. That is, protocols which in terms of reliability places themselves between TCP and UDP. This paper presents a taxonomy for retransmission based, partially reliable transport protocols, i.e., the subclass of partially reliable transport protocols that performs error recovery through retransmissions. The taxonomy comprises two classification schemes: one that classifies retransmission based, partially reliable transport protocols with respect to the reliability service they offer and one that classifies them with respect to their error control scheme. The objective of our taxonomy is fourfold: to introduce a unified terminology; to provide a framework in which retransmission based, partially reliable transport protocols can be examined, compared, and contrasted; to make explicit the error control schemes used by these protocols; and, finally, to gain new insights into these protocols and thereby suggest avenues for future research. Based on our taxonomy, a survey was made of existing retransmission based, partially reliable transport protocols. The survey shows how protocols are categorized according to our taxonomy, and exemplifies the majority of reliability services and error control schemes detailed in our taxonomy.
TCP performance and behaviors with local retransmissions
2002
TCP has been the dominant transport protocol over the global Internet, and its performance over a hybrid wireless/wireline network has attracted much attention in recent years. This paper investigates the end-to-end TCP performance, in terms of normalized throughput, effective goodput, and packet delay, over wireless lossy links with local retransmissions. The results reveal that local retransmissions can increase the normalized TCP throughput in different wireless bandwidth, delay, and error settings, at the cost of a decrease in effective goodput and an increased packet delay. The performance observation is explained by the explored TCP endpoint behaviors, including the spurious timeout and duplicated acknowledgment. Analysis shows that spurious timeouts with local retransmissions are rare due to the conservative TCP timeout algorithm. However, spurious duplicated acknowledgments have negative impact and a further improvement with the D-SACK proposal is evaluated.
Engineering TCP Transmission and Retransmission Mechanisms for Wireless Networks, Elsevier, 2011
Transmission Control Protocol (TCP) provides mechanisms for reliable data communications. Although it works well in wired networks, it fails to offer satisfactory performance in lossy and wireless environments. And in the multi-hop wireless infrastructure, packet delivery suffers high cumulative loss rate if traveling over multiple wireless hops. The Selective acknowledgment (SACK) is one header option that might be used to combat segment corruptions in air channels. In this paper, an alternative set of flow control mechanisms is proposed to handle high packet loss rate in a wireless medium. Using a measurement-based mechanism, sustainable segment delivery is achievable through a novel size-reduction method. Multiple segment retransmission mechanisms are introduced to reduce successive timeout events. One single byte loss is sufficient to waste all other bytes in a file received at a destination. That is, a good TCP flow control mechanism should provide a high successful file transmission completion rate, and this is set as our design goal. Through thorough simulations, our proposed multi-segment retransmission designs perform with higher successful file transfer rate and fewer timeout events than NewReno and SACK under a wide range of packet loss probabilities.
Fast retransmit and fast recovery schemes of transport protocols: A survey and taxonomy
Computer Networks, 2008
Although there are two standard transport protocols, TCP and UDP, offering services in the Internet, the majority of the traffic over the Internet is TCP-based. TCP-based applications can react to packet losses; however, many performance problems have been recently observed in the Internet. To resolve these problems, several new TCP fast retransmit and fast recovery algorithms have been proposed. This article surveys state-of-the-art fast retransmit and fast recovery mechanisms of TCP to address the lost packet problem, and presents a description of some useful algorithms, design issues, advantages, and disadvantages. The objective of this article is fourfold: to provide an introduction to TCP protocol; to discuss problems degrading TCP retransmission performance in the present-day Internet; to describe some proposed transport protocols that solve a number of throughput issues; and finally, to gain new insight into these protocols and thereby suggest avenues for future research. Based on our taxonomy, existing fast retransmit and fast recovery schemes of transport protocols are described in this survey.
Comparison of two packet-retransmission techniques (Corresp.)
IEEE Transactions on Information Theory, 1980
Ahnwt-Two methods of dealhg with the overtlow problem in packet swltebes are anpared: swit and host-Bon. The comparison is hased on approximate anaiylic models of tandem queueing networks and is verified by simulation. I. INTI~~DUCTION
The Bounded Retransmission Protocol must be on time!
1997
This paper concerns the transfer of files via a lossy communication channel. It formally specifies this file transfer service in a property-oriented way and investigates—using two different techniques—whether a given bounded retransmission protocol conforms to this service. This protocol is based on the well-known alternating bit protocol but allows for a bounded number of retransmissions of a chunk, ie, part of a file, only. So, eventual delivery is not guaranteed and the protocol may abort the file transfer.