1,040 research outputs found

    Full TCP/IP for 8-Bit architectures

    Get PDF
    We describe two small and portable TCP/IP implementations fulfilling the subset of RFC1122 requirements needed for full host-to-host interoperability. Our TCP/IP implementations do not sacrifice any of TCP's mechanisms such as urgent data or congestion control. They support IP fragment reassembly and the number of multiple simultaneous connections is limited only by the available RAM. Despite being small and simple, our implementations do not require their peers to have complex, full-size stacks, but can communicate with peers running a similarly light-weight stack. The code size is on the order of 10 kilobytes and RAM usage can be configured to be as low as a few hundred bytes

    Tcp Performance Optimization In Interaction With Mac Layer Over Multi-Hop Ad-Hoc Networks

    Get PDF
    Transport Control Protocol (TCP) has been designed to provide reliable data delivery between end hosts in traditional wired networks and is the most widely used reliable transport protocol over the internet. TCP keeps looking at the traffic inside the network by employing the congestion control mechanisms. The basic assumption underlying TCP congestion control is that packet losses are an indication of congestion in the wired network. The effect of such an assumption on TCP's performance in wireless environments has been a long-standing research study. The reason is specific wireless properties such as high medium access contention; route breakage and high bit error rate in radio channels pose different challenges in TCP performance when it runs over wireless networks. In this thesis, the focus is given on the interaction between TCP and Medium Access Control (MAC) layer in multi-hop ad-hoc networks to deal with the effect of high medium access contention on TCP throughput. The main problem of TCP over IEEE 802.11 MAC protocol is the extensive number of medium access carried out by TCP. In fact, TCP sender will be informed of successful transmissions by receiving the acknowledgment (ACK) from the other end host to achieve the reliability. In this way, the MAC overhead may be caused by generating redundant ACK packets that compete in the same route with data packets for the media. As the load increases, the well-known hidden terminal effects caused by interference between ACK and data packets can degrade TCP performance dramatically if TCP acknowledges every incoming data packets. To address above problem, in this thesis a dynamic TCP-MAC interaction strategy is proposed which tries to reduce the number of induced ACKs by monitoring the channel condition. To this end, the total collision probability collected along the path from sender to receiver in MAC layer is used to properly set the number of the delayed ACKs (DA) in TCP. Based on the measured collision probability, TCP sender dynamically adjusts itself to the channel condition by delaying less ACKs in high traffics and more in low traffic conditions. Upon this strategy, an enhanced TCP throughput has been achieved in trade-off between moderate and high traffics. Finally, the relationship between the TCP throughput and optimized number of delayed ACKs has been investigated in different hop counts scenarios which employ a dynamic traffic. The findings show that for a given hop count, there exists an optimized delay window size which maximizes the TCP throughput. Overall, the achieved throughput increments are up to about 30% over the regular TCP with DA extension and cwnd limit and about 10% over the existing method called Dynamic Adaptive Acknowledgment (TCP-DAA and TCP-DAAp)

    Rethinking reliability for long-delay networks

    Get PDF
    Delay Tolerant Networking (DTN) is currently an open research area following the interest of space companies in the deployment of Internet protocols for the space Internet. Thus, these last years have seen an increase in the number of DTN protocol proposals such as Saratoga or LTP-T. However, the goal of these protocols are more to send much error-free data during a short contact time rather than operating to a strictly speaking reliable data transfer. Beside this, several research work have proposed efficient acknowledgment schemes based on the SNACK mechanism. However, these acknowledgement strategies are not compliant with the DTN protocol principle. In this paper, we propose a novel reliability mechanism with an implicit acknowledgment strategy that could be used either within these new DTN proposals or in the context of multicast transport protocols. This proposal is based on a new erasure coding concept specifically designed to operate efficient reliable transfer over bi-directional links

    Promoting the use of reliable rate based transport protocols: the Chameleon protocol

    Get PDF
    Rate-based congestion control, such as TFRC, has not been designed to enable reliability. Indeed, the birth of TFRC protocol has resulted from the need for a congestion-controlled transport protocol in order to carry multimedia traffic. However, certain applications still prefer the use of UDP in order to implement their own congestion control on top of it. The present contribution proposes to design and validate a reliable rate-based protocol based on the combined use of TFRC, SACK and an adapted flow control. We argue that rate-based congestion control is a perfect alternative to window-based congestion control as most of today applications need to interact with the transport layer and should not be only limited to unreliable services. In this paper, we detail the implementation of a reliable rate-based protocol named Chameleon and bring out to the networking community an ns-2 implementation for evaluation purpose

    Strategy for Developing Expert-System-Based Internet Protocols (TCP/IP)

    Get PDF
    The Satellite Networks and Architectures Branch of NASA's Lewis Research is addressing the issue of seamless interoperability of satellite networks with terrestrial networks. One of the major issues is improving reliable transmission protocols such as TCP over long latency and error-prone links. Many tuning parameters are available to enhance the performance of TCP including segment size, timers and window sizes. There are also numerous congestion avoidance algorithms such as slow start, selective retransmission and selective acknowledgment that are utilized to improve performance. This paper provides a strategy to characterize the performance of TCP relative to various parameter settings in a variety of network environments (i.e. LAN, WAN, wireless, satellite, and IP over ATM). This information can then be utilized to develop expert-system-based Internet protocols

    Queue Dynamics With Window Flow Control

    Get PDF
    This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstiness in sub-round-trip time (RTT) timescales and the instantaneous rate differences of a flow at different links. It is generic and independent of actual source flow control algorithms. Basic properties of the model and its relation to existing work are discussed. In particular, for a general network with multiple links, it is demonstrated that spatial interaction of oscillations allows queue instability to occur even when all flows have the same RTTs and maintain constant windows. The model is used to study the dynamics of delay-based congestion control algorithms. It is found that the ratios of RTTs are critical to the stability of such systems, and previously unknown modes of instability are identified. Packet-level simulations and testbed measurements are provided to verify the model and its predictions

    Control of transport dynamics in overlay networks

    Get PDF
    Transport control is an important factor in the performance of Internet protocols, particularly in the next generation network applications involving computational steering, interactive visualization, instrument control, and transfer of large data sets. The widely deployed Transport Control Protocol is inadequate for these tasks due to its performance drawbacks. The purpose of this dissertation is to conduct a rigorous analytical study on the design and performance of transport protocols, and systematically develop a new class of protocols to overcome the limitations of current methods. Various sources of randomness exist in network performance measurements due to the stochastic nature of network traffic. We propose a new class of transport protocols that explicitly accounts for the randomness based on dynamic stochastic approximation methods. These protocols use congestion window and idle time to dynamically control the source rate to achieve transport objectives. We conduct statistical analyses to determine the main effects of these two control parameters and their interaction effects. The application of stochastic approximation methods enables us to show the analytical stability of the transport protocols and avoid pre-selecting the flow and congestion control parameters. These new protocols are successfully applied to transport control for both goodput stabilization and maximization. The experimental results show the superior performance compared to current methods particularly for Internet applications. To effectively deploy these protocols over the Internet, we develop an overlay network, which resides at the application level to provide data transmission service using User Datagram Protocol. The overlay network, together with the new protocols based on User Datagram Protocol, provides an effective environment for implementing transport control using application-level modules. We also study problems in overlay networks such as path bandwidth estimation and multiple quickest path computation. In wireless networks, most packet losses are caused by physical signal losses and do not necessarily indicate network congestion. Furthermore, the physical link connectivity in ad-hoc networks deployed in unstructured areas is unpredictable. We develop the Connectivity-Through-Time protocols that exploit the node movements to deliver data under dynamic connectivity. We integrate this protocol into overlay networks and present experimental results using network to support a team of mobile robots
    corecore