Queue Management (queue + management)

Distribution by Scientific Domains


Selected Abstracts


IMPROVING JOB SHOP PERFORMANCE THROUGH PROCESS QUEUE MANAGEMENT UNDER TRANSFER BATCHING

PRODUCTION AND OPERATIONS MANAGEMENT, Issue 4 2000
JOEL LITCHFIELD
This research investigated the value of protecting the continuity of release batchs in a transfer batching environment, by modifying the SPT rule. A simulation model of a job shop was used to test the modified SPT rule. The performance measures evaluated were mean flow time, flow time variance, and mean lateness. Conditions under which the SPT modification improved results were as follows: large number of transfer batches, small setup time to process time ratio, and large variation in process times from station to station. The results suggest that shop loading is not a significant factor affecting performance of the modified SPT rule. [source]


Adaptive AQM controllers for IP routers with a heuristic monitor on TCP flows

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 1 2006
Yang Hong
Abstract We propose adaptive proportional (P) and proportional-integral (PI) controllers for Active Queue Management (AQM) in the Internet. We apply the classical control theory in the controller design and choose a proper phase margin to achieve good performance of AQM. We have identified a simple heuristic parameter that can monitor the changes of network environment. Our adaptive controllers would self-tune only when the dramatic change in the network parameters drift the monitoring parameter outside its specified interval. When compared to P controller, a PI controller has the advantage of regulating the TCP source window size by adjusting the packet drop probability based on the knowledge of instantaneous queue size, thus steadying the queue size around a target buffer occupancy. We have verified our controllers by OPNET simulation, and shown that with an adaptive PI controller applied, the network is asymptotically stable with good robustness. Copyright © 2005 John Wiley & Sons, Ltd. [source]


PAQM: an adaptive and proactive queue management for end-to-end TCP congestion control

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 8 2004
Seungwan RyuArticle first published online: 2 SEP 200
Abstract Two functions, the congestion indicator (i.e. how to detect congestion) and the congestion control function (i.e. how to avoid and control congestion), are used at a router to support end-to-end congestion control in the Internet. Random early detection (RED) (IEEE/ACM Trans. Networking 1993; 1(4):397,413) enhanced the two functions by introducing queue length averaging and probabilistic early packet dropping. In particular, RED uses an exponentially weighted moving average (EWMA) queue length not only to detect incipient congestion but also to smooth the bursty incoming traffic and its resulting transient congestion. Following RED, many active queue management (AQM)-based extensions have been proposed. However, many AQM proposals have shown severe problems with detection and control of the incipient congestion adaptively to the dynamically changing network situations. In this paper, we introduce and analyse a feedback control model of TCP/AQM dynamics. Then, we propose the Pro-active Queue Management (PAQM) mechanism, which is able to provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function under a wide range of traffic environments. The PAQM stabilizes the queue length around the desired level while giving smooth and low packet loss rates and high network resource utilization. Copyright © 2004 John Wiley & Sons, Ltd. [source]


A simple mechanism for stabilizing network queues in TCP/IP networks

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 4 2007
James Aweya
In this paper we determine the stability bounds for the DRED active queue management (AQM) algorithm using a previously developed nonlinear dynamic model of TCP. We develop a second-order linear model with time delay by linearizing the nonlinear model. Using the Pade approximation of time-delayed system e,R0s, where R0 is the delay in the system, we then determine the range of stabilizing gains of DRED when controlling the second-order system with time delay R0. We also present examples showing the stability bounds of the DRED controller gain for networks with different parameters such as link capacity, load level, and round-trip time. In addition, we describe an efficient implementation of the DRED AQM algorithm. Copyright © 2006 John Wiley & Sons, Ltd. [source]