SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stochastic Models of Computer Communication Systems
3 references·9 citing·31 second hop
Stochastic Models of Computer Communication Systems (1985)Stochastic Models of Computer Communicati…Analysis and Synthesis of Computer Systems (2010)Analysis and Synthesis of Com…Blocking probabilities in large circuit-switched networks (1986)Blocking probabilities in lar…Hitting-time and occupation-time bounds implied by drift analysis with applications (1982)Hitting-time and occupation-t…Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime (2019)Economies-of-Scale in Many-Se…Network adiabatic theorem (2009)Network adiabatic theoremRevisiting stochastic loss networks (2008)Revisiting stochastic loss ne…Markov random field models of multicasting in tree networks (2002)Markov random field models of…Allocation of interdependent resources for maximal throughput (2000)Allocation of interdependent …Loss networks and Markov random fields (1999)Loss networks and Markov rand…An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models (1995)An algorithm to compute block…Optimal Control and Trunk Reservation in Loss Networks (1990)Optimal Control and Trunk Res…Limit theorems for loss networks with diverse routing (1989)Limit theorems for loss netwo…The stability of a queue with non-independent inter-arrival and service times (1962)Annals of operations research (1989)Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1992)Compensating for Failures with Flexible Servers (2007)DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES (2007)A Push–Pull Network with Infinite Supply of Work (2009)Computational algorithms for closed queueing networks with exponential servers (1973)Loss Networks (1991)Insensitivity of blocking probabilities in a circuit-switching network (1984)Applying a New Device in the Optimization of Exponential Queuing Systems (1975)Optimal control of admission to a quenching system (1985)An introduction to large deviations for communication networks (1995)Applications of Markov Decision Processes in Communication Networks (2002)Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources (2009)Blocking in a Shared Resource Environment (1981)An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates (1995)Calculating normalization constants of closed queueing networks by numerically inverting their generating functions (1995)Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources (1995)Blocking When Service Is Required From Several Facilities Simultaneously (1985)A critically loaded multiclass Erlang loss system (1991)Stochastic Theory of a Data-Handling System with Multiple Sources (1982)The power of two choices in randomized load balancing (2001)Telephone Call Centers: Tutorial, Review, and Research Prospects (2003)Operational Research: methods and applications (2023)G-networks by triggered customer movement (1993)Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic (2000)On the Efficiency-Fairness Trade-off (2012)Optimal control of two interacting service stations (1984)Extremal Splittings of Point Processes (1985)Adversarial queuing theory (2001)Algorithms to determine exact blocking probabilities for multirate tree networks (1990)
this work references cited by second hop

References

  • 1986Blocking probabilities in large circuit-switched networks577 cited
  • 2010Analysis and Synthesis of Computer Systems467 cited
  • 1982Hitting-time and occupation-time bounds implied by drift analysis with applications420 cited

Cited by

  • 1990Optimal Control and Trunk Reservation in Loss Networks101 cited
  • 1995An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models82 cited
  • 2000Allocation of interdependent resources for maximal throughput71 cited
  • 2019Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime61 cited
  • 1989Limit theorems for loss networks with diverse routing40 cited
  • 2002Markov random field models of multicasting in tree networks34 cited
  • 1999Loss networks and Markov random fields31 cited
  • 2009Network adiabatic theorem26 cited
  • 2008Revisiting stochastic loss networks23 cited

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