|
|
|
Registro 1 de 2, Base de información BIBCYT |
|
|
|
 Información de existencia
|
Palabras Claves: 
ASYMPTOTICS,
JACKSON NETWORK,
OVERFLOW PROBABILITY |
|
Resumen
We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maximal load. |
|
|
|
Registro 2 de 2, Base de información BIBCYT |
|
|
|
|
Información de existencia
|
Palabras Claves:
ARRIVAL THEORE,
CYCLE TIME DISTRIBUTION,
CYCLIC NETWORKS,
JACKSON NETWORKS,
OUTPUT PROCESS |
|
Resumen
Using the arrival theorem
together with elementary facts regarding integrated tail distributions and
length-biased sampling we obtain closed form expressions for the inter-output
time and the cycle time distribution in cyclic, single-class Jackson networks. Corresponding expressions
for the normalization constant and the throughput are also obtained.
|
