Citation map · Study

SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

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

Sojourn times and the overtaking condition in Jacksonian networks

3 references·16 citing·37 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
1981The Distribution of Queuing Network States at Input and Output Instants262 cited
1957Waiting Times When Queues are in Tandem222 cited

Cited by

1983Sojourn times in closed queueing networks79 cited
1982The Heavy Traffic Diffusion Approximation for Sojourn Times in Jackson Networks57 cited
1982Passage times for overtake-free paths in Gordon–Newell networks55 cited
1987On sojourn time in Jackson networks of queues50 cited
1984The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues50 cited
1984The amount of overtaking in a network of queues45 cited
1990Laplace transform inversion and passage-time distributions in Markov processes44 cited
1981Flows in Queueing Networks: A Martingale Approach44 cited
1984Numerical Computation of Sojourn-Time Distributions in Queuing Networks44 cited
1993Queueing networks with dependent nodes and concurrent movements34 cited
1983Networks of queues in discrete time30 cited
1982Moment Formulae for a Class of Mixed Multi-Job-Type Queueing Networks

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

30 cited

1987Sojourn times in queuing networks with multiserver modes29 cited

1993Travel and Sojourn Times in Stochastic Networks23 cited

1986Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem22 cited

1984Burke's theorem on passage times in Gordon–Newell networks21 cited