Uses of Class
be.ac.ulg.montefiore.run.totem.domain.exception.NodeNotFoundException

Packages that use NodeNotFoundException
at.ftw.repository.reopt   
be.ac.ulg.montefiore.run.totem.domain.model This package holds the model for the domain package. 
be.ac.ulg.montefiore.run.totem.domain.model.impl This package holds classes which are the implementation of the model for the domain package. 
be.ac.ulg.montefiore.run.totem.domain.simplifiedDomain This package holds classes that represent a simplified view of a Domain object. 
be.ac.ulg.montefiore.run.totem.repository.allDistinctRoutes This package holds classes which allow you to compute all the distinct routes. 
be.ac.ulg.montefiore.run.totem.repository.CSPF This package holds CSPF-related classes (various implementations of the CSPF algorithm is available). 
be.ac.ulg.montefiore.run.totem.repository.MplsRouting This package holds an implementation of an MPLS LSP fullmesh optimal MIP model 
be.ac.ulg.montefiore.run.totem.repository.MultiCommodityFlow This package holds an implementation of the multi-commodity flow algorithm. 
be.ac.ulg.montefiore.run.totem.repository.SAMTE.candidatepathlist   
be.ac.ulg.montefiore.run.totem.topgen.traffic This package holds traffic generation-related classes. 
be.ac.ulg.montefiore.run.totem.topgen.util This package holds util classes for Topgen. 
be.ac.ulg.montefiore.run.totem.trafficMatrix.facade This package holds the manager for the trafficMatrix package. 
be.ac.ulg.montefiore.run.totem.trafficMatrix.model This package holds the model for the trafficMatrix package. 
be.ac.ulg.montefiore.run.totem.trafficMatrix.model.impl This package holds the implementation of the model for the trafficMatrix package. 
be.ac.ulg.montefiore.run.totem.trafficMatrix.persistence This package holds classes used to load/save traffic matrices. 
test This package holds JUnit test classes. 
 

Uses of NodeNotFoundException in at.ftw.repository.reopt
 

Methods in at.ftw.repository.reopt that throw NodeNotFoundException
 TotemActionList<SetLspReservationAction> FTWReopt.calculateInitialSolution(Domain domain, TrafficMatrix tm, int profit, int changeCost)
           
 void FTWReopt.createDataFile(Domain domain, TrafficMatrix tm, int profit, int changeCost, boolean isInitialDataFile)
           
 void LSPGeneration.generateLSP(int ASID, int nbParallelPath)
          Generate a fullmesh of nbParallelPath disjoint LSPs between each nodes of the domain ASID.
 TotemActionList<SetLspReservationAction> FTWReopt.reopt(Domain domain, TrafficMatrix tm, int profit, int changeCost)
           
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.domain.model
 

