LINE Solver
MATLAB API documentation
Loading...
Searching...
No Matches
sn_get_node_tput_from_tput.m
1%{ @file sn_get_node_tput_from_tput.m
2 % @brief Computes average throughputs at nodes from station throughputs
3 %
4 % @author LINE Development Team
5%}
6
7%{
8 % @brief Computes average throughputs at nodes from station throughputs
9 %
10 % @details
11 % This function calculates the average throughput at each node in steady-state
12 % from the station throughputs and node-level routing matrix.
13 %
14 % @par Syntax:
15 % @code
16 % TNn = sn_get_node_tput_from_tput(sn, TN, TH)
17 % TNn = sn_get_node_tput_from_tput(sn, TN, TH, ANn)
18 % @endcode
19 %
20 % @par Parameters:
21 % <table>
22 % <tr><th>Name<th>Description
23 % <tr><td>sn<td>Network structure
24 % <tr><td>TN<td>Average throughputs at stations
25 % <tr><td>TH<td>Throughput handles
26 % <tr><td>ANn<td>(Optional) Average arrival rates at nodes; computed if missing
27 % </table>
28 %
29 % @par Returns:
30 % <table>
31 % <tr><th>Name<th>Description
32 % <tr><td>TNn<td>Average throughputs at nodes
33 % </table>
34%}
35function TNn=sn_get_node_tput_from_tput(sn, TN, TH, ANn)
36
37I = sn.nnodes;
38C = sn.nchains;
39R = sn.nclasses;
40if nargin<4
41 ANn = sn_get_node_arvr_from_tput(sn, TN, TH);
42end
43
44TNn = zeros(I,R);
45if ~isempty(TH) && ~isempty(TN)
46 for ind=1:I
47 for c = 1:C
48 inchain = sn.inchain{c};
49 refstat = sn.refstat(c);
50 for r = inchain
51 if sn.nodetype(ind) ~= NodeType.Source
52 switch sn.nodetype(ind)
53 case NodeType.Cache
54 % For cache nodes, use actual hit/miss ratios if available
55 % instead of nodevisits which don't account for cache behavior
56 hitclass = sn.nodeparam{ind}.hitclass;
57 missclass = sn.nodeparam{ind}.missclass;
58 totalTput = sum(TN(refstat,inchain));
59
60 % Check if actual hit/miss probabilities are available in nodeparam
61 if isfield(sn.nodeparam{ind}, 'actualhitprob') && ~isempty(sn.nodeparam{ind}.actualhitprob)
62 % Use actual hit/miss probabilities from solver result
63 actualHitProb = sn.nodeparam{ind}.actualhitprob;
64 actualMissProb = sn.nodeparam{ind}.actualmissprob;
65 % Delayed hits (retrieval system) depart as the hit
66 % class, so the hit-class throughput is (true hit +
67 % delayed hit) * total arrival. Zero for plain caches.
68 if isfield(sn.nodeparam{ind}, 'actualdelayedhitprob') && ~isempty(sn.nodeparam{ind}.actualdelayedhitprob)
69 actualDelayedHitProb = sn.nodeparam{ind}.actualdelayedhitprob;
70 else
71 actualDelayedHitProb = zeros(size(actualHitProb));
72 end
73
74 % see _kb/04-networkstruct.md (api/sn/*.m derived-field helpers) for rationale
75 for origClass = 1:length(hitclass)
76 % see _kb/04-networkstruct.md (api/sn/*.m derived-field helpers) for rationale
77 if ~isempty(ANn)
78 arvTput = ANn(ind, origClass);
79 elseif any(origClass == inchain)
80 arvTput = TN(refstat, origClass);
81 else
82 arvTput = 0; % read class outside this chain
83 end
84 if hitclass(origClass) == r && origClass <= length(actualHitProb) && ~isnan(actualHitProb(origClass))
85 % This is a hit class - use hit probability
86 % (true hits plus delayed hits)
87 dh = 0;
88 if origClass <= length(actualDelayedHitProb) && ~isnan(actualDelayedHitProb(origClass))
89 dh = actualDelayedHitProb(origClass);
90 end
91 TNn(ind, r) = TNn(ind, r) + arvTput * (actualHitProb(origClass) + dh);
92 elseif missclass(origClass) == r && origClass <= length(actualMissProb) && ~isnan(actualMissProb(origClass))
93 % This is a miss class - use miss probability
94 TNn(ind, r) = TNn(ind, r) + arvTput * actualMissProb(origClass);
95 end
96 end
97 else
98 % Fallback to nodevisits-based calculation
99 if any(find(r==hitclass)) || any(find(r==missclass))
100 TNn(ind, r) = (sn.nodevisits{c}(ind,r) / sum(sn.visits{c}(sn.stationToStateful(refstat),inchain))) * totalTput;
101 end
102 end
103 end
104 end
105 end
106 end
107 end
108
109 % First, copy station throughputs directly to station nodes
110 M = sn.nstations;
111 for ist=1:M
112 ind = sn.stationToNode(ist);
113 TNn(ind,:) = TN(ist,:);
114 end
115
116 for ind=1:I
117 for c = 1:C
118 inchain = sn.inchain{c};
119 for r = inchain
120 anystateful = find(sn.visits{c}(:,r));
121 if ~isempty(anystateful)
122 if sn.nodetype(ind) ~= NodeType.Sink && sn.nodetype(ind) ~= NodeType.Join
123 for s = inchain
124 for jnd=1:I
125 switch sn.nodetype(ind)
126 case NodeType.Source
127 ist = sn.nodeToStation(ind);
128 TNn(ind, s) = TN(ist,s);
129 case NodeType.Cache
130 if ind~=jnd
131 TNn(ind, s) = TNn(ind, s) + ANn(ind, r) * sn.rtnodes((ind-1)*R+r, (jnd-1)*R+s);
132 end
133 otherwise
134 % For station nodes, throughput is already set from TN
135 % Only compute for non-station nodes (like ClassSwitch, Router)
136 % Note: nodeToStation returns NaN for non-station nodes, so use ~(>0) check
137 if ~(sn.nodeToStation(ind) > 0)
138 TNn(ind, s) = TNn(ind, s) + ANn(ind, r) * sn.rtnodes((ind-1)*R+r, (jnd-1)*R+s);
139 end
140 end
141 end
142 end
143 elseif sn.nodetype(ind) == NodeType.Join
144 for s = inchain
145 for jnd=1:I
146 if sn.nodetype(ind) ~= NodeType.Source
147 TNn(ind, s) = TNn(ind, s) + ANn(ind, r) * sn.rtnodes((ind-1)*R+r, (jnd-1)*R+s);
148 else
149 ist = sn.nodeToStation(ind);
150 TNn(ind, s) = TN(ist,s);
151 end
152 end
153 end
154 end
155 end
156 end
157 end
158 end
159 TNn(isnan(TNn)) = 0;
160else
161 TNn = [];
162end
163
164end
Definition fjtag.m:161