scholarly journals Queueing Network with Moving Servers as a Model of Car Sharing Systems

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 825
Author(s):  
Chesoong Kim ◽  
Sergei Dudin ◽  
Olga Dudina

We consider a queueing network with a finite number of nodes and servers moving between the nodes as a model of car sharing. The arrival process of customers to various nodes is defined by a marked Markovian arrival process. The customer that arrives at a certain node when there is no idle server (car) is lost. Otherwise, he/she is able to start the service. With known probability, which depends on the node and the number of available cars, this customer can balk the service and leave the system. The service time of a customer has an exponential distribution. Location of the server in the network after service completion is random with the known probability distribution. The behaviour of the network is described by a multi-dimensional continuous-time Markov chain. The generator of this chain is derived which allows us to compute the stationary distribution of the network states. The formulas for computing the key performance indicators of the system are given. Numerical results are presented. They characterize the dependence of some performance measures of the network and the nodes on the total number of cars (fleet size of the car sharing system) and correlation in the arrival process.

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Alexander N. Dudin ◽  
Olga S. Dudina

A multiserver queueing system, the dynamics of which depends on the state of some external continuous-time Markov chain (random environment, RE), is considered. Change of the state of the RE may cause variation of the parameters of the arrival process, the service process, the number of available servers, and the available buffer capacity, as well as the behavior of customers. Evolution of the system states is described by the multidimensional continuous-time Markov chain. The generator of this Markov chain is derived. The ergodicity condition is presented. Expressions for the key performance measures are given. Numerical results illustrating the behavior of the system and showing possibility of formulation and solution of optimization problems are provided. The importance of the account of correlation in the arrival processes is numerically illustrated.


2015 ◽  
Vol 33 (12) ◽  
pp. 2687-2700 ◽  
Author(s):  
Wai Hong Ronald Chan ◽  
Pengfei Zhang ◽  
Ido Nevat ◽  
Sai Ganesh Nagarajan ◽  
Alvin C. Valera ◽  
...  

2018 ◽  
Vol 26 (01) ◽  
pp. 87-106 ◽  
Author(s):  
T. MIHIRI M. DE SILVA ◽  
SOPHIA R.-J. JANG

We construct models of continuous-time Markov chain (CTMC) and Itô stochastic differential equations of population interactions based on a deterministic system of two phytoplankton and one zooplankton populations. The mechanisms of mutual interference among the predator zooplankton and the avoidance of toxin-producing phytoplankton (TPP) by zooplankton are incorporated. Sudden population extinctions occur in the stochastic models that cannot be captured in the deterministic systems. In addition, the effect of periodic toxin production by TPP is lessened when the birth and death of the populations are modeled randomly.


Sign in / Sign up

Export Citation Format

Share Document