Servi L.D.

L.D. Servi

Information about the author L.D. Servi will soon be added to the site.
Found 12 papers in total
Idle and busy periods in stable M/M/k queues
Idle and busy periods in stable M/M/k queues
1998
This paper finds the first and second moments of the number of arrivals in a stable M...
Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
1999
We address the problem of assigning probabilities at discrete time instants for...
Moment estimation of customer loss rates from transactional data
Moment estimation of customer loss rates from transactional data
1998
Moment estimators are proposed for the arrival and customer loss rates of a...
Estimating waiting times from transactional data
Estimating waiting times from transactional data
1997
Given transactional data consisting of service starting and finishing times in a...
A further study of an approximation for last-exit and first-passage probabilities of a random walk
A further study of an approximation for last-exit and first-passage probabilities of a random walk
1994
Identities between first-passage or last-exit probabilities and unrestricted...
The M/G/1/M blocking formula and its generalizations to state-dependent vacation systems and priority systems
The M/G/1/M blocking formula and its generalizations to state-dependent vacation systems and priority systems
1993
The formula for the blocking probability for the finite capacity M/G/1/K in terms of...
Exploiting Markov chains to infer queue length from transactional data
Exploiting Markov chains to infer queue length from transactional data
1992
The use of taboo probabilities in Markov chains simplifies the task of calculating the...
Cyclic service queues with very short service times
Cyclic service queues with very short service times
1991
In many applications arising from computer operating systems, telecommunication...
Deducing queueing from transactional data: The queue inference engine, revisited
Deducing queueing from transactional data: The queue inference engine, revisited
1992
R. Larson proposed a method to statistically infer the expected transient queue length...
The distributional form of Little’s Law and the Fuhrmann-Cooper decomposition
The distributional form of Little’s Law and the Fuhrmann-Cooper decomposition
1990
For certain classes of customers, the ergodic number of customers in system (queue)...
Blocking probability for M/G/1 vacation systems with occupancy level dependent schedules
Blocking probability for M/G/1 vacation systems with occupancy level dependent schedules
1989
An M / G /1 queue with finite buffer capacity and server vacation schedules dependent...
The busy period of the M/G/1 vacation model with a Bernoulli schedule
The busy period of the M/G/1 vacation model with a Bernoulli schedule
1988
The server busy period for the M / G /1 vacation model with a Bernoulli schedule is...
Papers per page: