Homec4science
Diffusion number_routes_multipath (master) Browse

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

Last Change
Raw File

mappingMultigraphToVirtualGraph_neg.m
View Options

function [virtualNodesWeightMatrix] = mappingMultigraphToVirtualGraph_neg(nodesInfo, neighborWeightMat, CSC_type, hop_count_metric)
if ~exist('CSC_type', 'var') || isempty(CSC_type)
CSC_type = 'min';
end
if ~exist('hop_count_metric', 'var') || isempty(hop_count_metric)
hop_count_metric = 0;
end
numInterfaces = size(neighborWeightMat,1);
numNodes = size(nodesInfo,1);
numVirtualNodes = 2*numInterfaces + 2*numNodes; % 2 virtual nodes per interface: ingress and egress
% 2 virtual nodes per node: source and destination
virtualNodesWeightMatrix = realmax*ones(numVirtualNodes);
% in virtualNodesWeightMatrix, for interface i, 2*i-1 is ingress, 2*i is egress;
% for node i, 2*numInterfaces + 2*i - 1 is source; 2*numInterfaces + 2*i is destination
for i=1:numNodes
switching_cost = realmax;
for interface =1:2
interfaceInd = nodesInfo(i,interface);
if nodesInfo(i,interface) > 0
neighbors = find(neighborWeightMat(interfaceInd,:) < realmax);
for iN=1:length(neighbors)
indN = neighbors(iN);
% real weight between two nodes (egress node A -> ingress node B)
virtualNodesWeightMatrix(2*interfaceInd, 2*indN - 1) = neighborWeightMat(interfaceInd,indN);
end
% compute minimum of weights
switch CSC_type
case 'max'
linkWeightsThisInterface = sort(neighborWeightMat(interfaceInd,neighbors), 'descend');
if isempty(linkWeightsThisInterface)
linkWeightsThisInterface = realmax;
end
case 'min'
linkWeightsThisInterface = sort(neighborWeightMat(interfaceInd,:), 'ascend');
case 'avg-half'
linkWeightsThisInterface = sort(neighborWeightMat(interfaceInd,neighbors), 'ascend');
if isempty(linkWeightsThisInterface)
linkWeightsThisInterface = realmax;
else
linkWeightsThisInterface = mean(linkWeightsThisInterface(1:floor((length(linkWeightsThisInterface)+1)/2)));
end
case 'no'
linkWeightsThisInterface = 0;
end
switching_cost = min(linkWeightsThisInterface(1), switching_cost);
virtualNodesWeightMatrix(2*interfaceInd - 1, 2*interfaceInd) = hop_count_metric; % not switching cost is 0
% ingress interface -> destination node (weight 0)
virtualNodesWeightMatrix(2*interfaceInd - 1, 2*numInterfaces + 2*i) = 0;
% source node -> egress interface (weight 0)
virtualNodesWeightMatrix(2*numInterfaces + 2*i - 1, 2*interfaceInd) = 0;
end
end
if nodesInfo(i,1) > 0 && nodesInfo(i,2) > 0
% negative weight for switching: ingress interface 1 -> egress interface 2
% and ingress interface 2 -> egress interface 1
virtualNodesWeightMatrix(2*nodesInfo(i,1) - 1, 2*nodesInfo(i,2)) = -switching_cost + hop_count_metric;
virtualNodesWeightMatrix(2*nodesInfo(i,2) - 1, 2*nodesInfo(i,1)) = -switching_cost + hop_count_metric;
end
end
end
c4science · Help