Methods in be.ac.ulg.montefiore.run.totem.domain.model that throw NodeNotFoundException
 void Domain.addLink(Link link)
          Add a link to the domain
 void Path.createPathFromLink(java.util.List<Link> path)
          Create a Path from a list of Link
 void Path.createPathFromNode(java.util.List<Node> path)
          Create a Path from a list of Node
 void DomainValidator.forceConnected()
          Removes nodes and links that are not in the connected set of maximum size so that the graph is connected.
 void DomainValidator.forceDuplexConnected()
          Checks that all the nodes of the topology have at least an outlink and an inlink.
 void DomainValidator.forceLoopFree()
          This method removes all the loops present in the topology.
 java.util.List<Link> Node.getAllInLink()
          Return the list of the links that ends at this node.
 java.util.List<Link> Node.getAllOutLink()
          Return the list of the links that begins at this node.
 NodeInterface Link.getDstInterface()
           
 Node Link.getDstNode()
           
 java.util.List<Link> Node.getInLink()
          Return the list of the links that ends at this node and for which status is UP.
 Link Domain.getLinkBetweenNodes(java.lang.String srcNodeId, java.lang.String srcIfId, java.lang.String dstNodeId, java.lang.String dstIfId)
          Returns the link between srcNode and dstNode and using the specified interfaces.
 Link Domain.getLinkFrom(java.lang.String nodeId, java.lang.String nodeInterfaceId)
          Returns the link connecting the given interface on the given source node.
 java.util.List<Link> Domain.getLinksBetweenNodes(Node srcNode, Node dstNode)
          Get the list of the UP links between srcNode and dstNode and a empty list if there is no links.
 java.util.List<Link> Domain.getLinksBetweenNodes(java.lang.String srcNodeId, java.lang.String dstNodeId)
          Get the list of the UP links between srcNode and dstNode and a empty list if there is no links.
 Link Domain.getLinkTo(java.lang.String nodeId, java.lang.String nodeInterfaceId)
          Returns the link connecting the given interface on the given destination node.
 Node Domain.getNode(java.lang.String id)
          Get the node of the specified id
 java.lang.String DomainConvertor.getNodeId(int id)
          Convert a int node id in a String node id
 int DomainConvertor.getNodeId(java.lang.String id)
          Convert a String node id in a int node id
 java.util.List<Link> Node.getOutLink()
          Return the list of the links that begins at this node and for which status is UP.
 Link Domain.getReverseLink(Link link)
          Returns the reverse link for link link.
 java.util.List<Link> Domain.getReverseLinks(Link link)
          Returns the list of reverse links for link link.
 java.util.List<Link> Domain.getReverseLinks(java.lang.String linkId)
          Returns the list of reverse links for link linkId.
 NodeInterface Link.getSrcInterface()
           
 Node Link.getSrcNode()
           
 boolean DomainValidator.isConnected()
          Checks if the graph is connected.
 boolean DomainValidator.isDualConnected()
          Check if there exist at least two link coming into and going out of each node.
 boolean DomainValidator.isDuplexConnected()
          Checks that all the nodes of the topology have at least an outlink and an inlink.
 boolean DomainValidator.isLoopFree()
          This method return true if the domain contains NO loop links.
 boolean DomainValidator.isMultiGraph()
          Check if multiple links exists
 void Domain.removeNode(Node node)
          Remove a node from the domain.
 void DomainConvertor.removeNodeId(java.lang.String nodeId)
          Remove the conversion for the node nodeId
 void Link.setDstInterface(java.lang.String dstInterfaceId)
           
 void Link.setSrcInterface(java.lang.String srcInterfaceId)
           
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.domain.model.impl
 

Methods in be.ac.ulg.montefiore.run.totem.domain.model.impl that throw NodeNotFoundException
 void DomainImpl.addLink(Link link)
          Add a link to the domain
 void PathImpl.createPathFromLink(java.util.List<Link> path)
          Create a Path from a list of Link
 void PathImpl.createPathFromNode(java.util.List<Node> path)
          Create a Path from a list of Node
 void DomainValidatorImpl.forceConnected()
          Removes nodes and links that are not in the connected set of maximum size so that the graph is connected.
 void DomainValidatorImpl.forceDuplexConnected()
          Checks that all the nodes of the topology have at least an outlink and an inlink.
 void DomainValidatorImpl.forceLoopFree()
          This method removes all the loops present in the topology.
 java.util.List<Link> NodeImpl.getAllInLink()
          Return the list of the links that ends at this node.
 java.util.List<Link> NodeImpl.getAllOutLink()
          Return the list of the links that begins at this node.
 NodeInterface LinkImpl.getDstInterface()
          Returns the interface of the destination node used by this link.
 Node LinkImpl.getDstNode()
          Returns the destination node.
 java.util.List<Link> NodeImpl.getInLink()
          Return the list of the links that ends at this node and for which status is UP.
 Link DomainImpl.getLinkBetweenNodes(java.lang.String srcNodeId, java.lang.String srcIfId, java.lang.String dstNodeId, java.lang.String dstIfId)
          Returns the link between srcNode and dstNode and using the specified interfaces.
 Link DomainImpl.getLinkFrom(java.lang.String nodeId, java.lang.String nodeInterfaceId)
          Returns the link connecting the given interface on the given source node.
 java.util.List<Link> DomainImpl.getLinksBetweenNodes(Node srcNode, Node dstNode)
          Get the list of the UP links between srcNode and dstNode and a empty list if there is no links.
 java.util.List<Link> DomainImpl.getLinksBetweenNodes(java.lang.String srcNodeId, java.lang.String dstNodeId)
          Get the list of the UP links between srcNode and dstNode and a empty list if there is no links.
 Link DomainImpl.getLinkTo(java.lang.String nodeId, java.lang.String nodeInterfaceId)
          Returns the link connecting the given interface on the given destination node.
 Node DomainImpl.getNode(java.lang.String id)
          Get the node of the specified id
 java.lang.String DomainConvertorImpl.getNodeId(int id)
          Convert a int node id in a String node id
 int DomainConvertorImpl.getNodeId(java.lang.String id)
          Convert a String node id in a int node id
 java.util.List<Link> NodeImpl.getOutLink()
          Return the list of the links that begins at this node and for which status is UP.
 Link DomainImpl.getReverseLink(Link link)
          Returns the reverse link for link link.
 java.util.List<Link> DomainImpl.getReverseLinks(Link link)
          Returns the list of reverse links for link link.
 java.util.List<Link> DomainImpl.getReverseLinks(java.lang.String linkId)
          Returns the list of reverse links for link linkId.
 NodeInterface LinkImpl.getSrcInterface()
          Returns the interface of the source node used by this link.
 Node LinkImpl.getSrcNode()
          Returns the source node.
 boolean DomainValidatorImpl.isConnected()
          Checks if the graph is connected.
 boolean DomainValidatorImpl.isDualConnected()
          Check if there exist at least two link coming into and going out of each node.
 boolean DomainValidatorImpl.isDuplexConnected()
          Checks that all the nodes of the topology have at least an outlink and an inlink.
 boolean DomainValidatorImpl.isLoopFree()
          This method return true if the domain contains NO loop links.
 boolean DomainValidatorImpl.isMultiGraph()
          Check if multiple links exists
 void DomainImpl.removeNode(Node node)
          Remove a node from the domain.
 void DomainConvertorImpl.removeNodeId(java.lang.String nodeId)
          Remove the conversion for the node nodeId
 void LinkImpl.setDstInterface(java.lang.String dstInterfaceId)
          Sets the destination interface.
 void LinkImpl.setSrcInterface(java.lang.String srcInterfaceId)
          Sets the source interface.
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.domain.simplifiedDomain
 

Methods in be.ac.ulg.montefiore.run.totem.domain.simplifiedDomain that throw NodeNotFoundException
 Path SimplifiedPath.convert(Domain domain)
           
 int[] SimplifiedDomain.getInLinks(int nodeId)
          Get all the input links of a node
 int[] SimplifiedDomain.getOutLinks(int nodeId)
          Get all the output links of a node
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.repository.allDistinctRoutes
 

Methods in be.ac.ulg.montefiore.run.totem.repository.allDistinctRoutes that throw NodeNotFoundException
 java.util.List<SimplifiedPath> ComputeAllDistinctPath.compute(int srcNode, int dstNode, int maxDepth)
          Compute all distinct routes from a source to a destination with maxDepth maximum route length.
 void AllDistinctRoutes.computeAllDistinctRoute(SimplifiedDomain domain, int maxDepth)
          Compute all the distinct routes on a given SimplifiedDomain.
 void AllDistinctRoutes.computeAllDistinctRoute(SimplifiedDomain domain, int maxDepth, int nbPath, boolean verbose)
           
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.repository.CSPF
 

Methods in be.ac.ulg.montefiore.run.totem.repository.CSPF that throw NodeNotFoundException
protected  java.util.HashMap<java.lang.String,CSPFElem> CSPF.computeCSPF(Domain domain, int priority, Node srcNode, Node dstNode, float bw, boolean stopToSourceOrDestination, boolean computeFromSourceToDestination)
          Computes the CSPF between a source node and a destination node with a bandwidth requirement
protected  java.util.HashMap<java.lang.String,CSPFElem> CSPF.computeCSPF(Domain domain, int priority, Node srcNode, Node dstNode, float bw, boolean stopToSourceOrDestination, boolean computeFromSourceToDestination, java.util.HashSet<Link> avoidLinks)
          Computes the CSPF between a source node and a destination node with a bandwidth requirement
 SimplifiedPath[] BhandariKDisjointPath.computeLinkDisjointPath(int src, int dst, int k)
          Compute K disjoint shortest path between src to dst.
 java.util.List<SimplifiedPath> Bhandari.computeSPF(SimplifiedDomain domain, int src)
          Compute the SPF from all source nodes to all destination nodes on the SimplifiedDomain
 SimplifiedPath Bhandari.computeSPF(SimplifiedDomain domain, int src, int dst)
          Compute the SPF from a source node to a destination node on the SimplifiedDomain
protected  java.util.List<Path> CSPF.extractPath(Domain domain, java.util.HashMap<java.lang.String,CSPFElem> path, Node node, boolean ECMP, boolean computeFromSourceToDestination)
           
protected  java.util.List<Path> CSPF.extractPath(Domain domain, java.util.HashMap<java.lang.String,CSPFElem> path, Node srcNode, Node dstNode, boolean ECMP, boolean computeFromSourceToDestination)
           
protected  void CSPF.relax(Link link, int priority, boolean computeFromSourceToDestination, java.util.Set<Link> avoidLinks)
           
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.repository.MplsRouting
 

Methods in be.ac.ulg.montefiore.run.totem.repository.MplsRouting that throw NodeNotFoundException
 float[] MplsRouting.compute(Domain domain, TrafficMatrix tm)
          Compute the link utilisation produce by the Mpls Routing using glpsol
 void MplsRouting.createDataFile(Domain domain, TrafficMatrix tm)
          Create the data file
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.repository.MultiCommodityFlow
 

Methods in be.ac.ulg.montefiore.run.totem.repository.MultiCommodityFlow that throw NodeNotFoundException
 float[] MultiCommodityFlow.computeCommodityFlow(Domain domain, TrafficMatrix tm)
          Compute the link utilisation produce by the MCF using glpsol
 void MultiCommodityFlow.createMCFMinMaxUtilDataFile(Domain domain, TrafficMatrix tm)
          Create the data file
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.repository.SAMTE.candidatepathlist
 

Methods in be.ac.ulg.montefiore.run.totem.repository.SAMTE.candidatepathlist that throw NodeNotFoundException
static CandidatePathList PairDisjointPathCPLGenerator.generate(PairDisjointPathCPLGeneratorParameter params)
           
 SinglePathCPL SinglePathCPLGenerator.generate(SinglePathCPLGeneratorParameter params, boolean verbose)
           
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.topgen.traffic
 

Methods in be.ac.ulg.montefiore.run.totem.topgen.traffic that throw NodeNotFoundException
 TrafficMatrix TrafficGenerator.generateTM()
           
static Scenario TopgenScenarioFactory.makeSimpleScenario(TrafficGenerator trafficGenerator)
          Builds and returns a simple scenario.
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.topgen.util
 

Methods in be.ac.ulg.montefiore.run.totem.topgen.util that throw NodeNotFoundException
static Domain Converter.briteTopologyToDomain(Topology.Topology topology, boolean linksDirected, int metric)
          This method parses a Topology object that is in BRITE format and returns a Domain object that contains the same information.
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.trafficMatrix.facade
 

Methods in be.ac.ulg.montefiore.run.totem.trafficMatrix.facade that throw NodeNotFoundException
 TrafficMatrix TrafficMatrixManager.loadTrafficMatrix(java.io.File file, int tmId, boolean isDefaultTrafficMatrix)
          Loads the intra-domain traffic matrix contained in the given file.
 TrafficMatrix TrafficMatrixManager.loadTrafficMatrix(java.lang.String fileName)
          Loads the intra-domain traffic matrix contained in the file fileName.
 TrafficMatrix TrafficMatrixManager.loadTrafficMatrix(java.lang.String fileName, int tmId, boolean isDefaultTrafficMatrix)
          Loads the intra-domain traffic matrix contained in the file fileName.
 void TrafficMatrixManager.updateTrafficMatrix(int tmId, java.lang.String fileName)
          Updates the intra-domain traffic matrix tmId with the information contained in the file fileName.
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.trafficMatrix.model
 

Methods in be.ac.ulg.montefiore.run.totem.trafficMatrix.model that throw NodeNotFoundException
 float TrafficMatrix.get(int src, int dst)
          Returns the amount of traffic exchanged by the nodes src and dst.
 float TrafficMatrix.get(java.lang.String src, java.lang.String dst)
          Returns the amount of traffic exchanged by the nodes src and dst.
 void TrafficMatrix.set(int src, int dst, float value)
          Sets the amount of traffic exchanged by the nodes src and dst.
 void TrafficMatrix.set(java.lang.String src, java.lang.String dst, float value)
          Sets the amount of traffic exchanged by the nodes src and dst.
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.trafficMatrix.model.impl
 

