A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding
- Submitting institution
-
London South Bank University
- Unit of assessment
- 12 - Engineering
- Output identifier
- 284276
- Type
- D - Journal article
- DOI
-
10.1109/tnsm.2017.2778106
- Title of journal
- IEEE Transactions on Network and Service Management
- Article number
- -
- First page
- 356
- Volume
- 15
- Issue
- 1
- ISSN
- 1932-4537
- Open access status
- Technical exception
- Month of publication
- November
- Year of publication
- 2017
- URL
-
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8122008
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
B - Cognitive Systems Research Centre
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work proposed an optimal virtual network embedding mapping algorithm CAN-A with less computational complexity. This work was published in IEEE Transactions on Network and Service Management, the impact factor of this paper is 3.878, and cited over 51 times.
This work collaborates with Loughborough University and Nanjing University of Posts and Telecommunications. This work was supported by the U.K. Engineering and Physical Sciences Research Council under Grant EP/N007840/1.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -