190 research outputs found

    TCP for Wireless Environments

    Full text link
    Computer networks have experienced an explosive growth over the past few years, which has lead to some severe congestion problems. Reliable protocols like TCP works well in wired networks where loss occurs mostly because of congestion. However, in wireless networks, loss occurs because of bit rates and handoffs too. TCP responds all losses by congestion control and avoidance algorithms, which results in degradation of TCP\u27s End-To-End performance in wireless networks. This paper discusses different issues and problems regarding use of TCP in wireless networks and provides comprehensive survey of various schemes to improve performance of TCP in Wireless Networks

    Different Transmission Control Protocol Variants in Wireless Environments

    Get PDF
    Computer networks have experienced an explosive growth over the past few years, which has lead to some severe congestion problems. Reliable protocols like TCP works well in wired networks where loss occurs mostly because of congestion. However, in wireless networks, loss occurs because of bit rates and handoffs too. TCP responds all losses by congestion control and avoidance algorithms, which results in degradation of TCP’s End-To-End performance in wireless networks. This paper discusses different issues and problems regarding use of TCP in wireless networks and provides comprehensive survey of various schemes to improve performance of TCP in Wireless Networks

    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

    Congestion Control in 4G Wireless Networks Using Coalition Game

    Full text link

    Acknowledge-Based Non-Congestion Estimation: An Indirect Queue Management Approach for Concurrent TCP and UDP-Like Flows

    Get PDF
    This paper presents a new approach for indirect Active Queue Management (indirect AQM) technique called Acknowledge-based Non-Congestion Estimation (ANCE), which employs end-to-end queue management along a network instead to use Explicit Congestion Notification (ECN) bit or to drop packets in the queue. The ANCE performance was compared with Random Early Detection (RED), Control Delay (CoDel), Proportional Integral controller Enhanced (PIE), Explicit Non-Congestion Notification (ENCN), TCP-Jersey and E-DCTCP schemes in a daisychain and in a dumbbell cenario, with TCP flows and UDP-like Networked Control Systems (NCS) flow sharing the same network topology. On the other hand, this paper presents a method for modeling, simulation and verification of communication systems and NCS, using UPPAAL software tool, on which, all network components (channels, routers, transmitters, receivers, plants, and Controllers) were modeled using timed automata making easy a formal verification of the whole modeled system. Simulations and statistical verification show that despite using fewer resources (since ANCE does not need the ECN bit) ANCE presents a very close performance  to ENCN overcoming Drop Tail, RED, CoDel, PIE and E-DCTCP in terms of Integral Time Absolute Error (ITAE) for NCS and fairness for TCP flows. ANCE also attains better performance than RED, PIE, TCP-Jersey and E-DCTCP in terms of throughput for TCP flows

    The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions

    Full text link
    In recent years, the current Internet has experienced an unexpected paradigm shift in the usage model, which has pushed researchers towards the design of the Information-Centric Networking (ICN) paradigm as a possible replacement of the existing architecture. Even though both Academia and Industry have investigated the feasibility and effectiveness of ICN, achieving the complete replacement of the Internet Protocol (IP) is a challenging task. Some research groups have already addressed the coexistence by designing their own architectures, but none of those is the final solution to move towards the future Internet considering the unaltered state of the networking. To design such architecture, the research community needs now a comprehensive overview of the existing solutions that have so far addressed the coexistence. The purpose of this paper is to reach this goal by providing the first comprehensive survey and classification of the coexistence architectures according to their features (i.e., deployment approach, deployment scenarios, addressed coexistence requirements and architecture or technology used) and evaluation parameters (i.e., challenges emerging during the deployment and the runtime behaviour of an architecture). We believe that this paper will finally fill the gap required for moving towards the design of the final coexistence architecture.Comment: 23 pages, 16 figures, 3 table

    Mitigating TCP Degradation over Intermittent Link Failures Using Intermediate Buffers

    Get PDF
    This thesis addresses the improvement of data transmission performance in a challenged network. It is well known that the popular Transmission Control Protocol degrades in environments where one or more of the links along the route is intermittently available. To avoid this degradation, this thesis proposes placing at least one node along the path of transmission to buffer and retransmit as needed to overcome the intermittent link. In the four-node, three-link testbed under particular conditions, file transmission time was reduced 20 fold in the case of an intermittent second link when the second node strategically buffers for retransmission opportunity
    • 

    corecore