Differentiated and fair congestion control using efficient buffer management (DifCom) for the metro Ethernet

Author(s):  
M.H.M. Nizam ◽  
G. Chiruvolu ◽  
A. Ge ◽  
J. Rouyer ◽  
T. Kim ◽  
...  
2006 ◽  
Vol 07 (01) ◽  
pp. 163-177
Author(s):  
ASFAND-E YAR ◽  
I. U. AWAN ◽  
M. E. WOODWARD

Evolution in Wireless Technologies and Networks imposes a greater need for network support as current congestion control and avoidance techniques are mainly designed for wired networks. The current performance evaluation techniques proposed for wireless networks are not able to achieve optimal performance to guarantee desired Quality of Service (QoS) standards. Thus, the new schemes such as Active Queue Management (AQM) are needed to be adaptive to dynamic wireless networks and bursty traffic conditions to help in avoiding severe performance degradation in wireless environment. Thus, in this paper we developed and validated a novel approximate analytical performance model of a multiple threshold Random Early Detection (RED) congestion control mechanism based on the principle of Maximum Entropy (ME). It can be employed at the wireless gateways/base stations to regulate the buffer management and bandwidth allocation. Closed form expressions for the state and blocking probabilities have also been characterized. Numerical examples have been presented for aggregate and marginal QoS measures, which show the credibility of the ME solution and its validation against simulation.


2016 ◽  
Vol 25 (10) ◽  
pp. 1650125 ◽  
Author(s):  
Heying Zhang ◽  
Kefei Wang ◽  
Zhengbin Pang ◽  
Liquan Xiao ◽  
Qiang Dou ◽  
...  

As the port count of routers in an interconnection network increases rapidly, the amount of buffers within the router chip also increases greatly. To improve the buffer utilization and to reduce the buffer size, the dynamically allocated multi-queue (DAMQ) algorithm is commonly used. However, traditional DAMQ buffer management suffers from high write latency and read latency, and one virtual channel (VC) monopolizes the entire buffer. To address these issues, we propose a fast and area-efficient DAMQ buffer-management algorithm and a novel flow-control mechanism based on credit with congestion-control support. The simulation results show that the new DAMQ algorithm can achieve low latency and prevent one VC from occupying the entire buffer during periods of congestion. Additionally, it can achieve high throughput with a shallow buffer, which leads to a reduced chip area.


2012 ◽  
Vol 2 (11) ◽  
pp. 104-106
Author(s):  
C.Md.Jamsheed C.Md.Jamsheed ◽  
◽  
D.Surendra D.Surendra ◽  
D.Venkatesh D.Venkatesh

Author(s):  
Jaya Pratha Sebastiyar ◽  
Martin Sahayaraj Joseph

Distributed joint congestion control and routing optimization has received a significant amount of attention recently. To date, however, most of the existing schemes follow a key idea called the back-pressure algorithm. Despite having many salient features, the first-order sub gradient nature of the back-pressure based schemes results in slow convergence and poor delay performance. To overcome these limitations, the present study was made as first attempt at developing a second-order joint congestion control and routing optimization framework that offers utility-optimality, queue-stability, fast convergence, and low delay.  Contributions in this project are three-fold. The present study propose a new second-order joint congestion control and routing framework based on a primal-dual interior-point approach and established utility-optimality and queue-stability of the proposed second-order method. The results of present study showed that how to implement the proposed second-order method in a distributed fashion.


Sign in / Sign up

Export Citation Format

Share Document