한국통계학회:학술대회논문집 (Proceedings of the Korean Statistical Society Conference)
- 한국통계학회 2000년도 추계학술발표회 논문집
- /
- Pages.109-113
- /
- 2000
Bounds on the Overflow Probability in Jackson Networks
초록
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 the stronger logarithmic limit than that in Glasserman and Kou(1995) when several nodes have the same maximal load.