Congestion on the Internet is an old problem but still a subject of intensive research. The TCP protocol with its AIMD (Additive Increase and Multiplicative Decrease) behavior hides very challenging problems; one of them is to understand the interaction between a large number of users with delayed feedback. This article will focus on two modeling issues of TCP which appeared to be important to ...

We propose a novel active queue management scheme tailored to the specific characteristics of third generation (3G) cellular networks. Such links are often the bottleneck for an endto-end connection and dedicated to one host. Taking advantage of these specific characteristics, we developed a queuing scheme that is simpler than popular Random Early Detection (RED) schemes. Despite its simplicity...

RED (Random Early Detection) routers can provide better fairness among many competing TCP connections than TD (Tail-Drop) routers, but it is true only when the control parameters of RED are set appropriately according to the network congestion status. However, it is very difficult because the network condition varies largely, especially when the number of accommodated connections is large. In t...

This paper discusses the application of TCP tunnels on the Internet and how Internet traffic can benefit from the congestion control mechanism of the tunnels. Primarily, we show the TCP tunnels offer TCP-friendly flows protection from TCP-unfriendly traffic. TCP tunnels also reduce the many flows situation on the Internet to that of a few flows. In addition, TCP tunnels eliminate unnecessary pa...

In this paper, we investigate the eeectiveness of packet-drop mechanisms in conjunction with fair queuing link scheduling and hierarchical link sharing. Under fair queuing, the link share of a ow changes dynamically due to the arrivals and departures of ows and their bursts. This phenomenon becomes more pronounced in the case of hierarchical link sharing. Packet-drop mechanisms play an integral...

Congestion in router buffer increases the delay and packet loss. Active Queue Management (AQM) methods are able to detect congestion in early stage and control it by packet dropping. Effective Random Early Detection (ERED) method, among many other AQM methods, gives a good performance in detect and control congestion and preserve packet loss. However, the ERED neglect the delay factor, which is...

A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such scheme prevent a network from entering in to congested state. RED(Random Early Detection), is one such congestion avoidance mechanism used for effectively control of congestion. In RED, router uses only the average queue size, as a congestion indicator and the average queue length is i...

The paper presents an active queue management technique of preventing congestion in packet-switch networks called Random Early Detection (RED) gateways. RED is based on the observation that congestion can most accurately be understood at the gateway, since it can distinguish high propagation delay from high delay brought on by increasing queue lengths. Therefore, they suggest that congestion de...

A TCP/RED (Transmission Control Protocol/Random Early Detection) system with multiplebottleneck links could be unstable even if its system parameters are set the same as those in a stable single-bottleneck system [D. Bauso, L. Giarre, G. Neglia, Active queue management stability in multiple bottleneck networks, IEEE ICC’04, vol. 4, June 2004, pp. 2267– 2271]. In this paper, we study the stabili...

In this paper we investigate the network performance of TCP hosts and gateways employing New Reno TCP using a parallel simulator. The gateway adopts the random early detection (RED) scheme and proactive congestion control mechanism to enforce fair sharing among competing TCP connections. The test network is modeled using PARSEC. The simulation reveals that the RED gateway drops only a small num...