Results 261 to 270 of about 15,764 (307)

Closed Queuing Systems with Exponential Servers

Operations Research, 1967
The results contained herein pertain to the problem of determining the equilibrium distribution of customers in closed queuing systems composed of M interconnected stages of service. The number of customers, N, in a closed queuing system is fixed since customers pass repeatedly through the M stages with neither entrances nor exits permitted.
William J. Gordon, Gordon F. Newell
openaire   +1 more source

Queuing System for the SpaceFibre Standard

2018 22nd Conference of Open Innovations Association (FRUCT), 2018
The streaming data over onboard spacecraft and aircraft networks is considered in the paper. The SpaceFibre spacecraft standard could be successfully used for streaming. It is proven by the proposed comparison of SpaceFibre with other network standards.
openaire   +1 more source

Queuing Systems with Enforced Idle Time

Operations Research, 1967
Enforced idle time occurs in any queuing system in which it is possible for the server to be idle and the queue length to be nonzero simultaneously. This paper examines queuing systems in which the server is constrained to start service only at fixed intervals of time, with arrivals of customers and service completions occurring continuously. The GI/M/
B. A. Powell, B. Avi-Itzhak
openaire   +2 more sources

Markovian Ants in a Queuing System

2010
The synthesis of memoryless Markovian systems and Ant based concept with memory characteristics of deposit pheromone is the basis for the presented artificial intelligence hybrid Only the initial elements of the system are specified in this paper by illustrating the routes of two ants The pheromone capacity was first modelled as an exponential-type ...
Ilija Tanackov, Dragan Simic, Sinisa Sremac, Jovan Tepic, Suncica Kocic-Tanackov   +4 more
openaire   +1 more source

Priority queuing in an operating system

Computers & Operations Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Optimality of Single-Server Queuing Systems

Operations Research, 1970
This paper considers optimal design models for queuing systems in which the decision variables are the number of servers and the mean rate at which each serves, the total cost per unit time of operating the system is the sum of a service cost per unit time and a waiting cost per unit time, and the optimality criterion is long-run expected average cost
openaire   +1 more source

Priority Queuing Systems with and without Feedback

Operations Research, 1973
The problems discussed in this paper arose in the theory of telephone traffic, with a central processing system, such as a computer, performing numerous functions in as exchange. However, several of its more important results are applicable in many businesses offering multiple services, including ones working on a nonpriority basis.
openaire   +2 more sources

The Output of a Queuing System

Operations Research, 1956
For a queuing system with Poisson input, a single waiting line without defections, and identically distributed independent (negative) exponential service times, the equilibrium distribution of the number of service completions in an arbitrary time interval is shown to be the same as the input distribution, for any number of servers.
openaire   +1 more source

Redundant queuing system with unreliable servers

2014 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2014
We consider a two-channel queuing system with unreliable servers which fail alternately for modeling of hybrid communication systems, which have a millimeter-wave (71–76 GHz, 81–86 GHz) radio channel as a backup communication channel. The stationary distribution of the system states and the most important performance characteristics were obtained.
Vladimir M. Vishnevsky, Dmitry Kozyrev, Olga V. Semenova   +2 more
openaire   +1 more source

Queuing simulation model for multiprocessor systems

Computer, 2003
The processor queuing model provides memory-hierarchy and system-design evaluation of memory-intensive commercial online-transaction-processing workloads on large multiprocessor systems. It differs from detailed cycle-accurate and direct-execution simulations in that it does not simulate instruction execution.
Thin-Fong Tsuei, Wayne Yamamoto
openaire   +1 more source