The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Virtual Network Embedding with Coordinated Node and Link Mapping
Abstract
Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (VNs) to coexist on a shared infrastructure. A major challenge in this respect is the VN embedding problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. Since this problem is known to be NP-hard, previous research focused on designing heuristic-based algorithms which had clear separation between the node mapping and the link mapping phases. This paper proposes VN embedding algorithms with better coordination between the two phases. We formulate the VN embedding problem as a mixed integer program through substrate network augmentation. We then relax the integer constraints to obtain a linear program, and devise two VN embedding algorithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. Simulation experiments show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,703
Rethinking virtual network embedding: substrate support for path splitting and migration
Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1355734.1355737 · Cited by 1,244
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Raghavan, P., & Tompson, C. D. (1987) · Combinatorica · doi:10.1007/bf02579324 · Cited by 1,010
Overcoming the Internet impasse through virtualization
Anderson, T., Peterson, L., Shenker, S., & Turner, J. (2005) · Computer · doi:10.1109/mc.2005.136 · Cited by 922
Algorithms for Assigning Substrate Network Resources to Virtual Network Components
Zhu, Y., & Ammar, M. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.322 · Cited by 779
How to lease the internet in your spare time
Feamster, N., Gao, L., & Rexford, J. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1198255.1198265 · Cited by 540
In VINI veritas: realistic and controlled network experimentation
Bavier, A., Feamster, N., Huang, M., Peterson, L., & Rexford, J. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159916 · Cited by 438
The Power of Two Random Choices: A Survey of Techniques and Results
Mitzenmacher, M., Richa, A. W., & Sitaraman, R. (2001) · Combinatorial Optimization · doi:10.1007/978-1-4615-0013-1_9 · Cited by 431
Cited by
Virtual Network Embedding: A Survey
Fischer, A., Botero, J. F., Beck, M. T., de Meer, H., & Hesselbach, X. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.013013.00155 · Cited by 1,244
A survey of network virtualization
Chowdhury, N. M. M. K., & Boutaba, R. (2010) · Computer Networks · doi:10.1016/j.comnet.2009.10.017 · Cited by 1,189
Self-citationNetwork virtualization: state of the art and research challenges
Chowdhury, N. M. M. K., & Boutaba, R. (2009) · IEEE Communications Magazine · doi:10.1109/mcom.2009.5183468 · Cited by 838
Self-citationViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Chowdhury, M., Rahman, M. R., & Boutaba, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2159308 · Cited by 818
Self-citation5G network slicing using SDN and NFV: A survey of taxonomy, architectures and future challenges
Barakabitze, A. A., Ahmad, A., Mijumbi, R., & Hines, A. (2020) · Computer Networks · doi:10.1016/j.comnet.2019.106984 · Cited by 814
Wireless Network Virtualization: A Survey, Some Research Issues and Challenges
Liang, C., & Yu, F. R. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2352118 · Cited by 708
Data Center Network Virtualization: A Survey
Bari, M. F., Boutaba, R., Esteves, R., Granville, L. Z., Podlesny, M., Rabbani, M. G., Zhang, Q., & Zhani, M. F. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.090512.00043 · Cited by 677
Self-citationVirtual network embedding through topology-aware node ranking
Cheng, X., Su, S., Zhang, Z., Wang, H., Yang, F., Luo, Y., & Wang, J. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1971162.1971168 · Cited by 544
Scalable Network Virtualization in Software-Defined Networks
Drutskoy, D., Keller, E., & Rexford, J. (2013) · IEEE Internet Computing · doi:10.1109/mic.2012.144 · Cited by 302
Management and orchestration challenges in network functions virtualization
Mijumbi, R., Serrat, J., Gorricho, J.-L., Latre, S., Charalambides, M., & Lopez, D. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7378433 · Cited by 291
On the Carbon Footprint Optimization in an InterCloud Environment
Justafort, V. D., Beaubrun, R., & Pierre, S. (2018) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2015.2511768 · Cited by 10
“NOWADAYS, Cloud Computing provides innovative computing solutions [1], [2], allowing small businesses to rent virtual servers as a service.”
BackgroundA hybrid approach for optimizing carbon footprint in intercloud environment
Justafort, V. D., Beaubrun, R., & Pierre, S. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2638900 · Cited by 7
Metadata
- Authors
- Chowdhury, N. M. M. K., Rahman, M. R., & Boutaba, R.
- Venue
- IEEE INFOCOM 2009
- Publisher
- IEEE
- Published
- 2009-04
- Pages
- 783-791
- OpenAlex
- W2161965229
- Cited by
- 823
- References
- 14
- FWCI
- 48.04
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.