Methods in be.ac.ulg.montefiore.run.totem.trafficMatrix.model.impl that throw NodeNotFoundException
static void SPFLinkLoadStrategy.calculateLoads(Domain domain, TrafficMatrix tm, double[] loads, java.util.List<java.util.List<Link>> links, float fraction, int src, int dst)
           
 Path BasicIGPShortcutStrategy.computePath(Domain domain, Node srcNode, Node dstNode)
           
 float TrafficMatrixImpl.get(int src, int dst)
           
 float TrafficMatrixImpl.get(java.lang.String src, java.lang.String dst)
           
 void TrafficMatrixImpl.set(int src, int dst, float value)
           
 void TrafficMatrixImpl.set(java.lang.String src, java.lang.String dst, float value)
           
 

Uses of NodeNotFoundException in be.ac.ulg.montefiore.run.totem.trafficMatrix.persistence
 

Methods in be.ac.ulg.montefiore.run.totem.trafficMatrix.persistence that throw NodeNotFoundException
static TrafficMatrix TrafficMatrixFactory.loadTrafficMatrix(java.io.File file)
          Returns the intra-domain traffic matrix contained in the given file file.
static TrafficMatrix TrafficMatrixFactory.loadTrafficMatrix(java.lang.String fileName)
          Returns the intra-domain traffic matrix contained in the file fileName.
static void TrafficMatrixFactory.saveTrafficMatrix(java.lang.String fileName, TrafficMatrix tm)
          Saves the intra-domain traffic matrix tm to the file fileName.
static void TrafficMatrixFactory.updateTrafficMatrix(java.lang.String fileName, int tmId)
          Updates the intra-domain traffic matrix tmId with the information contained in the file fileName.
 

Uses of NodeNotFoundException in test
 

Methods in test that throw NodeNotFoundException
 void DAMOTETest.test2()
           
 void PreemptTest.test2PreemptNoBwSharing()
           
 void DAMOTETest.test3()
           
 void DomaintTest.testAddLink()
          Test add link on test-domain1.xml
 void DomaintTest.testAddLink2()
          Create a new domain and add two links.
 void DomaintTest.testAddLsp()
          Add a LSP in a domain with existings LSPs
 void DomaintTest.testAddLsp2()
          Add a LSP in a domain without MPLS section
 void ListenersTest.testaddremoveLSP()
          check the number of listeners in the domain, start algorithms, add a explicit route lsp in the domain, route a second lsp and check that the right route is taken (that the first lsp is added in the algorithm specific database)
 void DomaintTest.testAddRemoveLsp()
          Add and remove a LSP from a domain
 void HybridStrategiesTest.testBasicIGPShortcut()
           
 void BandwidthUnitTest.testBwConversion()
           
 void BhandariTest.testCompareWithCSPF()
           
 void CSPFTest.testComputeSPFSource()
           
 void BandwidthUnitTest.testDomainCreation()
           
 void HybridStrategiesTest.testIGPShortcut()
           
 void NodeTest.testInAndOutLinks()
          Test inLink and outLink methods
 void DomaintTest.testInOutLinks()
           
 void AllDistinctRoutesTest.testLoadSaveDistinctRoutes()
           
 void ScenarioTest.testLoadSaveScenario()
           
 void AllDistinctRoutesTest.testMaxDepth()
           
 void MCFTest.testMCF()
           
 void XAMCRATest.testMetricConstraint()
          Test with Metric and TEMetric Constraints.
 void MIRATest.testNEWMIRA()
           
 void BhandariTest.testNonConsecutiveId()
           
 void XAMCRATest.testNonConsecutiveIds()
           
 void PreemptTest.testNotDefinedPL()
           
 void PreemptTest.testPreemptImpos()
          Try to add a lsp on a path with insufficent free bandwidth and check reservations on lsp links.
 void PreemptTest.testPreemptNoBwSharing()
           
 void RoutingMatrixTest.testRealRoutingMatrix()
           
 void InterDomainManagerTest.testRemoveMatrices()
           
 void XAMCRATest.testRouteBw()
          Test with only bw constraint
 void XAMCRATest.testRouteBwDelay()
          Test with bw and delay constraint (path 0-3-2 does not satisfy constraints anymore)
 void DomainFactoryTest.testSave2()
           
 void AllDistinctRoutesTest.testSimpleDomain()
           
 void MIRATest.testSMIRA()
           
 void PreemptTest.testUselessPreemption()
           
 



Copyright © 2004-2006 Research Unit in Networking, All Rights Reserved.