主 题: On customer flows in Jackson networks
报告人: 夏爱华 教授 (The University of Melbourne)
时 间: 2009-12-14 16:00 - 17:00
地 点: 理科一号楼 1418
Melamed's theorem states that for a Jackson network, the equilibrium
flow along a link follows Poisson distribution if and only if no customers
can travel along the link more than once. Barbour and Brown (1996)
considered the Poisson approximate version of Melamed's theorem by
allowing the customers a small probability $p$ of travelling along the
link more than once. In this talk, I'll demonstrate that the
equilibrium customer flow process can be represented as a Poisson cluster
process and it is always over-dispersed (that is, the variance is always greater than the
mean). We also establish a general approximate version of Melamed's theorem accommodating all
possible cases of $0\le p<1$. (The talk is based on a joint work with Sen Tan).
