Simulation run lengths to estimate blocking probabilities

No abstract is available for this paper.

• Publication year

  1996

• Venue

  TOMC

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/229493.229496
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction to probability models

  1998influential reference
• Multiservice Loss Models for Broadband Telecommunication Networks

  1997cited by this paper
• Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model

  1995cited by this paper
• Traffic modeling for high-speed networks: theory versus practice

  1995cited by this paper
• Applications of Fractals in Engineering for Realistic Traffic Processes

  1994cited by this paper
• Wide-area traffic: the failure of Poisson modeling

  1994cited by this paper
• Elements Of Queueing Theory

  1994cited by this paper
• Estimating Customer and Time Averages

  1993cited by this paper
• The BMAP/G/1 QUEUE: A Tutorial

  1993cited by this paper
• Networks of infinite-server queues with nonstationary Poisson input

  1993cited by this paper
• The Physics of the Mt/G/∞ Queue

  1993cited by this paper
• Monte Carlo Summation Applied to Product-Form Loss Networks

  1992influential reference
• Asymptotic Formulas for Markov Processes with Applications to Simulation

  1992cited by this paper
• The Brownian approximation for rate-control throttles and the G/G/1/C queue

  1992cited by this paper
• The Asymptotic Efficiency of Simulation Estimators

  1992cited by this paper
• Queueing Simulation in Heavy Traffic

  1992cited by this paper
• Asymptotic variance parameters for the boundary local times of reflected Brownian motion on a compact interval

  1992cited by this paper
• The efficiency of one long run versus independent replication in steady-state simulation

  1991cited by this paper
• A new view of the heavy-traffic limit theorem for infinite-server queues

  1991cited by this paper
• A review ofL=λW and extensions

  1991cited by this paper
• On Arrivals That See Time Averages

  1990cited by this paper
• Structured Stochastic Matrices of M/G/1 Type and Their Applications

  1989influential reference
• Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue

  1989cited by this paper
• Indirect Estimation Via L = λW

  1989cited by this paper
• Planning queueing simulations

  1989cited by this paper
• Validating the heavy traffic performance of regenerative simulation

  1989cited by this paper
• The transient behavior in erlang's model for large trunk groups and various traffic conditions

  1987cited by this paper
• The asymptotic variance of a time average in a birth-death process

  1987influential reference
• Heavy-traffic approximations for service systems with blocking

  1984cited by this paper
• Asymptotic methods in queuing theory

  1984cited by this paper
• On the heavy-traffic limit theorem for GI/G/∞ queues

  1982influential reference
• Poisson Arrivals See Time Averages

  1982cited by this paper
• Statistical Results on Control Variables with Application to Queueing Network Simulation

  1982influential reference
• On the Markov property of the GI/G/∞ Gaussian limit

  1982influential reference
• Introduction to the Theory of Queues.

  1982cited by this paper
• Heavy-Traffic Limits for Queues with Many Exponential Servers

  1981cited by this paper
• Comparing counting processes and queues

  1981cited by this paper
• Note-Simple Inequalities for Multiserver Queues

  1980cited by this paper
• Conservation equations and variance reduction in queueing simulations

  1977cited by this paper
• The Theory Of Stochastic Processes

  1977cited by this paper
• Stochastic processes in queueing theory

  1976cited by this paper
• Some properties of the erlang loss function

  1974cited by this paper
• Efficient estimators for simulated queueing systems

  1974influential reference
• Introduction to Probability Models, Eighth Edition

  1972cited by this paper
• Convergence of Probability Measures

  1970cited by this paper
• On limit laws for service processes in multi-channel systems

  1967cited by this paper
• Stochastic Service Systems.

  1964cited by this paper
• Introduction to the Theory of Queues.

  1963cited by this paper
• Introduction to the Theory of Queues

  1963cited by this paper
• The covariance function of a simple trunk group, with applications to traffic measurement

  1961cited by this paper
• The BMAP / G / l QUEUE : A Tutorial *

  year unknowninfluential reference

• On the Ergodic Properties and Invariant Measure of a Two-Dimensional Reflected Ornstein–Uhlenbeck Process

  2025cites this paper
• Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection

  2018cites this paper
• Analysis of Resource Sharing Between MBB and MTC Sessions with Data Aggregation Using Matrix-Analytic Methods and Simulation

  2018cites this paper
• Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection

  2018cites this paper
• Creating Work Breaks from Available Idleness

  2018cites this paper
• Spare Parts Inventory Management Literature and Direction Towards the Use of Data Mining Technique: A Review

  2018cites this paper
• Many‐server loss models with non‐poisson time‐varying arrivals

  2017cites this paper
• A note on the central limit theorem for the idleness process in a one‐sided reflected Ornstein–Uhlenbeck model

  2016influential citation
• An overview on inverse first-passage-time problems for one-dimensional di↵usion processes

  2016cites this paper
