Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
291
Estimating queue length distributions for queues with random arrivals
- SIGMETRICS Perform. Eval. Rev
, 2012
"... ABSTRACT This work develops an accurate and efficient two-moment approximation for the queue length distribution in the M/G/1 queue. Queue length distributions can provide insight into the impact of system design changes that go beyond simple averages, but conventional queueing theory lacks efficie ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
is intractable. One limitation in the queueing theory that customized analytic models draw on, to date, is the lack of efficient, accurate calculations of the queue length distribution in the M/G/1 queue. Queue length distributions can give further insight into the impact of system design changes than mean queue
AN M/G/l QUEUE WITH FINITE POPULATION AND GATED SERVICE DISCIPLINE
, 1995
"... Abstract A queueing model with finite customer population (an M/G/l//N model), multiple server vacations and gated service policy is considered. For such a model, the steady state probabilities and the customers ' waiting time are analyzed. Numerical results for the mean waiting times are obtai ..."
Abstract
- Add to MetaCart
Abstract A queueing model with finite customer population (an M/G/l//N model), multiple server vacations and gated service policy is considered. For such a model, the steady state probabilities and the customers ' waiting time are analyzed. Numerical results for the mean waiting times
On Optimal Ordering of Service Parameters of a Coxian Queueing Model with Three Phases
, 2015
"... We analyze a Coxian stochastic queueing model with three phases. The Kolmogorov equations of this model are constructed, and limit probabilities and the stationary probabilities of customer numbers in the system are found. The performance measures of this model are obtained and in addition the optim ..."
Abstract
- Add to MetaCart
the loss probability and means waiting time minimum. We also give the loss probability in terms of mean waiting time in the system. jα is the transition probability from j-th phase to ( )-j th+ 1 phase ()j = 1,2. In this manner while =1 0α and ≥2 0α this sys-tem turns into | | |M M 1 0 queueing model
First EuroNGI Workshop: New Trends in Modelling, Quantitative Methods and Measurements Two queueing models for cable access networks
"... In this paper we will discuss two queueing models with a two-dimensional state space. The first model is an¡£¢¤¡¥¢§ ¦ queueing model with gated random order of service. In this service discipline customers are first gathered in an unordered waiting room before they are put in random order in an orde ..."
Abstract
- Add to MetaCart
In this paper we will discuss two queueing models with a two-dimensional state space. The first model is an¡£¢¤¡¥¢§ ¦ queueing model with gated random order of service. In this service discipline customers are first gathered in an unordered waiting room before they are put in random order
FEATURE ANALYSIS ON QUEUE LENGTH OF ASYMMETRIC TWO-QUEUE POLLING SYSTEM WITH GATED SERVICES *
"... On the basis of establishing mathematical model and defining the parameters and treating embedded Markov chains and probability generating function as math tools, the paper analyzed discrete-time, nonsymmetric dual-threshold service queue system precisely, and it derived first order and second order ..."
Abstract
- Add to MetaCart
On the basis of establishing mathematical model and defining the parameters and treating embedded Markov chains and probability generating function as math tools, the paper analyzed discrete-time, nonsymmetric dual-threshold service queue system precisely, and it derived first order and second
A two-queue polling model with two priority levels in the first queue
- ValueTools 2008 (Third International Conference on Performance Evaluation Methodologies and Tools
, 2008
"... In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following servi ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time distribution, the waiting times for each customer type, the joint queue length distribution at polling epochs, and the steady-state marginal queue length distributions for each customer type.
DISCRETE TIME MULTI-CLASS FEEDBACK QUEUE WITH VACATIONS AND CLOSE TIME UNDER RANDOM ORDER OF SERVICE DISCIPLINE
, 1997
"... Abstract We study a discrete-time single server priority queueing model with vacations under random order of service discipline within each class. This model captures the behavior of the head-of-line request queues in large input-buffered ATM switches. The server takes vacations when the queue has b ..."
Abstract
- Add to MetaCart
Abstract We study a discrete-time single server priority queueing model with vacations under random order of service discipline within each class. This model captures the behavior of the head-of-line request queues in large input-buffered ATM switches. The server takes vacations when the queue has
A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime
, 2002
"... Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides i ..."
Abstract
- Add to MetaCart
this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace--Stieltjes transforms and generating functions for various key variables
A NOTE ON THE RESPONSE TIME IN M/G / l QUEUES WITH SERVICE IN RANDOM ORDER AND BERNOULLI FEEDBACK
, 1994
"... Abstract We consider M/G/1 queueing systems with random order of service and Bernoulli feedback of output customers. These systems may model the aggregate queues of packets waiting for transmission in a contention-based multiaccess communication channel. We study the customer's response time de ..."
Abstract
- Add to MetaCart
Abstract We consider M/G/1 queueing systems with random order of service and Bernoulli feedback of output customers. These systems may model the aggregate queues of packets waiting for transmission in a contention-based multiaccess communication channel. We study the customer's response time
Whom You Know Matters: Venture Capital Networks and Investment Performance,
- Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract
-
Cited by 138 (8 self)
- Add to MetaCart
. 24 N+1. Unless it subsequently exited via an IPO or M&A transaction, the dependent variable is zero in the company's last recorded round. All models are estimated using panel probit estimators with random company effects. The panel is unbalanced since portfolio companies receive varying
Results 1 - 10
of
291
