Results 231 to 240 of about 4,426,237 (288)
Some of the next articles are maybe not open access.
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
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
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 +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.
Jian Gang Dai 0001, Otis B. Jennings
openaire +3 more sources
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 +2 more sources
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 +2 more sources
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 +3 more sources
Sojourn Times in Queueing Networks
Mathematics of Operations Research, 1982We consider a queueing network with types of customers. Poisson arrivals, type dependent routing and state dependent service. A number of stochastic aspects relating to sojourn times are investigated. Included are limiting state distributions imbedded at customer move times, mean sojourn times, and sojourn time distributions along overtake-free paths.
openaire +1 more source
2016
We describe a queueing network model for mobile servers on a network’s graph. The principle behind resembles the procedure to consider a “referenced node” in a static network or a network of mobile nodes. We investigate an integrated model where a “referenced mobile node” is described jointly with all other mobile nodes.
openaire +2 more sources
We describe a queueing network model for mobile servers on a network’s graph. The principle behind resembles the procedure to consider a “referenced node” in a static network or a network of mobile nodes. We investigate an integrated model where a “referenced mobile node” is described jointly with all other mobile nodes.
openaire +2 more sources
Queueing networks with blocking
ACM SIGMETRICS Performance Evaluation Review, 1984In recent years, queueing networks with blocking have been studied by researchers from various research communities such as Computer Performance Modelling, Operations Research, and Industrial Engineering. In view of this, related results are scattered throughout various journals.
openaire +1 more source
1994
In this chapter we will consider networks of queues. Simple analytical results are usually only possible for Markovian queueing networks. We will start by establishing the product form solution for the equilibrium state probabilities for such networks in section 3.2.
X. Chao, M. Pinedo
openaire +1 more source
In this chapter we will consider networks of queues. Simple analytical results are usually only possible for Markovian queueing networks. We will start by establishing the product form solution for the equilibrium state probabilities for such networks in section 3.2.
X. Chao, M. Pinedo
openaire +1 more source