Package | Description |
---|---|
com.net2plan.research.niw.networkModel |
Modifier and Type | Method and Description |
---|---|
WNode |
WNet.addNode(double xCoord,
double yCoord,
String name,
String type)
Adds a node to the design
|
WNode |
WFiber.getA()
Returns the origin node of the link
|
WNode |
WIpLink.getA()
Returns the IP link orgin node
|
WNode |
WServiceChain.getA()
The service chain origin node
|
WNode |
WLightpathRequest.getA()
The lightpath request origin node
|
WNode |
WLightpathUnregenerated.getA()
The origin node of the lighptath, that must the origin node of the associated lightpath request
|
WNode |
WAbstractNetworkElement.getAsNode()
Casts this element to a WNode object (fails if it is not an object of such type)
|
WNode |
WFiber.getB()
Returns the destination node of the link
|
WNode |
WIpLink.getB()
Returns the IP link destination node
|
WNode |
WServiceChain.getB()
The service chain destination node
|
WNode |
WLightpathRequest.getB()
The lightpath request destination node
|
WNode |
WLightpathUnregenerated.getB()
The destination node of the lighptath, that must the destination node of the associated lightpath request
|
WNode |
WVnfInstance.getHostingNode()
Returns the hosting node of the VNF instance
|
Modifier and Type | Method and Description |
---|---|
Optional<WNode> |
WNet.getNodeByName(String name)
Returns the network node with the indicated name, if any
|
List<WNode> |
WNet.getNodes()
Returns the list of network nodes, in increasing order according to its id
|
SortedSet<WNode> |
WNet.getNodesConnectedToCore()
Returns the nodes in the network that are supposed to have a connection to the network core (the core nodes and those connecting links are not part of the network)
|
SortedSet<WNode> |
WServiceChainRequest.getPotentiallyValidDestinations()
Returns the potentially valid destination nodes for the service chains of this request
|
SortedSet<WNode> |
WServiceChainRequest.getPotentiallyValidOrigins()
Returns the potentially valid origin nodes for the service chains of this request
|
Modifier and Type | Method and Description |
---|---|
Pair<WFiber,WFiber> |
WNet.addFiber(WNode a,
WNode b,
List<Integer> validOpticalSlotRanges,
double lengthInKm,
boolean isBidirectional)
Adds a fiber to the design
|
Pair<WIpLink,WIpLink> |
WNet.addIpLink(WNode a,
WNode b,
double nominalLineRateGbps,
boolean isBidirectional)
Adds an IP link to the network
|
WLightpathRequest |
WNet.addLightpathRequest(WNode a,
WNode b,
double lineRateGbps,
boolean isToBe11Protected)
Adds a lightpath request to the design
|
WServiceChainRequest |
WNet.addServiceChainRequest(WNode userInjectionNode,
boolean isUpstream,
WUserService userService)
Adds a request for an upstream or downstream unidirectional service chain, for the given user service.
|
WVnfInstance |
WNet.addVnfInstance(WNode hostNode,
String name,
WVnfType type)
Adds an instance of the VNF of the given type, in the indicated host node, applying it the given name
|
List<List<? extends WAbstractNetworkElement>> |
WNet.getKShortestServiceChainInIpLayer(int k,
WNode a,
WNode b,
List<String> sequenceOfVnfTypesToTraverse,
Optional<Map<WIpLink,Double>> optionalCostMapOrElseLatency,
Optional<Map<WVnfInstance,Double>> optionalVnfCostMapOrElseLatency)
Returns a ranking with the k-shortest paths for service chains, given the end nodes, and the sequence of types of VNFs that it should traverse.
|
List<List<WFiber>> |
WNet.getKShortestWdmPath(int k,
WNode a,
WNode b,
Optional<Map<WFiber,Double>> optionalCostMapOrElseLatency)
Returns a ranking with the k-shortest paths composed as a sequence of WFiber links in the network, given the origin and end nodes of the paths.
|
Modifier and Type | Method and Description |
---|---|
void |
WServiceChainRequest.setPotentiallyValidDestinations(SortedSet<WNode> validDestinations)
Sets the potentially valid destination nodes for the service chains of this request
|
void |
WServiceChainRequest.setPotentiallyValidOrigins(SortedSet<WNode> validOrigins)
Sets the potentially valid origin nodes for the service chains of this request
|
Copyright © 2018. All rights reserved.