Spatially Distributed QueuesⅢ M/G/1 2 Servers n servers approximations
Spatially Distributed Queues II M/G/1 2 Servers N servers Approximations
M/G1 Directions Of travel 0,Y Ambulance
M/G/1 Ambulance (0,0) (0,Y0) Directions Of Travel XA YA (X0,0)
Two-Server“ Hypercube Queueing Model a Distinguishable servers a Different workloads(due to geography) a Can appear with or without queueing AWith--usually FCFS AWithout--usually means a backup contract service is in place
Two-Server “Hypercube” Queueing Model aDistinguishable servers aDifferent workloads (due to geography) aCan appear with or without queueing `With -- usually FCFS `Without -- usually means a backup contract service is in place
Poisson arrivals from any sub-region a 入(B-A)入2 B-A (4)=A1 B="Service region =x1+A2
Poisson Arrivals from any sub-region A A B-A λ ( A)= λ1 λ (B-A)= λ 2 B = “Service Region” λ = λ1+ λ 2
Balance of flow equations 1.0 0.0
Balance of Flow Equations 1,0 λ 2 µ 0,0 0,1 λ 1,1 λ µ µ λ1 µ