Queueing networks with dependent nodes and concurrent movements

  title={Queueing networks with dependent nodes and concurrent movements},
  author={Richard F. Serfozo},
  journal={Queueing Syst.},
Classical queueing network processes are useful for modeling the movement of discrete units in a network in which the nodes operate independently, the routing of units is independent of the congestion, only one unit moves at a time and its equilibrium distribution is a well-understood product form. Actual networks, however, typically have dependent nodes and concurrent movement of units. Imagine the dependencies associated with the network movements of telephone calls, manufacturing material… CONTINUE READING
10 Citations
31 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 31 references

Travel and sojourn times in stochastic networks , to appear in Ann

  • J. McKenna
  • Appl . Prob .
  • 1993

Queueing networks with state - dependent routing

  • D. F. Towsley
  • Reversibility and compound birthdeath and…
  • 1992

Cyclic queueing systems with restricted queue lengths

  • G. F. NeweU
  • J . Appl . Prob .
  • 1991

Stochastic discrete flow networks: diffusion approximations and bottlenecks

  • H. Chen, A. Mandelbaum
  • Ann. Prob. 19
  • 1991
1 Excerpt


  • A. Brandt
  • Franken and B. Lisek, Stationary Stochastic…
  • 1990
1 Excerpt

Equilibrium behavior of Markovian network processes

  • R. F. Serfozo
  • 1989

Sojourn times in queueing networks

  • O. J. Boxma, H. Daduna
  • in: Stochastic Analysis of Computer and…
  • 1989

Similar Papers

Loading similar papers…