This paper studies a fluid queueing system that has a single server, a single finite buffer, and which applies a strict priority discipline to multiple arriving streams of different classes. The arriving streams are modeled by statistically independent, identically distributed random processes. A proof is presented for the highly intuitive result that, in such a queueing system, a higher priori...

Performance of the Adaptive RED scheme is susceptible to bursty web traffic. A parallel queue structure was proposed earlier to address this problem, where real time connections (such as web and UDP) and non-real time connections (such as FTP) are served in two different queues with droptail and Adaptive RED policies, respectively. In this paper a modified Adaptive RED scheme is proposed for th...

in order to make the best utilization of a link in computer networks, active queue management (aqm) algorithms are generally used in a variety of methods. in this paper, a systematic control strategy based on self-scheduled h ∞, considering the dynamics of the window-based tcp flow, is proposed. then, the robustness of the designed controller to disturbance and parameter fluctuations of the pla...

The virtual rate control (VRC) algorithm has been proposed for active queue management (AQM) in TCP networks. This algorithm uses an adaptive rate control instead of queue length control in order to respond quickly to traffic change with high utilization and small loss. By introducing the notion of virtual target rate, the VRC algorithm can maintain an input rate around the target rate, while a...

Generic generalized minimum variance-based (GMV) controllers have been adopted as efficient control mechanisms especially in presence of measurement noise. However, such controllers exhibit degraded performance with change in process dynamics. To overcome this problem, a novel congestion controller based on active queue management (AQM) strategy for dynamically varying TCP/AQM networks known as...

I study the design of a queue when agents learn from past service experiences and can be served multiple times. A continuum of forward-looking agents compete for a constant flow of a resource and decide whether and when to engage in costly queueing to be served. Valuations fluctuate over time, independently across agents; each agent faces an experimentation problem because payoffs are informati...

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size d...

Time-delay systems exist in many engineering fields such as transportation systems, communication systems, process engineering and, more recently, networked control systems. It usually results in unsatisfactory performance and is frequently a source of instability, so the control of time-delay systems is practically important. In this paper, a design of the state predictive model following cont...

In this paper, we propose a new active queue management algorithm RQM based on rates of traffic passing through a router instead of the buffer occupancy inside a router. Our algorithm differs from existing work in that it uses a novel way of estimating the number of active sessions without explicitly maintaining or using per-session states at the routers. We prove that our algorithm results in ...

Explosive growth of applications for wireless networks and increasing number of users will cause significant increase in the traffic over radio channels. Consequently, uplink and downlink channels may suffer serious traffic congestion problems in the absence of effective congestion control schemes. One approach to enhance the performance of wireless services is to employ an AQM scheme for buffe...