Results 211 to 220 of about 9,050 (237)
Some of the next articles are maybe not open access.

Sojourn time problems in feedback queues

Queueing Systems, 1989
The paper develops the theory behind the determination of the sojourn time distribution in a Markov renewal queue with state dependent feedback and applies these results to the special case of a birth-death queue. For the latter, an alternative derivation utilizing the theory of first passage time distributions in continuous-time Markov chains is also ...
openaire   +2 more sources

On reduction of sojourn time for patients at department of cardiology

2014 7th International Conference on Biomedical Engineering and Informatics, 2014
In this paper, a two-staged method of determining the order of medical examinations is presented to reduce sojourn times for patients visiting a department of cardiology. The first stage works as the batch process in the nighttime, and determines the order of medical examinations for patients with appointments. The second stage is designed for patients
Naotake Kamiura   +4 more
openaire   +1 more source

Sojourn times in queueing networks [PDF]

open access: yes, 1989
From a customer's point of view, the most important performance measure in a queueing network is his sojourn time. This paper presents a survey of sojourn time results in queueing networks. Particular attention is paid to product-form networks, for which
Boxma, O.J., Daduna, H.
openaire   +2 more sources

Sojourn Times in Dependability Modeling

2016
We consider Markovian models of computing or communication systems, subject to failures and, possibly, repairs. The dependability properties of such systems lead to metrics that can all be described in terms of the time that the Markov chain spends in subsets of its state space.
Rubino, Gerardo, Sericola, Bruno
openaire   +2 more sources

On Sojourn Times for Functions and Random Processes

Theory of Probability & Its Applications, 1979
Davydov, Yu. A., Rozin, A. L.
openaire   +1 more source

Sojourn-time Analysis and CAC in ATM Networks

1997
In this paper, we explore the potential of applying sojourn-time analysis in QoS metrics specification and in CAC algorithm design for ATM networks. We propose using the probability a link overflow occurs during a connection’s life as a measure of its QoS.
openaire   +1 more source

Sojourn time

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

Stochastic Geometry Analysis of Sojourn Time in Multi-Tier Cellular Networks

IEEE Transactions on Wireless Communications, 2021
Mohammad Salehi, Ekram Hossain
exaly  

Home - About - Disclaimer - Privacy