Results 41 to 50 of about 102 (93)

Fluid model criterion for instability of re-entrant line with infinite supply of work

open access: yes
Re-entrant lines, Infinite supply, Preempt–resume SBP discipline, Fluid (limit) model, Unstable, Weakly unstable, 60K25, 90B22, 60K20, 90B35,
Yongjiang Guo
core   +1 more source

Performance evaluation of finite-source cognitive radio networks with non-reliable services using simulation [PDF]

open access: yes, 2018
The cognitive radio (CR) is a dynamic spectrum access technique which provides the capability to share a wireless channel between licensed and unlicensed users opportunistically (also called Primary Users - PU and Secondary Users - SU). In this paper,
Sztrik, János   +3 more
core   +1 more source

Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N

open access: yes
General independent arrival, Batch arrival, Finite buffer, Queue, Markovian service process, 60K25, 90B22,
U. Gupta, A. Banik
core   +1 more source

Computational approach to cost and profit analysis of clocked queueing networks [PDF]

open access: yes, 2010
Cost and profit analysis of a queueing network problem has a significant value for modern-economics and informatics age. Here, we consider a clocked queueing network with renewal model and developed a computational approach to analyze cost and profit ...
S S Mishra, D K Yadav
core  

Queuing system with state-dependent controlled batch arrivals and server under maintenance

open access: yes
Markovian queue, Control of admission, Server maintenance, Transient probability, Steady state, Waiting time, Busy period, 60K25, 60K30, 90B22,
B. Krishna Kumar   +2 more
core   +1 more source

Nonhomogeneous geometric distributions with relations to birth and death processes

open access: yes
Nonhomogeneous, Geometric distribution, Queueing, Birth-and-death processes, 60E05, 60K25, 90B22,
Myron Hlynka   +2 more
core   +1 more source

Cyclic Queueing Networks with Subexponential Service Times [PDF]

open access: yes, 2002
For a K-stage cyclic queueing network with N customers and general service times we give an explicit expression for the n departure time from each stage.
Palmowski, Z.B.   +5 more
core  

On Perfect Simulation of Markovian Queueing Networks with Blocking

open access: yes, 2002
Perfect simulation of a class of Markovian queueing networks with finite buffers is examined in this monograph. The network processes defined are modelled by restricted multivariate birth and death processes with intensities depending on a random ...
Mattsson, Dan
core   +2 more sources

Heavy-Traffic Analysis of the M/G/1 Queue With Priority Classes [PDF]

open access: yes
AMS classifications: 60K25, 90B22.M=G=1 queue;priority;heavy-tailed service time distribution;regular variation;waiting time distribution;heavy-traffic limit theorem;heavy-traffic ...
Deng, Q., Cohen, J.W., Boxma, O.J.
core  

Tail behaviour of the busy period of a GI/G/1 queue with subexponential service times

open access: yes, 2002
This paper considers a stable GI/G/1 queue with subexponential service time distribution. Under natural assumptions we derive the tail behaviour of the busy period of this queue.
D. J. Daley   +2 more
core  

Home - About - Disclaimer - Privacy