Random Early Detection (RED) [1] is a widely deployed active queue management scheme in packetswitched networks. Although RED can improve packet loss rates, its performance depends severely on the tuning of its operating parameters. To alleviate the problem of parameter dependence, we propose an algorithm to adaptively vary the queue weight wq in conjunction with the maximum packet dropping pro...

Recently, several gateway-based congestion control mechanisms have been proposed to support the endto-end congestion control mechanism of TCP (Transmission Control Protocol). In this paper, we focus on RED (Random Early Detection), which is a promising gateway-based congestion control mechanism. RED randomly drops an arriving packet with a probability proportional to its average queue length (i...

how to cite this article: karimzadeh p, jafari n, nejad biglari hb, jabbehdari s, alizadeh m, alizadeh gh, nejad biglari hm, sanii s. the clinical features and diagnosis of adrenoleukodystrophy: a case series of iranian family. iran j child neurol. winter 2016; 10(1):61-64. abstract objective adrenoleukodystrophy disorder is one of the x-linked genetic disorders caused by the myelin sheath brea...

Appropriate control parameters are important for the successful deployment of RED (Random Early Detection) routers, especially when many TCP connections share the bottleneck link. In this paper, we first describe a new simple analysis method for determining the window size distribution of many TCP connections sharing a bottleneck router. We consider two kinds of buffering disciplines: TD (Tail ...

In this work, we present a method for early forest fire detection from a satellite image using the power spectral density of a Gaussian white noise. To obtain the latter, we have considered each satellite image matrix line as a realization of a non stationary random process in the Thermal Infra-Red (TIR) spectral band, and then divided each line into very small intervals in which any random pro...

We address the deployment of Random Early Detection (RED) on class-based queues (CBQs) with shared buffer by deriving novel RED algorithms for the complete sharing and sharing with minimum allocation schemes and comparing their performance with RED under complete partitioning that is equivalent to using a dedicated buffer for each CBQ. In our novel RED algorithms, packet drop decision is based ...

Appropriate control parameters are important for the successful deployment of RED (Random Early Detection) routers, especially when many TCP connections share the bottleneck link. In this paper, we first describe a new simple analysis method for determining the window size distribution of many TCP connections sharing a bottleneck router. We consider two kinds of buffering disciplines: TD (Tail ...

The low pass filter (LPF) algorithm, which is used to calculate the average queue length in the random early detection (RED) algorithm, results in a poor response time when RED recovers from congestion. In this paper, we propose a new algorithm, called low pass filter/over drop avoidance (LPF/ODA), to improve the response time of RED. LPF/ODA is based on reducing the time required by RED to rec...