Results 221 to 230 of about 25,343 (268)
Some of the next articles are maybe not open access.
To Queue or Not to Queue: A Rejoinder
Interfaces, 1979It's a good feeling to see a scholar of Peter Kolesar's stature take the time and effort to expound his views so eloquently in Interfaces. But while there is value in Professor Kolesar's comments, I feel he does not delve deeply enough. First, let me give credit to Professor Byrd [Byrd, Jack. Jr. 1978. The value of queuing theory.
openaire +1 more source
Fair queueing without per-flow queues: A Virtual Queueing Machine
2014 International Conference on Computing, Networking and Communications (ICNC), 2014In this paper, we present a novel fair-queueing solution, dubbed Virtual Queueing Machine (VQM), that avoids the one-queueing-per-flow architecture found in many existing solutions. Its objective is to provide throughput fairness among competing backlogged flows while protecting the response times for short-lived flows.
Gary Chang, C. C. Lee 0001
openaire +1 more source
Queue Length Dependent Priority Queues
Management Science, 1971Priority rules that are mixtures of pre-emption and postponable rules are analyzed. Whether a pre-emption occurs is made to depend on some factor in addition to priority class. A lower priority customer is pre-empted if and only if the queue length of higher priority customers is N, a decision parameter.
openaire +1 more source
RAIRO - Theoretical Informatics and Applications, 2018
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a
Simon Beier +3 more
openaire +1 more source
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a
Simon Beier +3 more
openaire +1 more source
On the Growth of the Maximum Queue Length in a Stable Queue
Operations Research, 1971Even for a stable one-server queue with relative traffic intensity less than unity, the maximum queue length observed will tend to infinity in probability as the length of time for which the system has been observed becomes large. It is important to have information on the behavior of the maximum queue length to enable estimation of the congestion ...
openaire +1 more source
Operations Research, 2010
This article presents the first models developed specifically for understanding the infiltration and interdiction of ongoing terror plots by undercover intelligence agents, and does so via novel application of ideas from queueing theory and Markov population processes.
openaire +1 more source
This article presents the first models developed specifically for understanding the infiltration and interdiction of ongoing terror plots by undercover intelligence agents, and does so via novel application of ideas from queueing theory and Markov population processes.
openaire +1 more source
Computers in Entertainment, 2003
I am the Editor of Queue (http://www.acmqueue.org), ACM's recently launched magazine geared towards practicing software developers and architects. We have a great editorial advisory board, including industry giants such as Steve Bourne, Eric Allman, and Jim Gray.We have a special report on "Gaming Technology and Issues" coming up.
openaire +1 more source
I am the Editor of Queue (http://www.acmqueue.org), ACM's recently launched magazine geared towards practicing software developers and architects. We have a great editorial advisory board, including industry giants such as Steve Bourne, Eric Allman, and Jim Gray.We have a special report on "Gaming Technology and Issues" coming up.
openaire +1 more source
Journal of the Operational Research Society, 2006
This paper presents results from a bulk service queueing system, where the main service takes place at fixed time intervals, but where back-up (or relief) services may be introduced in times of heavy demand on the system. On occasions the back-up service itself may receive further back-up services, thus leading to the concept of a cascade of queues ...
openaire +1 more source
This paper presents results from a bulk service queueing system, where the main service takes place at fixed time intervals, but where back-up (or relief) services may be introduced in times of heavy demand on the system. On occasions the back-up service itself may receive further back-up services, thus leading to the concept of a cascade of queues ...
openaire +1 more source
Journal of Urban Economics, 2003 This paper develops a continuous-time -continuous-place economic model of road trafficcongestion with a bottleneck, based on car-following theory. The model integrates twoarchetype congestion technologies used in the economics literature: 'static flow congestion',originating in the works of Pigou, and 'dynamic bottleneck congestion', pioneered ...
openaire +2 more sources
2000
In the present thesis, a theoretical framework for the analysis of spatial queues is developed. Spatial queues are a generalization of the classical concept of queues as they provide the possibility of assigning properties to the users. These properties may influence the queueing process, but may also be of interest for themselves.
openaire +2 more sources
In the present thesis, a theoretical framework for the analysis of spatial queues is developed. Spatial queues are a generalization of the classical concept of queues as they provide the possibility of assigning properties to the users. These properties may influence the queueing process, but may also be of interest for themselves.
openaire +2 more sources