Results 231 to 240 of about 376,238 (287)

Federated deep reinforcement learning for privacy-preserving offloading in vehicular edge computing. [PDF]

Sci Rep
Momani AM, Alsekait DM, Al-Khasawneh MA, Othman SH, Alkayid K, Kouki S, Baalamurugan KM.   +6 more
europepmc   +1 more source

Algorithms and approximations for batch-arrival queues [PDF]

, 1988
openaire   +1 more source

Triggered Concurrent Batch Arrivals and Batch Departures in Queueing Networks

Discrete Event Dynamic Systems, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chao, Xiuli, Zheng, Shaohui
openaire   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Analysis of an M/G/∞ queue with batch arrivals and batch-dedicated servers

Operations Research Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Refik Güllü
exaly   +2 more sources

Numerical analysis of queues with batch arrivals

Performance Evaluation, 2000
Summary: The steady state distribution of quasi-birth-death processes can be efficiently obtained by Matrix Geometric (MG) methods. Since a number of telecommunication problems are modelled by processes with batch arrivals, the extension of MG methods for these processes has practical importance.
M Telek
exaly   +3 more sources

POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS

Stochastic Models, 2001
We study the delay in polling systems with simultaneous batch arrivals. Arrival epochs are generated according to a Poisson process. At any arrival epoch, batches of customers may arrive simultaneously at the different queues, according to a general joint batch-size distribution.
R D van der Mei
exaly   +2 more sources

M/G/∞ with batch arrivals

Operations Research Letters, 1988
J Keilson, A Seidmann
exaly   +2 more sources

Admission control with batch arrivals

Operations Research Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Lerzan Örmeci, Apostolos Burnetas
openaire   +2 more sources

M/G/ oo with Batch Arrivals [PDF]

, 1987
Let po(n) be the distribution of the number N(oo) in the system at ergodicity for systems with an infinite number of servers, batch arrivals with general batch size distribution and general holding times. This distribution is of impotance to a variety of studies in congestion theory, inventory theory and storage systems.
Keilson, Julian, Seidmann, A.
openaire   +2 more sources

Ergodicity of a Jackson network by batch arrivals

Journal of Applied Probability, 1994
The Jackson network under study receives batch arrivals at i.i.d. intervals and features Markovian routing and exponentially distributed service times. The system is shown to be stable, in the sense of not being overloaded, if and only if, for each node, the total arrival rate of external and internal customers is less than the service rate. The method
Borovkov, A. A., Schassberger, R.
openaire   +2 more sources