Name
Title | ||
|---|---|---|
A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding. |
Abstract | ||
|---|---|---|
Network virtualization (NV) is widely accepted as one enabling technology for future network, which enables multiple virtual networks (VNs) with different paradigms and protocols to coexist on the shared substrate network (SN). One key challenge in NV is VN embedding (VNE), which maps a VN onto the shared SN. Since VNE is NP-hard, existing efforts mainly focus on proposing heuristic algorithms tha... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TNSM.2017.2778106 | IEEE Transactions on Network and Service Management |
Keywords | Field | DocType |
Substrates,Heuristic algorithms,Propagation delay,Computational complexity,Bandwidth,Virtualization,Software algorithms | Virtualization,Average-case complexity,Asymptotic computational complexity,Heuristic,Embedding,Computer science,Theoretical computer science,Network virtualization,Computational resource,Computational complexity theory,Distributed computing | Journal |
Volume | Issue | ISSN |
15 | 1 | 1932-4537 |
Citations | PageRank | References |
3 | 0.41 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haotong Cao | 1 | 22 | 10.36 |
| Yongxu Zhu | 2 | 12 | 2.53 |
| Gan Zheng | 3 | 2199 | 115.78 |
| Longxiang Yang | 4 | 58 | 16.58 |