Thumbnail
Access Restriction
Subscribed

Author Cheng, William C. ♦ Muntz, Richard R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Balance equation ♦ Closed network ♦ Clustering ♦ Error bound ♦ Product-form ♦ Quasi-reversibility ♦ Queuing network
Abstract Product-form queuing network models have been widely used to model systems with shared resources such as computer systems (both centralized and distributed), communication networks, and flexible manufacturing systems. Closed multichain product-form networks are inherently more difficult to analyze than open networks, due to the effect of normalization. Results in workload characterization for closed networks in the literature are often for networks having special structures and only specific performance measures have been considered.In this article, we drive certain properties (insensitivity of conditional state probability distributions and fractional-linearity of Markov reward functions) for a broad class of closed multichain product-form networks. These properties are derived using the most basic flow balance conditions of product-form networks. Then we show how these basic properties can be applied in obtaining error bounds when similar customers are clustered together to speed up computation.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 4
Page Count 29
Starting Page 641
Ending Page 669


Open content in new tab

   Open content in new tab
Source: ACM Digital Library