ﻻ يوجد ملخص باللغة العربية
The large-time behavior of a nonlinearly coupled pair of measure-valued transport equations with discontinuous boundary conditions, parameterized by a positive real-valued parameter $lambda$, is considered. These equations describe the hydrodynamic or fluid limit of many-server queues with reneging (with traffic intensity $lambda$), which model phenomena in diverse disciplines, including biology and operations research. For a broad class of reneging distributions with finite mean and service distributions with finite mean and hazard rate function that is either decreasing or bounded away from zero and infinity, it is shown that if the fluid equations have a unique invariant state, then the Dirac measure at this state is the unique random fixed point of the fluid equations, which implies that the stationary distributions of scaled $N$-server systems converge to the unique invariant state of the corresponding fluid equations. Moreover, when $lambda e 1$, it is shown that the solution to the fluid equation starting from any initial condition converges to this unique invariant state in the large time limit. The proof techniques are different under the two sets of assumptions on the service distribution. When the hazard rate function is decreasing, a reformulation of the dynamics in terms of a certain renewal equation is used, in conjunction with recursive asymptotic estimates. When the hazard rate function is bounded away from zero and infinity, the proof uses an extended relative entropy functional as a Lyapunov function. Analogous large-time convergence results are also established for a system of coupled measure-valued equations modeling a multiclass queue.
This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the total numb
A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total number of cu
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience times of
We consider the so-called GI/GI/N queue, in which a stream of jobs with independent and identically distributed service times arrive as a renewal process to a common queue that is served by $N$ identical parallel servers in a first-come-first-serve m
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy in which customers have deadlines and are served only until their deadlines elapse. The performance of the