3,378 research outputs found

    FAST TCP: Motivation, Architecture, Algorithms, Performance

    Get PDF
    We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our prototype. We characterize its equilibrium and stability properties. We evaluate it experimentally in terms of throughput, fairness, stability, and responsiveness

    Towards an incremental deployment of ERN protocols: a proposal for an E2E-ERN hybrid protocol

    Get PDF
    We propose an architecture based on a hybrid E2E-ERN approach to allow incremental deployment of ERN (Explicit Rate Notification) protocols in heterogeneous networks. The proposed IP-ERN architecture combines E2E (End-to-End)and ERN protocols and uses the minimum between both congestion windows to perform. Without introducing complex operation, the resulting E2E-ERN protocol provides inter and intra protocol fairness and benefits from all ERN protocol advantages when possible. We detail the principle of this novel IP-ERN architecture and show that this architecture is highly adaptive to the network dynamic and is compliant with IPv4, IPv6 as well as IP-in-IP tunneling solutions

    TCP FTAT (Fast Transmit Adaptive Transmission): a New End-To-End Congestion Control Algorithm

    Get PDF
    Congestion Control in TCP is the algorithm that controls allocation of network resources for a number of competing users sharing a network. The nature of computer networks, which can be described from the TCP protocol perspective as unknown resources for unknown traffic of users, means that the functionality of the congestion control algorithm in TCP requires explicit feedback from the network on which it operates. Unfortunately this is not the way it works with TCP, as one of the fundamental principles of the TCP protocol is to be end-to-end, in order to be able to operate on any network, which can consist of hundreds of routers and hundreds of links with varying bandwidth and capacities. This fact requires the Congestion Control algorithm to be adaptive by nature, to adapt to the network environment under any given circumstances and to obtain the required feedback implicitly through observation and measurements. In this thesis we propose a new TCP end-to-end congestion control algorithm that provides performance improvements over existing TCP congestion control algorithms in computer networks in general, and an even greater improvement in wireless and/or high bandwidth- delay product network

    Active Queue Management for Fair Resource Allocation in Wireless Networks

    Get PDF
    This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users

    TCP FTAT (Fast Transmit Adaptive Transmission): a New End-To-End Congestion Control Algorithm

    Get PDF
    Congestion Control in TCP is the algorithm that controls allocation of network resources for a number of competing users sharing a network. The nature of computer networks, which can be described from the TCP protocol perspective as unknown resources for unknown traffic of users, means that the functionality of the congestion control algorithm in TCP requires explicit feedback from the network on which it operates. Unfortunately this is not the way it works with TCP, as one of the fundamental principles of the TCP protocol is to be end-to-end, in order to be able to operate on any network, which can consist of hundreds of routers and hundreds of links with varying bandwidth and capacities. This fact requires the Congestion Control algorithm to be adaptive by nature, to adapt to the network environment under any given circumstances and to obtain the required feedback implicitly through observation and measurements. In this thesis we propose a new TCP end-to-end congestion control algorithm that provides performance improvements over existing TCP congestion control algorithms in computer networks in general, and an even greater improvement in wireless and/or high bandwidth- delay product network
    corecore