The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Abstract
Network virtualization allows multiple heterogeneous virtual networks (VNs) to coexist on a shared infrastructure. Efficient mapping of virtual nodes and virtual links of a VN request onto substrate network resources, also known as the VN embedding problem, is the first step toward enabling such multiplicity. Since this problem is known to beNP-hard, previous research focused on designing heuristic-based algorithms that had clear separation between the node mapping and the link mapping phases. In this paper, we present ViNEYard-a collection of VN embedding algorithms that leverage 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 online VN embedding algorithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. We also present a generalized window-based VN embedding algorithm (WiNE) to evaluate the effect of lookahead on VN embedding. Our simulation experiments on a large mix of VN requests 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
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
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
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
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
Zegura, E. W., Calvert, K. L., & Bhattacharjee, S. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1996.493353 · Cited by 1,679
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
Boudec, J. L., & Thiran, P. (2001) · Cited by 1,593
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
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
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-citationThe art of computer systems performance analysis
Chlamtac, I. (1992) · Journal of Molecular Graphics · doi:10.1016/0263-7855(92)80055-i · Cited by 1,020
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 on Service Migration in Mobile Edge Computing
Wang, S., Xu, J., Zhang, N., & Liu, Y. (2018) · IEEE Access · doi:10.1109/access.2018.2828102 · Cited by 348
Dynamic service migration in mobile edge-clouds
Wang, S., Urgaonkar, R., Zafer, M., He, T., Chan, K., & Leung, K. K. (2015) · 2015 IFIP Networking Conference (IFIP Networking) · doi:10.1109/ifipnetworking.2015.7145316 · Cited by 281
Yan, Z., Ge, J., Wu, Y., Li, L., & Li, T. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2986662 · Cited by 258
Design and evaluation of learning algorithms for dynamic resource management in virtual networks
Mijumbi, R., Gorricho, J.-L., Serrat, J., Claeys, M., De Turck, F., & Latre, S. (2014) · 2014 IEEE Network Operations and Management Symposium (NOMS) · doi:10.1109/noms.2014.6838258 · Cited by 109
Metadata
- Authors
- Chowdhury, M., Rahman, M. R., & Boutaba, R.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2012-02
- Volume
- 20
- Issue
- 1
- Pages
- 206-219
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W1966600255
- Cited by
- 818
- References
- 29
- FWCI
- 71.30
- Type
- journal article
- 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: ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping. https://app.cochat.ai/papers/10.1109/tnet.2011.2159308
- The paper
- Chowdhury, M., Rahman, M. R., & Boutaba, R. (2012). ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2011.2159308
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.
