Congestion occurs at a bottleneck along an Internet path. Multiple flows between the same sender and receiver pairs can benefit from using only a single congestion control instance when they share the same bottleneck. These benefits include the ability to control the rate allocation between flows and reduced overall delay (multiple congestion control instances cause more queuing delay than one ...

This paper studies congestion management based on congestion pricing as may be done by an Independent System Operator. Four main concepts are discussed: congestion pricing can lead to the same solution as an Optimal Power Flow, pricing need not have cost information available, good estimates of nonlinear cost coefficients are necessary, and pricing for congestion management is separable from pr...

Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T ), the congestion of e is the number of edges in G joining the two components of T − e. The congestion of T is the maximum congestion over all edges in T . The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook’s graph Km Kn...

The rapid growth of information technology has resulted in severe congestion problems in the internet. Due to micro-level congestion (such as link and router), it is hard to detect and control the congestion from the internet. To reduce and/or overcome this problem, we introduce, a macro-level congestion detection mechanism and congestion control method across the internet. Here, a zone is a co...

Congestion occurs at a bottleneck along an Internet path; multiple flows between the same sender and receiver pairs can benefit from using only a single congestion control instance when they share the same bottleneck. These benefits include the ability to control the rate allocation between flows and reduced overall delay (multiple congestion control instances cause more queuing delay than one ...

Congestion in computer networks occurs whenever the total input tra c is greater than the total output tra c. When congestion occurs, sources of congestion must reduce their tra c. Sources learn about congestion either through feedback from the bottleneck or through source timeout. When a source receives congestion indication, it reduces its rate or window size. The traditional goals of congest...

Computer networks use congestion feedback from the routers and destinations to control the transmission load. Delivering timely congestion feedback is essential to the performance of networks. Reaction to the congestion can be more effective if faster feedback is provided. Current TCP/IP networks use timeout, duplicate ACKs and explicit congestion notification (ECN) to deliver the congestion fe...

The growth of network intensive Internet applications has made gateway congestion control a high priority. The IETF Performance and Congestion Control Working Group surveyed and reviewed gateway congestion control and avoidance approaches. The purpose of this paper is to present our review of the congestion control approaches, as a way of encouraging new discussion and experimentation. Included...

Abstracrt Asynchronous Transfer Mode (ATM) has emerged as most promising technology in supporting broadband multimedia communications. Congestion control plays important role in the effective and stable operation of ATM networks. In this paper, we described several existing rate based congestion control schemes namely, Explicit Forward Congestion Indication (EFCI), Enhanced Proportional Rate Co...

Abstract: In a Bluetooth piconet, congestion may arise as multiple flows pass via the master node across the shared wireless channel. While packet loss and delay are common measures of congestion, within a piconet the transmitter buffer fullness is a more suitable metric, as it more directly indicates congestion and the onset of congestion. For video traffic, simulation results clearly show the...