SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Interpolation Approximations of Sojourn Time Distributions
14 references·0 citing·46 second hop
Interpolation Approximations of Sojourn Time Distributions (1991)Interpolation Approximations of Sojourn T…Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis (1992)Reflected Brownian Motion in …The QNET method for two-moment analysis of open queueing networks (1990)The QNET method for two-momen…A network of priority queues in heavy traffic: One bottleneck station (1990)A network of priority queues …Open Queueing Systems in Light Traffic (1989)Open Queueing Systems in Ligh…An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue (1989)An Interpolation Approximatio…Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks (1988)Light Traffic Limits of Sojou…An Interpolation Approximation for Queueing Systems with Poisson Input (1988)An Interpolation Approximatio…An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals (1986)An Asymptotic Analysis of a Q…Response-Time Distribution for a Processor-Sharing System (1985)Response-Time Distribution fo…Priority Queues with Feedback (1984)Priority Queues with FeedbackAsymptotic Analysis of a Queueing Model With Bursty Traffic (1983)Asymptotic Analysis of a Queu…On the Distribution of Multidimensional Reflected Brownian Motion (1981)On the Distribution of Multid…Waiting Time Distributions for Processor-Sharing Systems (1970)Waiting Time Distributions fo…A Single-Server Queue with Feedback (1963)A Single-Server Queue with Fe…A Simple Proof of: L = λW (1967)The Queue M/G/1 With Feedback to Lower Priority Queues (1967)A multiclass feedback queue in heavy traffic (1988)Oscillations and chaos in a flow model of a switching system (1991)Approximating a Point Process by a Renewal Process, I: Two Basic Methods (1982)Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues (1984)The semi-markovian queue: theory and applications (1990)Computational methods in risk theory: A matrix-algorithmic approach (1992)An introduction to queueing theory (1993)Networks of Waiting Lines (1957)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Brownian Motion and Stochastic Flow Systems. (1987)Towards better multi-class parametric-decomposition approximations for open queueing networks (1994)Existence and Uniqueness of Semimartingale Reflecting Brownian Motions in Convex Polyhedrons (1996)Service system structure (2000)Time-shared Systems (1967)The sojourn-time distribution in the M/G/1 queue by processor sharing (1984)Processor-sharing queues: Some progress in analysis (1987)Sojourn time asymptotics in the M/G/1 processor sharing queue (2000)Jobshop-Like Queueing Systems (1963)The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks (1982)A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types (1991)Jobshop-Like Queueing Systems (2004)Long time asymptotics for constrained diffusions in polyhedral domains (2006)Waiting Times When Queues are in Tandem (1957)On Approximate Computer System Models (1975)Extensions of infinitesimal perturbation analysis (1988)Diffusion approximations for queues with server vacations (1990)Analysis and Synthesis of Computer Systems (2010)The Queueing Network Analyzer (1983)Open Queueing Networks in Heavy Traffic (1984)Introduction to Queueing Networks (1987)Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant (1993)Validity of heavy traffic steady-state approximations in generalized Jackson networks (2006)Queueing Theory for Semiconductor Manufacturing Systems: A Survey and Open Problems (2007)Mathematical Theory of Connecting Networks and Telephone Traffic (1966)Approximations of the Mean Waiting Time in an M/G/s Queueing System (1979)Matrix-Geometric Solutions to Stochastic Models (1984)On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method (1992)Call admission and routing in multi-service loss networks (1994)Interpolation approximations for symmetric Fork-Join queues (1994)Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes (1984)Queueing Networks: A Survey of Their Random Processes (1985)Mathematical problems in the theory of shared-processor systems (1992)Processor-sharing models for integrated-services networks (2000)The equivalence between processor sharing and service in random order (2003)
this work references cited by second hop

References

  • 1963A Single-Server Queue with Feedback256 cited
  • 1970Waiting Time Distributions for Processor-Sharing Systems236 cited
  • 1992Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis167 cited
  • 1981On the Distribution of Multidimensional Reflected Brownian Motion118 cited
  • 1989Open Queueing Systems in Light Traffic111 cited
  • 1990The QNET method for two-moment analysis of open queueing networks109 cited
  • 1985Response-Time Distribution for a Processor-Sharing System78 cited
  • 1986An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals70 cited
  • 1984Priority Queues with Feedback64 cited
  • 1988An Interpolation Approximation for Queueing Systems with Poisson Input62 cited
  • 1989An Interpolation Approximation for the Mean Workload in a GI/G/1 Queue58 cited
  • 1990A network of priority queues in heavy traffic: One bottleneck station32 cited
  • 1988Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks29 cited
  • 1983Asymptotic Analysis of a Queueing Model With Bursty Traffic25 cited

Cited by

No citing works inside the corpus for this window.

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