Results 241 to 250 of about 4,426,237 (288)
Some of the next articles are maybe not open access.
1984
An appropriate model for a number of systems is a network of queues in which the output of one queue is fed into another. Under a wide range of assumptions, these networks may be modeled and analyzed by means of multidimensional birth-death processes. The salient result of this work is the product form solution in which the joint distribution of queue ...
Arie Hordijk, Nico van Dijk
openaire +2 more sources
An appropriate model for a number of systems is a network of queues in which the output of one queue is fed into another. Under a wide range of assumptions, these networks may be modeled and analyzed by means of multidimensional birth-death processes. The salient result of this work is the product form solution in which the joint distribution of queue ...
Arie Hordijk, Nico van Dijk
openaire +2 more sources
Tandem Queues and Queueing Networks
2016Markov processes are a special class of stochastic processes. In order to fully understand Markov processes we first need to introduce stochastic processes. However, to help us understand stochastic process we need to remember the basic probability theory associated with it, which was briefly reviewed in the last chapter.
openaire +1 more source
Queues of Queues in Communication Networks
1988The concept of a camp-on queueing system is related to the idea of having systems of multiple hierarchical queues. Customers requesting service at a service center are queued at one of different queueing stages based on the location of the customer's intended server within the service hierarchy. In many instances, customers in a camp-on model exhibit a
openaire +1 more source
1990
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.
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.
openaire +1 more source
Network Information Flow in Network of Queues
2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems, 2008Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-hop flow routing nature in general network topologies, as well as encodable and replicable properties of information flows.
Phillipa Gill +4 more
openaire +2 more sources
Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
Operations Research, 1987We study a Gordon-Newell type of closed queueing network that frequently arises in modeling manufacturing and computer systems. We are concerned with the transient and equilibrium behavior of the joint and individual queue lengths in the network when the job population increases.
J. George Shanthikumar, David D. Yao
openaire +1 more source
Advances in Applied Probability, 1976
The behaviour in equilibrium of networks of queues is studied. Equilibrium distributions are obtained and in certain cases it is shown that the state of an individual queue is independent of the state of the rest of the network. The processes considered in this paper are irreversible; however, the method used to establish equilibrium distributions is ...
openaire +1 more source
The behaviour in equilibrium of networks of queues is studied. Equilibrium distributions are obtained and in certain cases it is shown that the state of an individual queue is independent of the state of the rest of the network. The processes considered in this paper are irreversible; however, the method used to establish equilibrium distributions is ...
openaire +1 more source
Queueing networks with blocking
Performance Evaluation, 2003Demetres D. Kouvatsos, Simonetta Balsamo
openaire +2 more sources
2008
Queueing networks model workflow in distributed computing systems and networks. They predict throughput, queue length, response time, and bottlenecks with simple, fast algorithms.January 2008 Rev 7/7 ...
openaire +3 more sources
Queueing networks model workflow in distributed computing systems and networks. They predict throughput, queue length, response time, and bottlenecks with simple, fast algorithms.January 2008 Rev 7/7 ...
openaire +3 more sources
Queueing network models of multimicrocomputer networks
Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '83, 1983Recent developments in very large scale integration have made it feasible to construct a highly parallel computer composed of large numbers of interconnected microcomputers. The modeling problems posed by this approach to parallel processing differ in several significant respects from those associated with traditional queueing network models of ...
openaire +1 more source