On the correlation structure of closed queueing networks

被引:3
|
作者
Daduna, H
Szekli, R
机构
[1] Univ Hamburg, Dept Math, D-20146 Hamburg, Germany
[2] Univ Wroclaw, Inst Math, PL-50384 Wroclaw, Poland
关键词
Gordon-Newell network; cyclic queues; product form; sojourn times; cycle times; association; negative association; point process; palm measure;
D O I
10.1081/STM-120028388
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Closed networks of exponential queues are prototypes of systems which show strong negative dependence properties. We use the device of a test customer traveling in the network to evaluate the qualitative behavior of the network's correlation. The results are: negative association of successive sojourn times during a cycle; negative correlation of two successive cycle times; feedback-sojourn times are positively associated; correlation between cycles vanishes over long distances geometrically fast. Generalizations to networks with general topology are given. Additionally we prove for cyclic networks that the conditional cycle time stochastically increases when the initial joint queue length vector increases with respect to the partial sum ordering. This connects the space-time correlation with space-time monotonicity.
引用
下载
收藏
页码:1 / 29
页数:29
相关论文
共 50 条