Performance evaluation of finite-source cognitive radio networks with non-reliable services using simulation [PDF]
, 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
Tail behaviour of the busy period of a GI/G/1 queue with subexponential service times [PDF]
, 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
Computational approach to cost and profit analysis of clocked queueing networks [PDF]
, 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
Cyclic Queueing Networks with Subexponential Service Times [PDF]
, 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, ZB Zbigniew +8 more
core
© Hindawi Publishing Corp. RESERVICING SOME CUSTOMERS IN M/G/1 QUEUES UNDER THREE DISCIPLINES [PDF]
, 2002 Consider an M/G/1 production line in which a production item is failed with some proba-bility and is then repaired. We consider three repair disciplines depending on whether the failed item is repaired immediately or first stockpiled and repaired after ...
K. Mengersen +2 more
core
Sojourn times in the M/G/1 FB queue with light-tailed service times. [PDF]
, 2004 The asymptotic decay rate of the sojourn time of a customer in the stationary M/G/1 queue under the Foreground-Background (FB) service discipline is studied.
Nuijens, M.F.M. +4 more
core
Optimality of the Round Robin Routing Policy [PDF]
, 1994 In this paper we consider the problem of routing customers to identical servers, each with its own infinite capacity queue. Under the assumptions that i) the service times form a sequence of independent and identically distributed random variables with ...
Don Towsley +3 more
core
A Fluid-Limit Model Criterion for Instability of Multiclass Queueing Networks [PDF]
, 1996 This paper studies the instability of multiclass queueing networks. We prove that if a fluid limit model of the queueing network is weakly unstable, then the queueing network is unstable in the sense that the total number of customers in the queueing ...
J. G. Dai
core
On Perfect Simulation of Markovian Queueing Networks with Blocking [PDF]
, 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
A Multiclass Station with Markovian Feedback in Heavy Traffic [PDF]
, 1995 This paper proves a heavy traffic limit theorem for a multiclass service station with Markovian feedback. This result generalizes the one proved by Reiman (1988). Our approach also significantly simplifies Reiman's original proof. Numerical examples
Thomas G. Kurtz, J. G. Dai
core