active queue management (aqm) plays an important role in the internet congestion control. it tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. random early detection (red) is the most popular active queue management algorithm that has been implemented in the in internet routers and is trying to supply low delay and low packet loss. red algori...

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

In this paper, we propose a method for finding the optimum information queue length of a palmtop multimedia terminal. which is equipped with semi-batch power management. This optimum queue length is determined by the minimization of power consumption, which is based on the balance of the probability combination of high-power state and low-power state. The low-power states are derived from the “...

many serious accidents have happened in the world, in which systems have been large-scale and complex, and caused heavy damage and a social sense of instability. furthermore, advanced nations have almost finished public infrastructure and rushed into a maintenance period. since maintenance is more important than production and construction, then more maintenance for environmental considerations...

Adaptive RED (ARED) is an active queue management (AQM) designed for congestion responsive traffics such as TCP. ARED aims to keep average queue length around a predefined queue length. If so, average delay will be offered to Internet users and simultaneously high link utilization will be achieved. However, ARED algorithm merely makes the average queue length loosely converge to the target leng...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

conclusions: the patients' waiting times and the number of patients waiting to receive services in both shifts could be reduced by using multitasking persons and reallocating them to the time-consuming stage of filling prescriptions, using queuing theory and simulation techniques. background: hospital pharmacy is responsible for controlling and monitoring the medication use process and ensures ...

Formulas relating the mean queue length, utilization, and coefficient of variation of service time of a queue during a given observation period are derived using operational analysis. The main formula, a counterpart of the Pollaczek-Khintchin formula for M/G/l queues, relies on four homogeneity assumptions. The other formulas require fewer assumptions. Simulation experiments compare the robustn...

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...