The DOI matches its Crossref record.
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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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-citationOn 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
A 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
- 0
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Virtual Network Embedding with Coordinated Node and Link Mapping. https://app.cochat.ai/papers/10.1109/infcom.2009.5061987
- The paper
- Chowdhury, N. M. M. K., Rahman, M. R., & Boutaba, R. (2009). Virtual Network Embedding with Coordinated Node and Link Mapping. IEEE INFOCOM 2009. https://doi.org/10.1109/infcom.2009.5061987
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.