Congestion is a natural phenomenon in any network queuing system, and is unavoidable if the queuing system is operated at capacity. In this thesis, we study how to set the rules of a queuing system so that all the users have a self-interest in controlling congestion when it happens. Queueing system is a crucial component in effective router congestion control since it determines the way packets...

Network throughput increase is usually associated with replacement of communication links and appropriate network devices. However it is necessary to bear in mind that effective and less intrusive increase of network throughput can be achieved via the improvement of existing protocol stack, mostly at network and transport layer. In this paper we propose an advanced notification system for TCP c...

High Performance Routing (HPR) is an enhancement to IBM’s Advanced Peer to Peer Networking (APPN) protocol that improves its performance and reliability. In an HPR network, the Rapid Transport Protocol (RTP) is used for end-to-end data transfer. RTP provides a reliable, in-order delivery service using a selective repeat protocol as the end-to-end error recovery mechanism. Additionally, RTP prov...

Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as refer...

From the early days of modern congestion control, ushered in by the development of TCP’s and DECbit’s congestion control algorithm and by the pioneering theoretical analysis of Chiu and Jain, there has been widespread agreement that linear additive-increase-multiplicative-decrease (AIMD) control algorithms should be used. However, the early congestion control design decisions were made in a con...

TCP’s congestion control is deliberately cautious, avoiding network overloads by starting with a small initial window and then iteratively ramping up. As a result, it often takes flows several round-trip times to fully utilize the available bandwidth. In this paper we propose RC3, a technique to quickly take advantage of available capacity from the very first RTT. RC3 uses several levels of low...

Traditional connection oriented protocols like TCP NewReno perform poorly over wireless links. The problem lies in their design assumptions based on loss based congestion control. Various modifications to loss based congestion control schemes have so far been proposed to overcome the issue. In addition, the comparatively newer family of delay based congestion control mechanisms like Caia-Hamilt...

This paper evaluates the congestion control performance of Pseudofed, a congestion-controlled, reliable multicast transport protocol for bulk data transfer. Pseudofed’s congestion control mechanism is based on the concept of representatives, a small, dynamic set of multicast group members. By reducing the congestion control problem to a bounded set of receivers, representatives allow the pointt...

This paper addresses the problematic of congestion control in the radio access interface when considering the allocation of voice and data services over several Radio Access Technologies (RATs). In particular, the GSMIEDGE Radio Access Network (GERAN) and the UMTS Terrestrial Radio Access Network (UTRAN) are considered for the evaluation of congestion control strategies. After a congestion situ...

This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each congestion indication (or loss) is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a ...