Heuristic Solver#
|
A node ranking-based solver that use the order of nodes in the graph as the rank. |
|
A node ranking-based solver that randomly rank the nodes. |
|
A node ranking-based solver that use the First Fit Decreasing (FFD) metric to rank the nodes. |
|
A node ranking-based solver that use the Global Resource Capacity (GRC) metric to rank the nodes. |
|
A node ranking-based solver that use the random walk (RW) algorithm to rank the nodes. |
|
A node ranking-based solver that use the Network Resource Metric (NRM) metric to rank the nodes. |
|
A node ranking-based solver that use the node proximity sensing and path comprehensive evaluation algorithm to rank the nodes. |
|
A BFS-based Node Rank solver that ranks nodes by their order in the graph. |
|
A BFS-based Node Rank solver that ranks nodes with random walk algorithm. |
|
A BFS-based Node Rank solver that ranks nodes randomly. |
Two-stage Mapping Node Ranking-based Solver#
OrderRankSolver#
Documentation
- class virne.solver.heuristic.OrderRankSolver(controller: Controller, recorder: Recorder, counter: Recorder, **kwargs)[source]#
A node ranking-based solver that use the order of nodes in the graph as the rank.
- - solve
solve the problem instance.
- - node_mapping
place virtual nodes onto appropriate physical nodes.
- - link_mapping
route virtual links onto appropriate physical paths.
RandomRankSolver#
FFDRankSolver#
GRCRankSolver#
Documentation
- class virne.solver.heuristic.GRCRankSolver(controller: Controller, recorder: Recorder, counter: Recorder, **kwargs)[source]#
A node ranking-based solver that use the Global Resource Capacity (GRC) metric to rank the nodes.
References
Gong et al. “Toward Profit-Seeking Virtual Network Embedding solver via Global Resource Capacity”. In INFOCOM, 2014.
- Variables:
sigma (-) – the sigma parameter in the GRC metric.
d (-) – the d parameter in the GRC metric.
RandomWalkRankSolver#
Documentation
- class virne.solver.heuristic.RandomWalkRankSolver(controller: Controller, recorder: Recorder, counter: Recorder, **kwargs)[source]#
A node ranking-based solver that use the random walk (RW) algorithm to rank the nodes.
References
Cheng et al. “Virtual Network Embedding Through Topology-Aware Node Ranking”. In SIGCOMM, 2011.
- Variables:
sigma – The probability of teleporting to a random node.
p_J_u – The probability of jumping to a random neighbor of u.
p_F_u – The probability of following a random neighbor of u.
NRMRankSolver#
Documentation
- class virne.solver.heuristic.NRMRankSolver(controller: Controller, recorder: Recorder, counter: Recorder, **kwargs)[source]#
A node ranking-based solver that use the Network Resource Metric (NRM) metric to rank the nodes.
References
Zhang et al. “Toward Profit-Seeking Virtual Network Embedding solver via Global ResVirtual Network Embedding Based on Computing, Network, and Storage Resource Constraintsource Capacity”. IoTJ, 2018.
PLRankSolver#
Documentation
- class virne.solver.heuristic.PLRankSolver(controller: Controller, recorder: Recorder, counter: Recorder, **kwargs)[source]#
A node ranking-based solver that use the node proximity sensing and path comprehensive evaluation algorithm to rank the nodes.
References
Fan et al. “Efficient Virtual Network Embedding of Cloud-Based Data Center Networks into Optical Networks”. TPDS, 2021.
BFS-based Mapping Node Ranking-based Solver#
OrderRankBfsSolver#
RandomRankBfsSolver#
RandomWalkRankBfsSolver#
Documentation
- class virne.solver.heuristic.RandomWalkRankBfsSolver(controller: Controller, recorder: Recorder, counter: Counter, **kwargs)[source]#
A BFS-based Node Rank solver that ranks nodes with random walk algorithm.
References
Cheng et al. “Virtual Network Embedding Through Topology-Aware Node Ranking”. In SIGCOMM, 2011.