Evaluación de Algoritmos de Ruteamiento Multipunto en Redes de ...

adjacentNodes();
adjacen->next();
pk))) ||
nodePtr() != ndd) adjacen =
//chequea la capacidad de los links
if (((fn == PEAK) && (adjacen->peak() linkCapacity() * ADMITRATIO) -
((fn == AVERAGE) && (adjacen->average()
((adjacen->linkCapacity() * ADMITRATIO) -
//CostLCMatrix va almacenando el costo de
//pto pto de fuenteDKS a cada nodo
CostLCMatrix[v] = CostLCMatrix[u] +
//'desde' es un arreglo que indica el
//(por la ruta pto a pto).
desde[v] = u;
///////////INICIO///////CASO ALCANCE//////////////// (Steiner restringido a retardo)
// Find the maximum minimum delay of all dest nodes;
// Important for making routing policy;
double maxMinDelayBC = 0.0;
switch (heuristica) {
case ANCHOBANDA:
//nada
break;
case ALCANCE:
for (int ur = 0; ur < num; ur ++) {
if (flagDestin2[ur] == 1) {
if (CostLCMatrix[ur] > maxMinDelayBC)
maxMinDelayBC = CostLCMatrix[ur];
};
};
if (maxMinDelayBC > DELAYBOUND) {
delete [] pAgreg;
delete [] Entra0;
delete [] Entra1;
delete [] UltEntra;
delete [] flagDestin;
//delete [] temp;
//delete [] temp1;
//delete [] temp2;
delete [] CostAdj;
delete [] Contribucion;
delete [] desde;
delete [] CostMatrixBC;
delete [] flagDestin2;
delete [] CostLCMatrix;
delete [] pVisitedBC;
return (DBVIOL);
}
break;
case SALTOS:
//nada
break;
case DISTVIRTUAL:
//nada
break;
};
108