Homec4science
Diffusion number_routes_multipath (master) Browse

R6360/code/matlab-code/virtualPathToInterfacePath.m
8f12ec2dec8emaster

Last Change
Raw File

virtualPathToInterfacePath.m
View Options

function [interfacePath, pathWeight_dij, pathWeight_f, maxLinkWeight] = virtualPathToInterfacePath (virtualPath, nodesInfo, neighborCapacityMat, virtualNodesWeightMatrix, numInterfaces, seed)
pathWeight_dij = 0;
pathWeight_f = 0;
maxLinkWeight = 0;
neighborWeightMat = 100./neighborCapacityMat;
if length(virtualPath) == 2 % no path between source and destination
interfacePath = [max(nodesInfo((1+virtualPath(1) - 2*numInterfaces)/2,1:2)), ...
max(nodesInfo((virtualPath(2) - 2*numInterfaces)/2, 1:2))];
else
interfacePath = [];
for i=1:length(virtualPath)
ind = virtualPath(i);
if i==1
assert(ind > 2*numInterfaces);
assert(mod(ind,2) == 1); % source node
elseif i==length(virtualPath)
assert(ind > 2*numInterfaces);
assert(mod(ind,2) == 0); % destination node
else
assert(ind <= 2*numInterfaces);
if mod(i,2) == 0
assert(mod(ind,2) == 0); % egress
assert(mod(virtualPath(i+1),2) == 1);
interface = ind/2;
next_interface = (virtualPath(i+1)+1)/2;
if any(nodesInfo(:,1) == interface)
assert(any(nodesInfo(:,1) == next_interface))
else
assert(any(nodesInfo(:,2) == interface))
assert(any(nodesInfo(:,2) == next_interface))
end
if neighborWeightMat(interface, next_interface) > maxLinkWeight
maxLinkWeight = neighborWeightMat(interface, next_interface);
end
pathWeight_dij = pathWeight_dij + neighborWeightMat(interface, next_interface);
pathWeight_f = pathWeight_f + neighborWeightMat(interface, next_interface);
else
assert(mod(ind,2) == 1); % ingress
interface = (ind+1)/2;
pathWeight_dij = pathWeight_dij + virtualNodesWeightMatrix(virtualPath(i), virtualPath(i+1)); % (not) switching cost
if i ~= 2 && i ~= (length(virtualPath)-1) % if this is not source or dest node
assert(mod(virtualPath(i+1),2) == 0);
next_interface = virtualPath(i+1)/2; % egress interface
if interface ~= next_interface % switch interface
pathWeight_f = pathWeight_f - min(virtualNodesWeightMatrix(virtualPath(i-1), virtualPath(i)), virtualNodesWeightMatrix(virtualPath(i+1), virtualPath(i+2)));
end
end
end
if isempty(interfacePath) || interfacePath(end) ~= interface
indInterface = find(interfacePath == interface, 1);
if ~isempty(indInterface)
if exist('seed', 'var') && ~isempty(seed) && seed ~= 0
disp(['loop, seed=', int2str(seed)])
end
interfacePath((indInterface+1):end) = [];
% if there is a loop, keep the weights (a switching
% cost is anyway not taken into account: weight will
% still be too small than what it should be)
else
interfacePath = [interfacePath, interface];
end
end
end
end
end
if length(interfacePath) >= 2 && interfacesSameNode(interfacePath(1), interfacePath(2), nodesInfo)
% might happen in case of loop
interfacePath = interfacePath(2:end);
end
end
c4science · Help