qncsvisits
Compute the mean number of visits to the service centers of a single class, closed network with service centers.
INPUTS
P(i,j) probability that a request which completed service at center
is routed to center ( matrix).
For closed networks it must hold that sum(P,2)==1. The
routing graph must be strongly connected, meaning that each node
must be reachable from every other node.
r Index of the reference station, ;
Default r=1. The traffic equations are solved by
imposing the condition V(r) = 1. A request returning to
the reference station completes its activity cycle.
OUTPUTS
V(k)average number of visits to service center , assuming as the reference station.
P = [0 0.3 0.7; ...
1 0 0 ; ...
1 0 0 ];
V = qncsvisits(P)
V =
1.0000 0.3000 0.7000
|