Controlling congestion on complex networks: fairness, efficiency and network structure

We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is favoured in the complex networks literature. We show, however, that this relation is reversed on all other congestion control algorithms for a region of the parameter space given by the degree exponent γ and average degree 〈k〉. Moreover, the uniform-flow algorithm severely underestimates the network throughput of congested networks, and a rich phenomenology of path flow allocations is only present in the more realistic α-fair family of algorithms. Finally, we show that the number of paths passing through an edge characterises the location of a wide range of bottleneck edges in these algorithms. Such identification of bottlenecks could provide a bridge between the two fields of complex networks and congestion control

Enhanced Queue Management Mechanism for Differentiated Services Networks

In the Internet, it is supposed that all connections are treated equally in the network. Due to the limitation of network resources are limited, providing guarantees on performance measures imposes declining new connections if resources are not available. Assigning network resources to connections according to their classes requires differentiating between the connection classes. For this reason, the Differentiated Services (DiffServ) has been proposed. Many of the QoS mechanisms have been developed which allow different services carried by the Internet to co-exist. Many of these mechanisms were both complex and failed to scale to meet the demands of the Internet. MRED is the common mechanism used in DifJServ routers. It suflers from large queue length variation and untimely congestion detection and notification. These consequences cause performance degradation due to high queuing delays and high packet loss. In this project, enhanced version of MRED is developed to improve the performance of Diffserv networks that use TCP as the transport layer protocol. Enhanced MRED includes average packet arrival rate when computing the packet drop probability. Enhanced MRED showed a good pedonnance compared to that of MRED, in term of fast congestion detection and notification. The limitation of the new mechanism is that it works only with responsive connections which play a big role in avoiding and controlling the congestion. The major contribution of this project is to provide an improved queue management mechanism for Diffserv networks that responds to congestion more quickly, delivers congestion notification timers, and controls the queue length directly to congestion which results in minimizing queue length variation. All these would help improve the DlffServ networks performance

Comparative Study Of Congestion Control Techniques In High Speed Networks

Congestion in network occurs due to exceed in aggregate demand as compared to the accessible capacity of the resources. Network congestion will increase as network speed increases and new effective congestion control methods are needed, especially to handle bursty traffic of todays very high speed networks. Since late 90s numerous schemes i.e. [1]...[10] etc. have been proposed. This paper concentrates on comparative study of the different congestion control schemes based on some key performance metrics. An effort has been made to judge the performance of Maximum Entropy (ME) based solution for a steady state GE/GE/1/N censored queues with partial buffer sharing scheme against these key performance metrics.Comment: 10 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS November 2009, ISSN 1947 5500, http://sites.google.com/site/ijcsis