• How Hard are Steady-State Queueing Simulations?

  2015cites this paper
• Power of d Choices for Large-Scale Bin Packing

  2015cites this paper
• Limit theorems for Markov-modulated and reflected diffusion processes

  2015cites this paper
• A Complete Bibliography of ACM Transactions on Modeling and Computer Simulation

  2015cites this paper
• Hitting time in Erlang loss systems with moving boundaries

  2014cites this paper
• One-Dimensional Reflected Diffusions with Two Boundaries and an Inverse First-Hitting Problem

  2014cites this paper
• Valuing Capacity in Queueing Systems

  2013cites this paper
• On the time-dependent moments of Markovian queues with reneging

  2013cites this paper
• Statistical Analysis with Little's Law

  2013cites this paper
• Limit theorems for reflected Ornstein–Uhlenbeck processes

  2013cites this paper
• On the Generalized Drift Skorokhod Problem in One Dimension

  2013influential citation
• The Generalized Drift Skorokhod Problem in One Dimension : Its solution and application to the GI / GI / 1 + GI and M / M / N / N transient distributions

  2012influential citation
• On the time-dependent moments of Markovian queues with reneging

  2012cites this paper
• Differentiating the performance of systems more reliably

  2010cites this paper
• The Stationary Distributions of Two Classes of Reflected Ornstein–Uhlenbeck Processes

  2009cites this paper
• Rare event simulation for a slotted time M/G/s model

  2009cites this paper
• Technical Note - Approximating Vehicle Dispatch Probabilities for Emergency Service Systems with Location-Specific Service Times and Multiple Units per Location

  2009cites this paper
• Queueing Networks for Vertical Handover

  2009cites this paper
• Uniform Design over Convex Input Regions with Applications to Complex Queueing Models

  2008cites this paper
• Relations in the Central Limit Theorem Version of the Response Time Law

  2007cites this paper
• Closed G-networks with Resets: product form solution

  2007cites this paper
• Martingale proofs of many-server heavy-traffic limits for Markovian queues ∗

  2007influential citation
• Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters

  2006cites this paper
• Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters

  2006cites this paper
• Chapter 13 Analysis for Design

  2006cites this paper
• Network security transmission based on bimatrix game theory

  2006cites this paper
• Heavy-Traffic Limits for the G/H2*/n/mQueue

  2005influential citation
• ANALYSIS FOR THE DESIGN OF SIMULATION EXPERIMENTS

  2005influential citation
• On the transition densities for reflected diffusions

  2005cites this paper
• Impacts of data call characteristics on multi-service CDMA system capacity

  2005cites this paper
• Heavy-Traffic Limits for the G / H ∗ 2 / n / m Queue Ward Whitt

  2005influential citation
• A Diffusion Approximation for the G/GI/n/m Queue

  2004influential citation
• Properties of the Reflected Ornstein–Uhlenbeck Process

  2003influential citation
• AD iffusion Approximation for aM arkovian Queue with Reneging

  2003cites this paper
• A Diffusion Approximation for a Markovian Queue with Reneging

  2003cites this paper
• STOCHASTIC MODELS FOR THE DESIGN AND MANAGEMENT OF CUSTOMER CONTACT CENTERS : SOME RESEARCH DIRECTIONS

  2002cites this paper
• A Methodology for Characterization and Performance Analysis of Connection-Based Network Access Technologies

  2001cites this paper
• Diffusion approximations for a single node accessed by congestion-controlled sources

  2000cites this paper
• An Introduction to Numerical Transform Inversion and Its Application to Probability Models

  2000influential citation
• Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users

  1999cites this paper
• On the rates of convergence of Erlang's model

  1999cites this paper
• Control of Communication Networks

  1999cites this paper
• Variance Reduction in Simulations of Loss Models

  1999cites this paper
• Resource Sharing for Book-Ahead and Instantaneous-Request Calls Using a CLT Approximation

  1999cites this paper
• Calculating transient characteristics of the erlang loss model by numerical transform inversion

  1998cites this paper
• Diiusion Approximations for Models of Congestion Control in High-speed Networks

  1998cites this paper
• Diffusion approximations for models of congestion control in high-speed networks

  1998cites this paper
• Transient behavior of real-time self-similar sources and its impact on best-effort traffic

  1998cites this paper
• VERIFYING CELL LOSS REQUIREMENTS IN HIGH-SPEED COMMUNICATION NETWORKS

  1998cites this paper
• VERIFYING CELL LOSS REQUIREMENTSIN HIGH-SPEED COMMUNICATION

  1998cites this paper
• Simulation In Research And Research In Simulation: A Telecommunications Perspective

  1997cites this paper
• KEYNOTE ADDRESS: SI& ULATION IN RESEARCH AND RESEARCH IN SIMULATION: 1 A TELECOMMUNICATIONS PERSPECTIVE

  1997cites this paper