Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
In the last two decades there has been special interest in queueing networks with a product form solution. These have been widely used as models of computer systems and communication networks. Two new computational algorithms for product form networks are presented. A comprehensive treatment of these algorithms and the two important existing algorithms, convolution and mean value analysis, is given. © 1980, ACM. All rights reserved.
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
G. Ramalingam
Theoretical Computer Science
Pradip Bose
VTS 1998