The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving ave...

BACKGROUND Hospital pharmacy is responsible for controlling and monitoring the medication use process and ensures the timely access to safe, effective and economical use of drugs and medicines for patients and hospital staff. OBJECTIVES This study aimed to optimize the management of studied outpatient pharmacy by developing suitable queuing theory and simulation technique. PATIENTS AND METH...

In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded M...

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that o -periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a nite-bu...

Experimental results with standard ON-OFF sources, as input to a one server queue, indicate that the M/D/1 model is adequate below a certain utilization, ρ* (say), and plain wrong above. Moreover, as the output capacity increases, ρ* increases towards 1. We provide simple engineering formulae, together with computable conditions of their applicability, to physically explain these facts. We also...

The subject of this paper is open multiclass queueing networks, which are common models of communication networks, and complex manufacturing systems such as wafer fabrication facilities. We provide sufficient conditions for the existence of bounds on long-run average moments of the queue lengths at the various stations, and we bound the rate of convergence of the mean queue length to its steady...

This paper is concerned with a problem of control in the queuing systems. Rather than deal with mean waiting time or average queue length, which is the most often used approach to this problem, it concentrates on transient states and minimizing probability of long queue. First a model of a queuing system with controlled service intensity is analyzed. Subsequently, a system with multiple service...

This paper studies the behavior of a discrete queueing system which accepts synchronized arrivals and provides synchronized services. The number of arrivals occurring at an arriving point may follow any arbitrary discrete distribution possessing finite first moment and convergent probability generating function in I z [ ~< 1 + e with e > O. The system is equipped with an infinite buffer and one...

This paper explores traffic dynamics and performance of complex networks. Complex networks of various structures are studied. We use node betweenness centrality, network polarization, and average path length to capture the structural characteristics of a network. Network throughput, delay, and packet loss are used as network performance measures. We investigate how internal traffic, through put...

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic ...