SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Algorithms for an irreducible and lumpable strong stochastic bound
4 references·1 citing·16 second hop
Algorithms for an irreducible and lumpable strong stochastic bound (2004)Algorithms for an irreducible and lumpabl…A space priority queuing mechanism for multiplexing ATM channels (1990)A space priority queuing mech…Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models (1986)Computable Bounds for Conditi…Comparison Methods for Queues and Other Stochastic Models. (1986)Comparison Methods for Queues…Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues…Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems (2012)Comparing Markov Chains: Aggr…Decomposability: Queueing and Computer System Applications (1977)Finite Capacity Queuing Systems with Applications in Computer Modeling (1978)Bounds for quasi-lumpable Markov chains (1994)Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach (1995)Queueing networks with blocking (2003)Loss Networks (1991)Elements of Queueing Theory (2003)Assortment Planning: Review of Literature and Industry Practice (2008)Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Stability, queue length, and delay of deterministic and stochastic queueing networks (1994)Optimal Investment Policies for a Firm With a Random Risk Process: Exponential Utility and Minimizing the Probability of Ruin (1995)A finite buffer two class queue with different scheduling and push-out schemes (1992)Queueing system with multiple delay and loss priorities for ATM networks (2001)Numerical Queueing Analysis of Loss Priority for Large Buffer in Atm Networks (2002)Blocking When Service Is Required From Several Facilities Simultaneously (1985)Marked point processes as limits of Markovian arrival streams (1993)
this work references cited by second hop

References

  • 1986Comparison Methods for Queues and Other Stochastic Models.938 cited
  • 1984Comparison Methods for Queues and Other Stochastic Models720 cited
  • 1990A space priority queuing mechanism for multiplexing ATM channels76 cited
  • 1986Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models68 cited

Cited by

  • 2012Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems18 cited

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