Results 251 to 260 of about 2,678,131 (290)
Some of the next articles are maybe not open access.

Approximate Analysis of a Hierarchical Queuing Network

Operations Research, 1974
A hierarchical queuing network is a layered network of queues in which all arrivals receive initial service from a primary server, and some customers receive additional service jointly from a primary and a secondary server. This paper considers the simplest such network, involving two levels and a single secondary server who functions as a consultant ...
openaire   +3 more sources

Solving Semi-Open Queuing Networks

Operations Research, 2009
A semi-open queuing network (SOQN) is a special type of a queuing network consisting of two parts: an inner network with a population constraint and an external queue to accommodate jobs whose entrance is delayed. We first study an SOQN with a single class of jobs in tandem configuration and then extend our study to multiclass configurations ...
Jing Jia, Sunderesh S. Heragu
openaire   +2 more sources

Queuing Networks with Population Size Constraints

IBM Journal of Research and Development, 1977
The class of queuing networks with multiple routing subchains is extended to include mechanisms of state-dependent lost arrivals and triggered arrivals. A sufficient condition is found, involving the loss and trigger functions, for the equilibrium network state probability distribution to have the product form; the known class of queuing networks with ...
openaire   +1 more source

A Decision Model for Closed Queuing Networks

IEEE Transactions on Software Engineering, 1979
This paper considers a computer configuration design problem. The computer system is modeled by a closed queuing network. The system throughput is the objective function to be maximized and the speed of the devices are the decision variables. A rich class of non-linear cost functions is considered.
Kishor S. Trivedi, Robert A. Wagner
openaire   +2 more sources

Queuing Networks with Random Selection for Service

IEEE Transactions on Software Engineering, 1979
To the class of queuing networks analyzable by the method of Baskett, Chandy, Muntz, and Palacios, we add service centers whose scheduling is random. That is, upon completion of a service interval, the server chooses next to serve one of the waiting customers selected at random.
openaire   +3 more sources

Analysis of Queuing Delay in RPR Networks

2007 IEEE International Performance, Computing, and Communications Conference, 2007
Resilient packet ring (RPR) that has been standardized as IEEE 802.17 is a MAC layer protocol designed for data centric metropolitan area network applications. A well-designed RPR network would be able to offer QoS guarantee for throughput and delay sensitive data classes in addition to providing other types of low cost best effort services.
Behnoosh Hariri, Mohammad Reza Pakravan
openaire   +2 more sources

UPnP QoS and queuing in home networks

2010 IEEE 18th International Workshop on Quality of Service (IWQoS), 2010
The QoS provisioning in home networks is being more often considered for future use cases, where multiple high bandwidth flows are accommodated in the home environment. This paper investigates chosen characteristics of one of the home network control and management protocol suites, namely UPnP.
Lukasz Brewka   +2 more
openaire   +1 more source

Quantum Queuing Networks Throughput Optimisation

2014
We study models of quantum queues based on discrete time quantum walks with barriers. Our considerations refer to multi-servers queuing models. Input and output of jobs in the queue are realised by systems consisting of quantum coins and walkers. We show that presented models behave differently from the classical ones. We also present numerical methods
Dariusz Kurzyk, Piotr Gawron
openaire   +2 more sources

Queuing network decomposition and facilities planning

Computers & Operations Research, 1985
Abstract We have shown previously that open, closed, and mixed networks of queues are viable means of analyzing the configuration and composition of resources in facility layout problems. In this paper, we explore the scope and limitations of decomposition techniques for modelling general arrival and service processes M/G/C, M/D/C and GI/G/C within ...
J. MacGregor Smith, Bouteldja Bouanaka
openaire   +1 more source

Queuing network analysis for waterways with artificial neural networks

Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 1999
An Artificial Neural Network (ANN) model has been developed for analyzing traffic in an inland waterway network. The main purpose of this paper is to determine how well such a relatively fast model for analyzing a queuing network could substitute for far more expensive simulation.
Liang Zhu   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy