Java NodeLinkAssignation.vlm方法代码示例

import vnreal.algorithms.utils.NodeLinkAssignation; //导入方法依赖的package包/类
private boolean performLinkMapping(SubstrateNetwork sNet, SubstrateNode srcSnode,
		SubstrateNode dstSnode, VirtualLink vLink) {
	// Search for path in filtered substrate using
	// KShortestPaths
	LinkWeight linkWeight = new LinkWeight();
	Yen<SubstrateNode, SubstrateLink> kshortestPaths = new Yen<SubstrateNode, SubstrateLink>(sNet,
			linkWeight);

	// get the k shortest paths to the dstSnode in
	// increasing order of weight
	List<List<SubstrateLink>> paths = kshortestPaths.getShortestPaths(
			srcSnode, dstSnode, 20);
	List<SubstrateLink> mappedPath = null;
	for (List<SubstrateLink> path : paths) {

		// Verify if the path fulfills the demand
		if (NodeLinkAssignation.verifyPath(vLink, path, srcSnode, sNet)) {
			// If the path has been verified, the path is
			// chosen if not,
			// the following shortest path is verified
			mappedPath = path;
			break;
		}
	}
	paths.clear();
	// if a path fulfilling the demand has been chosen, link
	// mapping is performed
	if (mappedPath != null) {
		// Perform virtual link mapping (VLM) for each link in
		// the path.
		if (!NodeLinkAssignation.vlm(vLink, mappedPath, sNet, srcSnode)) {
			throw new AssertionError("But we checked before!");
		}
	} else {// Not path available, link mapping can not be
		// performed
		return false;
	}

	return true;
}
 

import vnreal.algorithms.utils.NodeLinkAssignation; //导入方法依赖的package包/类
private boolean performLinkMapping(SubstrateNode srcSnode,
		SubstrateNode dstSnode, VirtualLink vLink) {
	// Search for path in filtered substrate using
	// KShortestPaths
	LinkWeight linkWeight = new LinkWeight();
	EppsteinAlgorithm kshortestPaths = new EppsteinAlgorithm(sNet,
			linkWeight);

	// get the k shortest paths to the dstSnode in
	// increasing order of weight
	List<List<SubstrateLink>> paths = kshortestPaths.getShortestPaths(
			srcSnode, dstSnode, 20);
	List<SubstrateLink> mappedPath = null;
	for (List<SubstrateLink> path : paths) {

		// Verify if the path fulfills the demand
		if (NodeLinkAssignation.verifyPath(vLink, path, srcSnode, sNet)) {
			// If the path has been verified, the path is
			// chosen if not,
			// the following shortest path is verified
			mappedPath = path;
			break;
		}
	}
	paths.clear();
	// if a path fulfilling the demand has been chosen, link
	// mapping is performed
	if (mappedPath != null) {
		// Perform virtual link mapping (VLM) for each link in
		// the path.
		if (!NodeLinkAssignation.vlm(vLink, mappedPath, sNet, srcSnode)) {
			throw new AssertionError("But we checked before!");
		}
	} else {// Not path available, link mapping can not be
		// performed
		return false;
	}

	return true;
}
 

import vnreal.algorithms.utils.NodeLinkAssignation; //导入方法依赖的package包/类
/**
  * Algorithm with the k-Shortest path implementation of virtual link mapping
  * (hops is taken as the metric)
  */
 @Override
 protected boolean linkMapping(VirtualNetwork vNet,
                               Map<VirtualNode, SubstrateNode> nodeMapping) {
     this.processedLinks = 0;
     this.mappedLinks = 0;

     // Search for path in filtered substrate using KShortestPaths
     LinkWeight linkWeight = new LinkWeight();
     EppsteinAlgorithm kshortestPaths = new EppsteinAlgorithm(sNet,
             linkWeight);

     // Iterate all VirtualLinks on the current VirtualNetwork
     for (VirtualLink tVLink : vNet.getEdges()) {
         processedLinks++; // increase number of processed.

         // Find the source and destiny of the current VirtualLink (tmpl)
         VirtualNode srcVnode = vNet.getSource(tVLink);
         VirtualNode dstVnode = vNet.getDest(tVLink);

         // Find their mapped SubstrateNodes
         final SubstrateNode sNode = nodeMapping.get(srcVnode);
         final SubstrateNode dNode = nodeMapping.get(dstVnode);

         // Get current VirtualLink demand
         for (AbstractDemand dem : tVLink) {
             if (dem instanceof BandwidthDemand) {
                 // System.out.println("   DemandedBandwidth: "
                 // + bwDem.getDemandedBandwidth());
             }
         }

         // get the k shortest paths to the dstSnode in increasing order of
         // weight
         List<List<SubstrateLink>> paths = kshortestPaths.getShortestPaths(
                 sNode, dNode, k);
         int ind2 = 0;

/*
          * If source and destination substrate node are different, in any
 * other case, the virtual link demand will not be mapped because
 * the link is created between the same node.
 */
         if (!sNode.equals(dNode)) {
             for (List<SubstrateLink> path : paths) {

                 // Verify if the path fulfills the demand
                 if (!NodeLinkAssignation.verifyPath(tVLink, path, sNode,
                         sNet)) {

                     // Current path cannot fulfill the VirtualLink or the
                     // Hidden Hop Demand... Lets check another
                     ind2 = 1;
                 } else {
                     // Perform virtual link mapping (VLM) for each link in
                     // the path.
                     if (!NodeLinkAssignation.vlm(tVLink, path, sNet, sNode))
                         throw new AssertionError("But we checked before!");

                     mappedLinks++;
                     ind2 = 0;
                     break;
                 }
             }
             // if there are no paths fulfilling the demand.
             if (ind2 == 1) {
                 processedLinks = vNet.getEdges().size();
                 return false;
             }
         } else {
             // FIXME Hidden hops demand will be applied?
         }
     }
     return true;
 }
 

import vnreal.algorithms.utils.NodeLinkAssignation; //导入方法依赖的package包/类
/**
 * Algorithm with the k-Shortest path implementation of virtual link mapping
 * (hops is taken as the metric)
 */
@Override
protected boolean linkMapping(VirtualNetwork vNet,
		Map<VirtualNode, SubstrateNode> nodeMapping) {
	this.processedLinks = 0;
	this.mappedLinks = 0;

	// Search for path in filtered substrate using KShortestPaths
	LinkWeight linkWeight = new LinkWeight();
	EppsteinAlgorithm kshortestPaths = new EppsteinAlgorithm(sNet,
			linkWeight);

	// Iterate all VirtualLinks on the current VirtualNetwork
	for (VirtualLink tVLink : vNet.getEdges()) {
		processedLinks++; // increase number of processed.

		// Find the source and destiny of the current VirtualLink (tmpl)
		VirtualNode srcVnode = vNet.getSource(tVLink);
		VirtualNode dstVnode = vNet.getDest(tVLink);

		// Find their mapped SubstrateNodes
		final SubstrateNode sNode = nodeMapping.get(srcVnode);
		final SubstrateNode dNode = nodeMapping.get(dstVnode);

		// Get current VirtualLink demand
		for (AbstractDemand dem : tVLink) {
			if (dem instanceof BandwidthDemand) {
				// System.out.println("   DemandedBandwidth: "
				// + bwDem.getDemandedBandwidth());
			}
		}

		// get the k shortest paths to the dstSnode in increasing order of
		// weight
		List<List<SubstrateLink>> paths = kshortestPaths.getShortestPaths(
				sNode, dNode, k);
		int ind2 = 0;

		/*
		 * If source and destination substrate node are different, in any
		 * other case, the virtual link demand will not be mapped because
		 * the link is created between the same node.
		 */
		if (!sNode.equals(dNode)) {
			for (List<SubstrateLink> path : paths) {

				// Verify if the path fulfills the demand
				if (!NodeLinkAssignation.verifyPath(tVLink, path, sNode,
						sNet)) {

					// Current path cannot fulfill the VirtualLink or the
					// Hidden Hop Demand... Lets check another
					ind2 = 1;
				} else {
					// Perform virtual link mapping (VLM) for each link in
					// the path.
					if (!NodeLinkAssignation.vlm(tVLink, path, sNet, sNode))
						throw new AssertionError("But we checked before!");

					mappedLinks++;
					ind2 = 0;
					break;
				}
			}
			// if there are no paths fulfilling the demand.
			if (ind2 == 1) {
				processedLinks = vNet.getEdges().size();
				return false;
			}
		} else {
			// FIXME Hidden hops demand will be applied?
		}
	}
	return true;
}