Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions

4 references·16 citing·29 second hop

FromToDepth

this work references cited by second hop

References

1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers2,411 cited
1957Networks of Waiting Lines1,215 cited
1967Closed Queuing Systems with Exponential Servers670 cited
1977Queueing systems, Vol. I: Theory405 cited

Cited by

1978Buffer Management in a Packet Switch140 cited
1983Sharing Memory Optimally115 cited
1995Optimal buffer sharing109 cited
1995An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models82 cited
1989MEM for arbitrary queueing networks with multiple general servers and repetitive-service blocking58 cited
1995An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates56 cited
1984On the Design of Optimal Policy for Sharing Finite Buffers53 cited
1982Queueing network models of packet switching networks part 2: Networks with population size constraints41 cited
1995Efficiently Providing Multiple Grades of Service with Protection Against Overloads in Shared Resources40 cited
1992Computational algorithms for blocking probabilities in circuit-switched networks34 cited
1980Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies

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

33 cited

1999Optimal buffer management policies for shared-buffer ATM switches32 cited

2002Optimal buffer sharing24 cited

1996Computation and optimization methods for multiresource queues17 cited

1984The Behavior of a Finite Queue with Batch Poisson Inputs Resulting from Message Packetization and a Synchronous Server16 cited

1984The Application of the Residue Theorem to the Study of a Finite Queue with Batch Poisson Arrivals and Synchronous servers16 cited