Table 1.
VNE algorithm taxonomy.
| Algorithm | Network | Request Types | Objectives | Network Control | ILP | Node Ranking | Link Assignment | Reference |
|---|---|---|---|---|---|---|---|---|
| Two-stage | General | Dynamic | Revenue | N | Y | Available resource | KSP + splitting | [12] Yu et al. (2008) |
| N | RW | KSP | [63] Zhang et al. (2012) | |||||
| Cost | N | Y | Candidate node set | Candidate path set | [97] Cao et al. (2018) | |||
| Energy efficiency | N | Y | Residual CPU | SP | [76] Zhang et al. (2016) | |||
| Modified GRC | SP | [98] Cao et al. (2018) | ||||||
| FiWi | Static | Survivablility | N | Y | Residual CPU | KSP | [36] Liu et al. (2019) | |
| Inter—ODCN | Dynamic | Cost | N | Y | Available resource | SP | [95] Jiang et al. (2015) | |
| Acceptance | Y | Y | Available resource | Candidate path set | [96]Pagès et al. (2019) | |||
| EON | Static | Spectrum usage | N | Y | Random | KSP + splitting | [14] Shahriar et al. (2019) | |
| Coordinated | General | Dynamic | Revenue | N | N | GRC | SP | [15] Gong et al. (2014) |
| Cost | N | Y | Available resource | MCF + splitting | [99] Chowdhury et al. (2012) | |||
| Energy efficiency+ Revenue | N | N | Candidate node set | SP | [101] Shahin et al. (2015) | |||
| Revenue | N | Y | N/A | N/A | [100] Jarray et al. (2015) | |||
| WSN | Dynamic | Revenue | N | N | N/A | anypath | [32] Li et al. (2017) | |
| EON | Static | Cost | N | Y | N/A | SP | [57] Lin et al. (2018) | |
| Spectrum usage | N | N | Random | KSP | [48] Xuan et al. (2017) | |||
| Inter—ODCN | Static | Energy efficiency | Y | Y | Modified GRC | SP | [69] Zong et al. (2018) | |
| Dynamic | Acceptance | Y | Y | Residual CPU | SP | [56] Fajjari et al. (2014) | ||
| ML | IWN | Static | Latency | Y | N | N/A | Anypath | [24] Li et al. (2019) |
| General | Dynamic | Revenue + cost | N | N | Residual CPU | N/A | [106] Blenk et al. (2018) | |
| N/A | N/A | [107] Dolati et al. (2019) | ||||||
| Profit | N | N | MCTS | MCF | [104] Haeri et al. (2018) |