To solve the parameter sensitive issue of the traditional RED (random early detection) algorithm, an adaptive buffer management algorithm called PAFD (packet adaptive fair dropping) is proposed. This algorithm supports DiffServ (differentiated services) model of QoS (quality of service). In this algorithm, both of fairness and throughput are considered. The smooth buffer occupancy rate function...

While there exist extensive research works on congestion control and active queue management, or the joint dynamics of a congestion control strategy with the Random Early Detection (RED) algorithm, little has been done on the interactions between different window adjustment strategies and different queue management schemes such as DropTail and RED. In this paper, we consider a spectrum of TCP-f...

Since random early detection (RED) was proposed in 1993, many active queue management (AQM) algorithms have been proposed to support better end-to-end Transmission Control Protocol (TCP) congestion control. In this article, the authors introduce and analyze a feedback control model of the TCP/AQM dynamics. Then they suggest the concept of an AQM algorithm that can detect and avoid congestion pr...

With the rapid growth of Internet traffic, the control of congestion to enable different types of Internet traffic to satisfy specified Quality of Service (QoS) constraints is becoming increasingly important. This motivates the stochastic analysis of a discrete-time queueing system for the performance evaluation of active queue management (AQM) scheme based congestion control mechanism called R...

Best eeort traac in the Internet is managed by end to end congestion control mechanisms whose limitations are known. The continuous Internet growth leads to more and more applications that don't \play the rules" of the end-to-end congestion control scheme. Simple mechanisms inside the routers, refered as random early detection (RED), provide a more eecient congestion control. It can also be use...

Random Early Detection (RED) is the most promising Active Queue Management (AQM) mechanism. Its interaction with Transmission Control Protocol (TCP) can be modeled as a discrete-time dynamical system, which may exhibit complex bifurcation and chaos behavior. An improved RED algorithm is proposed by using a real-time, adaptive, model-independent (RTAMI) technique. Bifurcation analysis and numeri...

Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known as the best existing scheme, is one of such efforts which guarantees strong loss differentiation to the level of traffic in the different service classes. Even though BRD has several benefits such as low complexities and good ...

Random Early Drop (RED) is widely applied in Mobile Ad-hoc NETworks (MANETs) for congestion control. It randomly drops packets to prevent congestion from occurring, while keeping proper queue size of Route Request (RREQ) packets at the same time. Unfortunately, in the case of severe congestion and large amounts of RREQ packets in the queue, RED algorithm with tune parameters is not able to impr...

The Internet routers employing the random early detection (RED) algorithm for congestion control suffer from the problem of chaotic queue oscillation. It is well known that the slowly varying nature of the average queue size computed using an exponentially weighted moving average (EWMA) used in the RED scheme causes this chaotic behavior. This paper presents a new mathematical function to model...

Resource Allocation in Grid environments to date is generally carried out under the assumption that there is one primary scheduling system scheduling jobs. However, as environments tend towards larger open “utility” Grids it becomes increasingly likely that deployments will involve multiple independent schedulers allocating jobs over the same resources. In this paper we show that, if using curr...