[Tccc] Jackson Network and Queueing Theory

Lachlan Andrew lachlan.andrew
Thu Nov 10 06:36:13 EST 2011


On 10 November 2011 21:32, Lachlan Andrew <lachlan.andrew at gmail.com> wrote:
>
> I believe Theorem 1 of this paper is flawed.

I'm struggling to understand the definition of W.  Each sample path
omega  has many waiting times, but presumably  W(omega)  is none of
those.  I don't think that  W  should really be defined on the same
probability space as the queue.  I think  W  should be defined on a
probability space whose elements are single waiting times.

I'm not sure if this is the source of the problem.

Lachlan

-- 
Lachlan Andrew? Centre for Advanced Internet Architectures (CAIA)
Swinburne University of Technology, Melbourne, Australia
<http://caia.swin.edu.au/cv/landrew>
Ph +61 3 9214 4837




More information about the TCCC mailing list