论文信息 - Recursive solutions for discrete time queues with applications to high speed switching

Recursive solutions for discrete time queues with applications to high speed switching

Fast recursive solutions for the equilibrium state probabilities of discrete time queuing systems are presented. A form of boundary balancing is used to arrive at their solutions. Cases examined include the Geom/Geom/K/N queue, a queue with a varying number of servers and the Manhattan Street metropolitan area network.

Thomas G. Robertazzi | Xinyuan Huang

[1] N. F. Maxemchuk,et al. Regular mesh topologies in local and metropolitan area networks , 1985, AT&T Technical Journal.

[2] Thomas G. Robertazzi,et al. Recursive computation of steady-state probabilities of nonproduct form queueing networks associated with computer network models , 1990, IEEE Trans. Commun..

[3] T. G. Robertazzi,et al. Performance evaluation of the Manhattan street network with input buffers , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .

[5] Mischa Schwartz,et al. Telecommunication networks: protocols, modeling and analysis , 1986 .

[6] Maxemchuk. The Manhattan street network , 1985 .

[7] A. A. Lazar,et al. Deflection strategies for the Manhattan Street network , 1991, ICC 91 International Conference on Communications Conference Record.