SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A unified method to analyze overtake free queueing systems
16 references·0 citing·36 second hop
A unified method to analyze overtake free queueing systems (1996)A unified method to analyze overtake free…Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences (2010)Elements of Queueing Theory: …Structured Stochastic Matrices of M/G/1 Type and Their Applications. (1991)Structured Stochastic Matrice…A review ofL=?W and extensions (1991)A review ofL=?W and extensionsA new view of the heavy-traffic limit theorem for infinite-server queues (1991)A new view of the heavy-traff…On Arrivals That See Time Averages (1990)On Arrivals That See Time Ave…On Arrivals That See Time Averages (1990)On Arrivals That See Time Ave…A single-server queue with server vacations and a class of non-renewal arrival processes (1990)A single-server queue with se…Stochastic Modeling and the Theory of Queues (1989)Stochastic Modeling and the T…A distributional form of Little's Law (1988)A distributional form of Litt…Symmetric queues served in cyclic order (1985)Symmetric queues served in cy…Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations (1985)Stochastic Decompositions in …A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times (1985)A note on stochastic decompos…Queueing systems, Vol. I: Theory (1977)Queueing systems, Vol. I: The…Introduction to the Theory of Queues. (1963)Introduction to the Theory of…Introduction to the Theory of Queues (1963)Introduction to the Theory of…A Proof for the Queuing Formula: L = λ W (1961)A Proof for the Queuing Formu…Poisson Arrivals See Time Averages (1982)The Distributional Little's Law and Its Applications (1995)Multi-Server Queueing Systems with Multiple Priority Classes (2005)Operational Research: methods and applications (2023)Pseudo-conservation laws in cyclic-service systems (1987)Queuing analysis of polling models (1988)Polling systems: applications, modeling, and optimization (1990)An introduction to queueing theory (1993)A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance (1986)Queueing systems with vacations ? A survey (1986)New results on the single server queue with a batch markovian arrival process (1991)Marked point processes as limits of Markovian arrival streams (1993)Traffic modeling for telecommunications networks (1994)The Batch Markovian Arrival Process: A Review and Future Work (2001)Utilization of Idle Time in an M / G /1 Queueing System (1975)Queues and Point Processes. (1985)Queueing Systems with Service Interruptions (1986)An MX/G/1 queueing system with a setup period and a vacation period (2000)The M/G/1 retrial queue with Bernoulli schedules and general retrial times (2002)Asymptotic results for multiplexing subexponential on-off processes (1999)The supremum of a negative drift random walk with dependent heavy-tailed steps (2000)Analysis, Design, and Control of Queueing Systems (2002)Simulation Run Length Control in the Presence of an Initial Transient (1983)Models for analysis of packet voice communications systems (1986)A survey on retrial queues (1987)An Equilibrium Queuing Model of Bribery (1985)An exploration towards a production theory and its application to construction (2000)How to improve R&D productivity: the pharmaceutical industry's grand challenge (2010)Feature Article: Optimization for simulation: Theory vs. Practice (2002)Statistical Analysis of a Telephone Call Center (2005)Simulation modeling for analysis (2010)A General Class of Bulk Queues with Poisson Input (1967)Stochastic Processes for Insurance and Finance (1999)Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System (2007)Risk theory in a Markovian environment (1989)The Markov-modulated Poisson process (MMPP) cookbook (1993)
this work references cited by second hop

References

  • 1961A Proof for the Queuing Formula: L = λ W2,777 cited
  • 1989Stochastic Modeling and the Theory of Queues1,605 cited
  • 1991Structured Stochastic Matrices of M/G/1 Type and Their Applications.996 cited
  • 1963Introduction to the Theory of Queues.961 cited
  • 1985Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations621 cited
  • 1990A single-server queue with server vacations and a class of non-renewal arrival processes535 cited
  • 1977Queueing systems, Vol. I: Theory405 cited
  • 2010Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences354 cited
  • 1991A review ofL=?W and extensions132 cited
  • 1985A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times127 cited
  • 1991A new view of the heavy-traffic limit theorem for infinite-server queues108 cited
  • 1990On Arrivals That See Time Averages107 cited
  • 1963Introduction to the Theory of Queues100 cited
  • 1988A distributional form of Little's Law89 cited
  • 1990On Arrivals That See Time Averages89 cited
  • 1985Symmetric queues served in cyclic order

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

87 cited

Cited by

No citing works inside the corpus for this window.