Related papers: Occupation times for the finite buffer fluid queue…
We consider the $M/M/1$ queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic limits. These include large time and/or large service…
We establish limit theorems for the fluctuations of the rescaled occupation time of a $(d,\alpha,\beta)$-branching particle system. It consists of particles moving according to a symmetric $\alpha$-stable motion in $\mathbb{R}^d$. The…
The $(d,\alpha,\beta,\gamma)$-branching particle system consists of particles moving in $R^d$ according to a symmetric $\alpha$-stable L\'evy process $(0<\alpha\leq 2)$, splitting with a critical $(1+\beta)$-branching law $(0<\beta\leq 1)$,…
In this paper excursions of a stationary diffusion in stationary state are studied. In particular, we compute the joint distribution of the occupation times $I^{(+)}_t$ and $I^{(-)}_t$ above and below, respectively, the observed level at…
We consider the $M/M/1$-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn…
The infinite servers queue with Poisson arrivals state transient probabilities, considering the time origin at the beginning of a busy period, mean and variance monotony as time functions is studied. These studies, for which results it is…
Estimation of the service time distribution in the discrete-time $GI/G/\infty$-queue based solely on information on the arrival and departure processes is considered. The focus is put on the estimation approach via the so called "sequence…
In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…
Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…
We consider a system of non-interacting Brownian particles on the line with steplike initial condition and study the statistics of the occupation time on the positive half-line. We demonstrate that this system exhibits long-lasting memory…
We consider a finite population processor-sharing (PS) queue, with Markovian arrivals and an exponential server. Such a queue can model an interactive computer system consisting of a bank of terminals in series with a central processing…
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
We study the online busy time scheduling model on heterogeneous machines. In our setting, jobs with uniform length arrive online with a deadline that becomes known to the algorithm at the job's arrival time. An algorithm has access to…
We study a double-ended queue where buyers and sellers arrive to conduct trades. When there is a pair of buyer and seller in the system, they immediately transact a trade and leave. Thus there cannot be non-zero number of buyers and sellers…
Some fundamental and formal aspects of the quantum dwell time are reviewed, examples for free motion and scattering off a potential barrier are provided, as well as extensions of the concept. We also examine the connection between the dwell…
In random access protocols, the service rate depends on the number of stations with a packet buffered for transmission. We demonstrate via numerical analysis that this state-dependent rate along with the consideration of Poisson traffic and…
The time which a diffusing particle spends in a certain region of space is known as the occupation time, or the residence time. Recently the joint occupation time statistics of an ensemble of non-interacting particles was addressed using…
The busy period length distribution function knowledge is important for any queue system, and for the MGINF queue. But the mathematical expressions are in general very complicated, with a few exceptions, involving usually infinite sums and…
A method to study and evaluate the occupation of a Hospital Surgery Service, with some specificity in its activity, is outlined in this work. Its application is exemplified with real data, and it is shown that it is simple, practical, and…
We study a single server queue under a processor-sharing type of scheduling policy, where the weights for determining the sharing are given by functions of each job's remaining service(processing) amount, and obtain a fluid limit for the…