SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky Traffics
5 references·6 citing·30 second hop
A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky Traffics (1981)A Unified Approximate Evaluation of Conge…An introduction to queueing theory (1993)An introduction to queueing t…The Interrupted Poisson Process As An Overflow Process (1973)The Interrupted Poisson Proce…Introduction to Queueing Theory (1973)Introduction to Queueing Theo…Introduction to Congestion Theory in Telephone Systems. (1962)Introduction to Congestion Th…Introduction to Congestion Theory in Telephone Systems. (1961)Introduction to Congestion Th…Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources (1995)Efficiently Providing Multipl…Approximating the heterogeneous fluid queue with a birth-death fluid queue (1995)Approximating the heterogeneo…An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates (1995)An inversion algorithm to com…Overflow analysis for finite waiting room systems (1990)Overflow analysis for finite …The Uses of Kosten's Systems in the Provisioning of Alternate Trunk Groups Carrying Heterogeneous Traffic (1983)The Uses of Kosten's Systems …An Approximate Formula for Individual Call Losses in Overflow Systems (1983)An Approximate Formula for In…Blocking in a Shared Resource Environment (1981)Blocking When Service Is Required From Several Facilities Simultaneously (1985)Loss Networks (1991)Blocking probabilities in large circuit-switched networks (1986)Control and recovery from rare congestion events in a large multi-server system (1997)Modelling of state-dependent multirate systems carrying BPP traffic (2008)Queueing Systems Volume 1: Theory. (1976)Approximating a Point Process by a Renewal Process, I: Two Basic Methods (1982)Poisson Arrivals See Time Averages (1982)Stochastic Theory of a Data-Handling System with Multiple Sources (1982)Stochastic theory of a fluid model of producers and consumers coupled by a buffer (1988)Analysis of separable Markov-modulated rate models for information-handling systems (1991)Heavy-tailed asymptotics for a fluid model driven by an queue (2007)A Proof for the Queuing Formula: L = λ W (1961)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Heavy-Traffic Limits for Queues with Many Exponential Servers (1981)Point Processes and Queues (1981)Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations (1985)Queueing analysis: A foundation of performance evaluation (1995)The multiple phase service network with generalized processor sharing (1979)Queueing Networks: A Survey of Their Random Processes (1985)A Diffusion Approximation for a Markovian Queue with Reneging (2003)Queueing Models for Computer Communications System Analysis (1977)The BMAP/G/1 queue: A tutorial (2005)Approximate blocking probabilities in loss models with independence and distribution assumptions relaxed (2013)The Effects of Competition and Regulation on Hospital Bed Supply and the Reservation Quality of the Hospital (1980)Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands (2001)Proof of a Convexity Property of the Erlang B Formula (1972)On the continued Erlang loss function (1986)Analysis, Design, and Control of Queueing Systems (2002)
this work references cited by second hop

References

  • 1993An introduction to queueing theory906 cited
  • 1973Introduction to Queueing Theory254 cited
  • 1973The Interrupted Poisson Process As An Overflow Process252 cited
  • 1962Introduction to Congestion Theory in Telephone Systems.229 cited
  • 1961Introduction to Congestion Theory in Telephone Systems.141 cited

Cited by

  • 1995An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates56 cited
  • 1995Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources40 cited
  • 1983An Approximate Formula for Individual Call Losses in Overflow Systems23 cited
  • 1990Overflow analysis for finite waiting room systems20 cited
  • 1995Approximating the heterogeneous fluid queue with a birth-death fluid queue18 cited
  • 1983The Uses of Kosten's Systems in the Provisioning of Alternate Trunk Groups Carrying Heterogeneous Traffic17 cited

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