Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

M(sub t)/G/infinity queues with sinusoidal arrival rates

Article Abstract:

Congestion peaks, lags and ranges are analyzed in an M(sub)t/G/infinity queuewherein the mean number of busy servers is a function of time with sinusoidal arrival rates arising from a nonhomogeneous Poisson distribution arrival process. Such a process implies that the full distribution per period is characterized by its mean. Analysis indicates that peak arrival rates are lagged by peak congestion, while congestion range is much samller than the range of offered load. Application of a linear operator to the arrival rate function represents an image of the mean function. Pointwise stationary and polynomial approximations for the mean number of busy servers are investigated in order to apply the results to Fourier series-treated general periodic arrival rate problems. These results are applicable to queue models wherein lost or delayed customers are experienced.

Author: Whitt, Ward, Eick, Stephen G., Massey, William A.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1993
File servers, Queues (Computers), Queues (Data management)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Planning queueing simulations

Article Abstract:

The estimation of the required length of the run of a simulation is a major problem in the planning of simulation experiments addressing the estimation of steady-state quantities related to queueing models. Simple heuristic formulas for one-run queueing simulations can be applied to the design of queueing experiments to aid in approximating queue lengths. The formulas are based on queues with heavy traffic limits and can be applied to stochastic processes reflecting Brownian motion, including the queue process in a standard GI/G/1 model. The formulas can be used to approximate the length of the simulation run in each application of an experiment.

Author: Whitt, Ward
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
Analysis, Management research, Computer simulation, Queuing theory

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA



Subjects list: Research
Similar abstracts:
  • Abstracts: The pointwise stationary approximation for M(sub.t)/M(sub.t)/s queues is asymptotically correct as the rates increase
  • Abstracts: The pointwise stationary approximation for queues with nonstationary arrivals. A queueing system with auxiliary servers
  • Abstracts: Determinants of management forecast precision. The market interpretation of management earnings forecasts as a predictor of subsequent financial analyst forecast revision
  • Abstracts: Intel stock falls 7% on worries over chip sales. FTC investigation of Intel appears to be near end
  • Abstracts: IBM ventures to Hollywood in visual effects. The creative edge: nurturing high-tech talent requires a delicate balancing act. But the payoff can be huge
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.