SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources
14 references·3 citing·33 second hop
Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources (1995)Efficiently Providing Multiple Grades of …An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates (1995)An inversion algorithm to com…An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models (1995)An algorithm to compute block…Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue (1994)Multidimensional Transform In…Erlang capacity and uniform approximations for shared unbuffered resources (1994)Erlang capacity and uniform a…Loss Networks (1991)Loss NetworksOn 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…Algorithms to determine exact blocking probabilities for multirate tree networks (1990)Algorithms to determine exact…Blocking When Service Is Required From Several Facilities Simultaneously (1985)Blocking When Service Is Requ…Heavy-Traffic Approximations for Service Systems With Blocking (1984)Heavy-Traffic Approximations …On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements (1983)On the Steady-State Distribut…Blocking in a Shared Resource Environment (1981)Blocking in a Shared Resource…A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky Traffics (1981)A Unified Approximate Evaluat…Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions (1980)Analysis of Shared Finite Sto…RESOURCE POOLING AND STAFFING IN CALL CENTERS WITH SKILL-BASED ROUTING (2004)RESOURCE POOLING AND STAFFING…A Partially-Blocking Queueing System with CBR/VBR and ABR/UBR Arrival Streams (2002)A Partially-Blocking Queueing…An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models (1994)An algorithm to compute block…Introduction to the Theory of Queues. (1963)Stochastic analysis of a single server retrial queue with general retrial times (1999)Optimal capital structure and endogenous default (2002)A General Framework for Pricing Asian Options Under Markov Processes (2015)Heavy-Traffic Limits for Queues with Many Exponential Servers (1981)Poisson Arrivals See Time Averages (1982)The Queueing Network Analyzer (1983)Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model (1995)A Transform-Free Approximation for the Finite Capacity M/G/s Queue (1996)Heavy Traffic Limits for Queues with Many Deterministic Servers (2004)Computational algorithms for closed queueing networks with exponential servers (1973)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Introduction to Queueing Theory and Stochastic Teletraffic Models (2013)Point Processes and Queues (1981)Applied Probability and Queues (1987)Markovian network processes: Congestion-dependent routing and processing (1989)Stochastic Modeling and the Theory of Queues (1989)Rate conservation laws: A survey (1994)Networks of Waiting Lines (1957)Closed Queuing Systems with Exponential Servers (1967)Buffer Management in a Packet Switch (1978)Sharing Memory Optimally (1983)Optimal buffer sharing (1995)A new technique for analyzing large traffic systems (1986)Effective bandwidths at multi-class queues (1991)Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources (1998)Stochastic Differential Equations: Theory and Applications. (1976)MULTI-DIMENSIONAL DIFFUSION PROCESSES (1980)Optimal Control and Trunk Reservation in Loss Networks (1990)Improving Service by Informing Customers About Anticipated Delays (1999)Chaoticity on path space for a queueing network with selection of the shortest queue among several (2000)Modeling product-form state-dependent systems with BPP traffic (2009)Networks of infinite-server queues with nonstationary Poisson input (1993)
this work references cited by second hop

References

  • 1981Blocking in a Shared Resource Environment998 cited
  • 1991Loss Networks601 cited
  • 1985Blocking When Service Is Required From Several Facilities Simultaneously293 cited
  • 1980Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions218 cited
  • 1994Multidimensional Transform Inversion with Applications to the Transient M/G/1 Queue138 cited
  • 1983On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements117 cited
  • 1994Erlang capacity and uniform approximations for shared unbuffered resources110 cited
  • 1990On Arrivals That See Time Averages107 cited
  • 1984Heavy-Traffic Approximations for Service Systems With Blocking99 cited
  • 1990On Arrivals That See Time Averages89 cited
  • 1990Algorithms to determine exact blocking probabilities for multirate tree networks88 cited
  • 1995An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models82 cited
  • 1981A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky Traffics77 cited
  • 1995An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates56 cited

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

Cited by

  • 1994An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models15 cited
  • 2002A Partially-Blocking Queueing System with CBR/VBR and ABR/UBR Arrival Streams13 cited
  • 2004RESOURCE POOLING AND STAFFING IN CALL CENTERS WITH SKILL-BASED ROUTING12 cited