Results 121 to 130 of about 6,894,402 (197)
Some of the next articles are maybe not open access.
Introduction to Queueing Systems with Telecommunication Applications, 2019
L. Lakatos, L. Szeidl, M. Telek
semanticscholar +2 more sources
L. Lakatos, L. Szeidl, M. Telek
semanticscholar +2 more sources
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM, 1973 Jeffrey P Buzen, Buzenjeffrey P
exaly +2 more sources
2007
The purpose of this tutorial is to survey queueing networks, a class of stochastic models extensively applied to represent and analyze resource sharing systems such as communication and computer systems. Queueing networks (QNs) have been proved to be a powerful and versatile tool for system performance evaluation and prediction. First we briefly survey
BALSAMO, Maria Simonetta, MARIN, Andrea
openaire +2 more sources
The purpose of this tutorial is to survey queueing networks, a class of stochastic models extensively applied to represent and analyze resource sharing systems such as communication and computer systems. Queueing networks (QNs) have been proved to be a powerful and versatile tool for system performance evaluation and prediction. First we briefly survey
BALSAMO, Maria Simonetta, MARIN, Andrea
openaire +2 more sources
Stabilizing Queueing Networks with Setups
Mathematics of Operations Research, 2004For multiclass queueing networks, dispatch policies govern the assignment of servers to the jobs they process. Production policies perform the analogous task for queueing networks whose servers are subject to switch-over delays or setups, a model we refer to as setup networks.
J G Dai
exaly +3 more sources
On Pooling in Queueing Networks
Management Science, 1998We view each station in a Jackson network as a queue of tasks, of a particular type, which are to be processed by the associated specialized server. A complete pooling of queues, into a single queue, and servers, into a single server, gives rise to an M/PH/1 queue, where the server is flexible in the sense that it processes all tasks.
Avishai Mandelbaum, Martin I. Reiman
openaire +1 more source
The behaviour of a single queue in a general queueing network
Acta Informatica, 1976We develop a method based on diffusion approximations in order to compute, under general conditions, the queue length distribution of a single queue in a network of queues. Several applications of this approach to computer network performance analysis and to time-sharing systems are presented.
Erol Gelenbe, Guy Pujolle
openaire +1 more source
Nonstationary analysis of the loss queue and of queueing networks of loss queues
European Journal of Operational Research, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khalid Abdulaziz Alnowibet +1 more
openaire +1 more source
Bell System Technical Journal, 1983
This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues. The first version of QNA analyzes open networks of multiserver nodes with the first-come, first-served discipline and no capacity constraints.
openaire +1 more source
This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues. The first version of QNA analyzes open networks of multiserver nodes with the first-come, first-served discipline and no capacity constraints.
openaire +1 more source
Stochastic Monotonicity in Queueing Networks
2009Stochastic monotonicity is one of the sufficient conditions for stochastic comparisons of Markov chains. On a partially ordered state space, several stochastic orderings can be defined by means of increasing sets. The most known is the strong stochastic (sample-path) ordering, but weaker orderings (weak and weak*) could be defined by restricting the ...
Castel-Taleb, Hind, Pekergin, Nihal
openaire +2 more sources