1function [QN,UN,RN,TN,xvec_it,QNt,UNt,TNt,xvec_t,t,iters,runtime] = solver_fluid_matrix(sn, options)
3% [QN,UN,RN,TN,CN,RUNTIME] = SOLVER_FLUID_MATRIX(QN, OPTIONS)
5% Copyright (c) 2012-2026, Imperial College London
8M = sn.nstations; %number of stations
9K = sn.nclasses; %number of
classes
12P_full = sn.rt; % Full routing matrix (stateful
nodes)
13NK = sn.njobs
'; %initial population
16S(infServers) = sum(NK);
18%refstat = sn.refstat; % reference station
21% Extract station-to-station routing matrix from stateful-to-stateful matrix
22% using stochastic complementation to resolve routing through non-station
23% stateful nodes (e.g., Router nodes)
26 isf = sn.stationToStateful(ist);
28 station_indices = [station_indices, (isf-1)*K + r];
31P = dtmc_stochcomp(P_full, station_indices);
33% Remove Sink->Source feedback routing for open classes
34% In open networks, jobs exit at Sink and should not recirculate back to Source.
35% The routing matrix includes this feedback (added by getRoutingMatrix.m for
36% pseudo-closed network analysis), but it causes incorrect flow balance in the
37% fluid ODE formulation because arrivals are already accounted for via Alambda.
39 if sn.sched(src_ist) == SchedStrategy.EXT
40 % This is a Source station - remove feedback routing TO it for open classes
42 % Check if this is an open class with external arrivals
43 if ~isnan(sn.rates(src_ist, r)) && sn.rates(src_ist, r) > 0
44 % Zero out routing TO this Source for this class from all other stations
45 src_col = (src_ist - 1) * K + r; % Column index in P for (Source, class r)
47 if from_ist ~= src_ist % Don't modify Source
's own outgoing routing
49 from_row = (from_ist - 1) * K + from_r;
50 P(from_row, src_col) = 0; % Remove feedback to Source
59% ODE building as per Ruuskanen et al., PEVA 151 (2021).
70 Psi = blkdiag(Psi,PH{ist}{r}{1});
71 B = blkdiag(B,sum(PH{ist}{r}{2},2));
72 A = blkdiag(A,pie{ist}{r}');
78% Build arrival rate vector Aλ for mixed/open networks (Ruuskanen et al., PEVA 151 (2021), Eq. 7)
79% Following the ground truth implementation: Source is conceptually excluded from state space.
80% Arrivals go directly to queue phases (not Source phases) weighted by routing probabilities.
81% This matches dx = W' * theta + A * lambda where lambda represents arrivals INTO queues.
83% First, identify Source stations and their arrival rates per
class
84source_arrivals = zeros(M, K); % source_arrivals(src, r) = arrival rate at source src
for class r
86 if sn.sched(src_ist) == SchedStrategy.EXT
88 if ~isnan(sn.rates(src_ist, r)) && sn.rates(src_ist, r) > 0
89 source_arrivals(src_ist, r) = sn.rates(src_ist, r);
95% Build Alambda: arrivals go to QUEUE phases (where jobs route from Source), not Source phases
96Alambda_full = zeros(size(A,1), 1);
100 if nphases(ist,r) > 0
101 if sn.sched(ist) == SchedStrategy.EXT
102 % Source station:
do NOT add arrivals here (arrivals go to downstream queues)
103 state = state + nphases(ist,r);
105 % Queue station: check
if it receives arrivals from any Source
106 arrival_rate_to_queue = 0;
108 if source_arrivals(src_ist, r) > 0
109 % Get routing probability from Source to
this queue
for this class
110 src_row = (src_ist - 1) * K + r;
111 queue_col = (ist - 1) * K + r;
112 routing_prob =
P(src_row, queue_col);
113 arrival_rate_to_queue = arrival_rate_to_queue + source_arrivals(src_ist, r) * routing_prob;
117 if arrival_rate_to_queue > 0
118 % Apply arrivals according to entrance probability ζ^{i,r}
119 for k=1:nphases(ist,r)
121 Alambda_full(state) = pie{ist}{r}(k) * arrival_rate_to_queue;
124 state = state + nphases(ist,r);
128 % Add placeholder
for disabled
class to match W matrix structure
130 % Alambda_full(state) stays 0 since there are no arrivals
135% remove disabled transitions
136keep = find(~isnan(sum(W,1)));
139Alambda = Alambda_full(keep); % Also filter arrival vector
141% Auto-detect extreme stiffness and enable hide_immediate proactively.
142% When W has rates spanning many orders of magnitude (e.g., 1e8 from immediate
143%
class-switching in LN layers), LSODA
's finite-difference Jacobian fails.
144% Stochastic complementation removes immediate states, reducing stiffness.
145hide_imm_explicitly_set = isfield(options.config, 'hide_immediate
');
146if hide_imm_explicitly_set
147 hide_imm_requested = options.config.hide_immediate;
149 % Auto-detect stiffness only when hide_immediate is not explicitly configured
150 hide_imm_requested = false;
151 nonZeroDiag = abs(diag(W));
152 nonZeroDiag = nonZeroDiag(nonZeroDiag > 0);
153 if ~isempty(nonZeroDiag)
154 stiffness_ratio = max(nonZeroDiag) / min(nonZeroDiag);
155 if stiffness_ratio > 1e4
156 hide_imm_requested = true;
161% Eliminate immediate transitions if requested or auto-detected
164Alambda_pre_elim = [];
166 W_pre_elim = W; % Save for Alambda correction
167 Alambda_pre_elim = Alambda;
168 [W, state_map_imm] = eliminate_immediate_matrix(W, sn, options);
171Qa = []; % state mapping to queues (called Q(a) in Ruuskanen et al.)
172SQC = zeros(M*K,0); % to compute per-class queue length at the end
173SUC = zeros(M*K,0); % to compute per-class utilizations at the end
174STC = zeros(M*K,0); % to compute per-class throughput at the end
175x0_build = []; % Build x0 with same structure as W matrix
176%x0 = []; % initial state
178init_sol_idx = 0; % Index into options.init_sol for enabled classes
182 % Add placeholder for disabled transition (matching W matrix structure)
184 Qa(1,state) = ist; %#ok<*AGROW>
185 SQC((ist-1)*K+r,state) = 0; % No queue contribution
186 SUC((ist-1)*K+r,state) = 0; % No utilization contribution
187 STC((ist-1)*K+r,state) = 0; % No throughput contribution
188 x0_build(state,1) = 0; % No initial population
190 for k=1:nphases(ist,r)
193 if isnan(sn.rates(ist,r))
194 % Class has phases but is disabled (NaN rate) -
195 % solver_fluid_initsol skips these, so do not
196 % increment init_sol_idx
197 SQC((ist-1)*K+r,state) = 0;
198 SUC((ist-1)*K+r,state) = 0;
199 STC((ist-1)*K+r,state) = 0;
200 x0_build(state,1) = 0;
202 init_sol_idx = init_sol_idx + 1;
203 SQC((ist-1)*K+r,state) = 1;
204 SUC((ist-1)*K+r,state) = 1/S(ist);
205 STC((ist-1)*K+r,state) = sum(sn.proc{ist}{r}{2}(k,:));
206 x0_build(state,1) = options.init_sol(init_sol_idx);
210 % code to initialize all jobs at ref station
212 % x0 = [x0; NK(r)*pie{i}{r}']; % initial probability of PH
214 % x0 = [x0; zeros(nphases(i,r),1)];
220% Apply keep filtering
for disabled transitions (NaN in W matrix)
227% Save full matrices before immediate elimination
for metric reconstruction
230imm_states_in_keep = []; % Indices of immediate states within keep-filtered space
232% Apply state mapping
if immediate transitions were eliminated
233if ~isempty(state_map_imm)
234 % Identify eliminated (immediate) states
235 imm_states_in_keep = setdiff(1:length(Qa), state_map_imm);
237 Qa = Qa(state_map_imm);
238 SQC = SQC(:, state_map_imm);
239 SUC = SUC(:, state_map_imm);
240 STC = STC(:, state_map_imm);
241 x0 = x0(state_map_imm);
243 % Correct Alambda
for arrivals directed at eliminated immediate states.
244 % From quasi-steady-state assumption (dx_I/dt = 0):
245 % lambda_red = lambda_T - Q_IT
' * (Q_II')^{-1} * lambda_I
246 % where T = timed states, I = immediate states.
247 lambda_T = Alambda_pre_elim(state_map_imm);
248 lambda_I = Alambda_pre_elim(imm_states_in_keep);
249 if any(lambda_I ~= 0)
250 Q_IT = W_pre_elim(imm_states_in_keep, state_map_imm);
251 Q_II = W_pre_elim(imm_states_in_keep, imm_states_in_keep);
252 Alambda = lambda_T - Q_IT' * (Q_II' \ lambda_I);
258% Build SQ matrix to compute total queue length per station in ODEs
259% SQ(s,:) sums all states at the same station as state s
261SQ = zeros(nstates, nstates);
264 SQ(s, Qa == ist) = 1; % Sum all states at the same station
267% Identify Source station states (EXT scheduler)
268% For Source stations, theta should be 0.0 to effectively bypass Source in dynamics.
269% This matches the ground truth implementation where Source
is excluded from state space.
270% Arrivals are injected directly into queue phases via Alambda.
271isSourceState = false(nstates, 1);
274 if sn.sched(ist) == SchedStrategy.EXT
275 isSourceState(s) = true;
276 x0(s) = 0; % Initialize Source phases to 0 (no mass at Source)
283timespan = options.timespan;
284itermax = options.iter_max;
285odeopt = odeset('AbsTol', tol, 'RelTol', tol, 'NonNegative', 1:length(x0));
286nonZeroRates = abs(W(abs(W)>0)); nonZeroRates=nonZeroRates(:);
287if isempty(nonZeroRates)
288 trange = [timespan(1), timespan(2)];
289 if ~isfinite(trange(2))
293 trange = [timespan(1),min(timespan(2),abs(10*itermax/min(nonZeroRates)))];
296% Check if p-norm smoothing should be used (pstar parameter)
297use_pnorm = isfield(options, 'pstar') && ~isempty(options.pstar) || ...
298 (isfield(options.config, 'pstar') && ~isempty(options.config.pstar));
301 % Get pstar values - expand scalar to per-station
array
302 if isfield(options, 'pstar') && ~isempty(options.pstar)
303 pstar_val = options.pstar;
305 pstar_val = options.config.pstar;
307 if isscalar(pstar_val)
308 pstar_val = pstar_val * ones(M, 1);
310 % Create per-phase pstar
array (pQa) using the filtered Qa mapping
311 pQa = pstar_val(Qa(:)); % Use Qa which
is already filtered by keep and state_map_imm
312 Sa_pnorm = S(Qa(:)); % Column vector for pnorm_ode
320 % p-norm smoothing ODE as per Ruuskanen et al., PEVA 151 (2021)
321 % ghat = 1 / (1 + (x/c)^p)^(1/p) where x
is queue length, c
is servers, p
is pstar
322 % dx/dt = W^T * θ̂(x,p) + Aλ (Eq. 27 for mixed networks)
323 ode_pnorm_func = @(t,x) pnorm_ode(x, W, SQ, Sa_pnorm, pQa, Alambda, isSourceState);
325 [t, xvec_t] = ode_solve_stiff(ode_pnorm_func, trange, x0, odeopt, options);
327 [t, xvec_t] = ode_solve(ode_pnorm_func, trange, x0, odeopt, options);
330 % Standard matrix method without smoothing
331 % dx/dt = W^T * θ(x) + Aλ (Eq. 12 for mixed networks)
332 Sa_ode = S(Qa(:)); % Column vector for element-wise operations
333 % Define theta function with special handling for Source stations
334 theta_func = @(x) compute_theta(x, SQ, Sa_ode, isSourceState);
336 [t, xvec_t] = ode_solve_stiff(@(t,x) W'*theta_func(x) + Alambda, trange, x0, odeopt, options);
338 [t, xvec_t] = ode_solve(@(t,x) W'*theta_func(x) + Alambda, trange, x0, odeopt, options);
342 if contains(me.identifier, 'lsoda')
349% On LSODA failure, retry with hide_immediate toggled (only once)
351 is_retry = isfield(options.config, 'lsoda_retry') && options.config.lsoda_retry;
353 options_retry = options;
354 options_retry.config.lsoda_retry = true;
355 if hide_imm_requested
356 % hide_immediate was active (auto-detected or explicit) and failed — retry without it
357 options_retry.config.hide_immediate = false;
359 % Normal solve failed — retry with hide_immediate
360 options_retry.config.hide_immediate = true;
362 [QN,UN,RN,TN,xvec_it,QNt,UNt,TNt,xvec_t,t,iters,runtime] = solver_fluid_matrix(sn, options_retry);
365 % Both attempts failed — return empty lastSol to signal failure
366 warning('lsoda:failed', 'LSODA failed on both normal and hide_immediate attempts');
371 xvec_it = {}; % empty signals failure to caller (runAnalyzer checks isempty)
375 xvec_t = zeros(1, sum(nphases(:)));
384Tmax = size(xvec_t,1);
389Sa = S(Qa(:)); % Column vector
for element-wise operations
390S = repmat(S,1,K)
'; S=S(:);
393 QNtmp{j} = zeros(K,M);
394 TNtmp{j} = zeros(K,M);
395 UNtmp{j} = zeros(K,M);
396 RNtmp{j} = zeros(K,M);
399 % Use compute_theta
for consistent handling of Source stations
400 theta_j = compute_theta(x, SQ, Sa, isSourceState);
401 TNtmp{j}(:) = STC*theta_j;
402 UNtmp{j}(:) = SUC*theta_j;
403 % Little
's law is invalid in transient so this vector is not returned
404 % except the last element as an approximation of the actual RN
405 RNtmp{j}(:) = QNtmp{j}(:)./TNtmp{j}(:);
407 QNtmp{j} = QNtmp{j}';
408 UNtmp{j} = UNtmp{j}
';
409 RNtmp{j} = RNtmp{j}';
410 TNtmp{j} = TNtmp{j}
';
412% steady state metrics
414 QNtmp{j} = QNtmp{j}(:);
415 UNtmp{j} = UNtmp{j}(:);
416 RNtmp{j} = RNtmp{j}(:);
417 TNtmp{j} = TNtmp{j}(:);
420% compute cell array with time-varying metrics for stations and classes
421QNtmp = cell2mat(QNtmp)';
422UNtmp = cell2mat(UNtmp)
';
423RNtmp = cell2mat(RNtmp)';
424TNtmp = cell2mat(TNtmp)
';
431 QNt{ist,r} = QNtmp(:,(r-1)*M+ist);
432 UNt{ist,r} = UNtmp(:,(r-1)*M+ist);
433 RNt{ist,r} = RNtmp(:,(r-1)*M+ist);
434 TNt{ist,r} = TNtmp(:,(r-1)*M+ist);
437QN = reshape(QNtmp(end,:),M,K);
438UN = reshape(UNtmp(end,:),M,K);
439RN = reshape(RNtmp(end,:),M,K);
440TN = reshape(TNtmp(end,:),M,K);
442% Set throughput at Source stations to arrival rates for open classes
443% Source stations have theta = 0 in the ODE (to bypass Source in dynamics),
444% but their throughput should equal the external arrival rate.
446 if sn.sched(ist) == SchedStrategy.EXT
448 if ~isnan(sn.rates(ist, r)) && sn.rates(ist, r) > 0
449 TN(ist, r) = sn.rates(ist, r);
455% Reconstruct throughput for eliminated immediate states using flow conservation
456if ~isempty(imm_states_in_keep)
457 % For each eliminated state, throughput = sum of incoming throughputs via routing
458 for idx = 1:length(imm_states_in_keep)
459 s = imm_states_in_keep(idx);
460 ist = Qa_full(s); % Station of this eliminated state
461 % Find which class this state belongs to
465 state_count = state_count + nphases(ist, rr);
466 if s <= sum(Qa_full == ist & (1:length(Qa_full)) <= state_count)
472 % Fallback: find class by examining STC_full
474 if STC_full((ist-1)*K+rr, s) > 0
481 % Compute incoming throughput using routing matrix P
482 % T(ist, r) = sum over all (j, l) of T(j, l) * P((j,l) -> (ist,r))
486 p_jl_ir = P((j-1)*K+l, (ist-1)*K+r);
488 incoming_tput = incoming_tput + TN(j, l) * p_jl_ir;
492 % Also add external arrivals if this is a source station
493 if sn.sched(ist) == SchedStrategy.EXT && ~isnan(sn.rates(ist, r))
494 incoming_tput = incoming_tput + sn.rates(ist, r);
496 TN(ist, r) = incoming_tput;
501xvec_it = {xvec_t(end,:)};
504function dxdt = pnorm_ode(x, W, SQ, Sa, pQa, Alambda, isSourceState)
505% PNORM_ODE - ODE derivative using p-norm smoothing
506% As per Ruuskanen et al., PEVA 151 (2021)
507% dxdt = W' * (x .* ghat) + Aλ (Eq. 27)
508% where ghat = 1 / (1 + (sumXQa/Sa)^pQa)^(1/pQa)
510sumXQa = GlobalConstants.FineTol + SQ * x;
511ghat = zeros(size(x));
516 if cVal > 0 && pVal > 0
517 ghatVal = 1.0 / (1 + (xVal / cVal)^pVal)^(1/pVal);
528% Compute effective rate (x .* ghat), with special handling
for Source stations
529theta_eff = x .* ghat;
530% For Source stations,
override to 0.0 to bypass Source in dynamics
531% (matching ground truth where Source
is excluded from state space)
532theta_eff(isSourceState) = 0.0;
534dxdt = W
' * theta_eff + Alambda;
537function theta = compute_theta(x, SQ, Sa, isSourceState)
538% COMPUTE_THETA - Compute theta vector for fluid ODE
539% For regular stations: theta = x./(SQ*x) .* min(Sa, SQ*x)
540% For Source stations (EXT scheduler): theta = 0.0
541% - Source is conceptually excluded from state space (matching ground truth)
542% - Arrivals are injected directly into queues via Alambda
543% - Setting theta = 0 prevents Source from contributing to W' * theta
545sumXQa = GlobalConstants.FineTol + SQ * x;
546theta = x ./ sumXQa .* min(Sa, sumXQa);
548% Override theta
for Source stations
549% Source stations have theta = 0.0 to bypass Source in dynamics
550theta(isSourceState) = 0.0;