Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Revisiting stochastic loss networks

12 references·1 citing·35 second hop

FromToDepth

this work references cited by second hop

References

1961A Proof for the Queuing Formula: L = λ W2,777 cited
1991Loss Networks601 cited
1986Blocking probabilities in large circuit-switched networks577 cited
1985Stochastic Models of Computer Communication Systems355 cited
1985Blocking When Service Is Required From Several Facilities Simultaneously293 cited
1961A PROOF OF THE QUEUING FORMULA259 cited
1984Insensitivity of blocking probabilities in a circuit-switching network163 cited
1999Order-Fulfillment Performance Measures in an Assemble-to-Order System with Stochastic Leadtimes162 cited
1989On critically loaded loss networks52 cited
2006The Erlang model with non-poisson call arrivals46 cited
1989Limit theorems for loss networks with diverse routing40 cited
1998On the Inverse of Erlang's Function30 cited

Cited by

2009Improved approximations for the Erlang loss model14 cited

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