SERIE RE5EHRCH mEmORMlDII PRODUCT FORMS FOR QUEUEING NETWORKS WITH LIMITED CLUSTERS
نویسنده
چکیده
Queueing networks are considered with limited station clusters. A general characterization is given, in terms of local solutions of state dependent traffic equations, from which the existence and structure of a product form can be concluded. This characterization leads to new product form examples such as with a weak reversible cluster routing or a non-reversible routing both within and in between limited station clusters, as extensively illustrated. Key-words Cluster, blocking, product form, invariance condition, non-revers ible routing.
منابع مشابه
SERIE RE5EHRCH mEmORRRDR
Bias terms of Markov reward structures are shown to play a key-role to conclude error bound or monotonicity results for steady state measures when dealing with approximate systems such as due to . perturbations . finite truncations . system modifications, or . system comparisons (bounds) The results are illustrated by a non-product form queueing network example with practical phenomena as block...
متن کاملSERIE RESEARCH mEmORMlDfl PRODUCT FORMS FOR QUEUEING NETWORKS WITH STATE DEPENDENT MULTIPLE JOB TRANSITIONS
متن کامل
Serie Re5ehrch Rieriorrhdr a Simple Performability Estimate for Jackson Networks with an Unreliable Output Channel
This paper provides a simple performance estimate with an explicit error bound for open Jackson networks with departure blocking such as due to an output channel with breakdowns.
متن کاملSERIE RESEARCH mEITlORBnun "STOP = RECIRCULATE" FOR EXPONENTIAL PRODUCT FORM QUEUEING NETWORKS WITH DEPARTURE BLOCKING
The blocking protocols of "stopping service" and of "recirculating" jobs through an entire system are shown to be equivalent for Jacksonian queueing networks with blocked departures. Queueing networks * product-form * stopping and recirculating blocking protocol •* partial balance.
متن کامل