Results 121 to 130 of about 10,042,261 (173)

UAV Trajectory Control and Power Optimization for Low-Latency C-V2X Communications in a Federated Learning Environment. [PDF]

Sensors (Basel)
Fernando X, Gupta A.
europepmc   +1 more source

Splitting for a non-Markovian tandem queue

, 2021
In this talk, we consider a non-Markovian tandem queue and we use splitting in order to estimate the probability that the total number of customers in this tandem queue reaches some high level N during a busy cycle of the system. We present a splitting scheme, and we give some insights in how we prove that our splitting scheme results in an ...
Buijsrogge, Anne, de Boer, Pieter-Tjerk, Scheinhardt, Werner R.W.   +2 more
core   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)

Operational Research, 2019
In most of the queueing models, service is considered to be complete without any interruption. But in reality, queueing systems are subject to interruptions due to failure of server or any other cause. In the present article, we present an overview and literature survey on the performance modeling and analysis of single server, general service queueing
Sandeep Kaur, Madhu Jain
exaly   +2 more sources

Recurrence and regeneration in non-markovian networks of queues

Communications in Statistics. Stochastic Models, 1987
The authors consider closed semi-Markov queueing networks with a finite number of jobs and service centers. The number of job classes is also finite, and a job may change its class randomly as it moves among the service centers. At each center, the jobs are ordered by class priorities; thus, the state takes into account the number of jobs of each class
Haas, Peter J., Shedler, Gerald S.
openaire   +1 more source

Optional services in a non-Markovian queue

International Journal of Operational Research, 2017
Summary: We study a single server queue with Poisson arrivals, two optional services following a general service time distributions. The first service is essential. Other two services are optional. Only some of the arriving customers demand the first optional service or the second optional service.
Sundari, S. Maragatha, Srinivasan, S.
openaire   +2 more sources

Non-Markovian Queueing Systems

2012
The M ∕ G ∕ 1 queueing system (Fig.8.1) is similar to the M ∕ M ∕ 1 queueing system and the only difference is that the service time distribution is no exponential. First we mention some idea, most of which were described in the previous chapter in connection with an M ∕ M ∕ 1 system.
László Lakatos, László Szeidl, Miklós Telek   +2 more
openaire   +1 more source

Stochastic monotonicity approach for a non-Markovian priority retrial queue

Asian-European Journal of Mathematics, 2021
This paper considers a non-Markovian priority retrial queue which serves two types of customers. Customers in the regular queue have priority over the customers in the orbit. This means that the customer in orbit can only start retrying when the regular queue becomes empty.
Mohamed Boualem, Nassim Touche
openaire   +2 more sources

On the non-Markovian multiclass queue under risk-sensitive cost

Queueing Systems, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rami Atar, Gal Mendelson
openaire   +2 more sources