The DOI matches its Crossref record.
Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding
Open accessAbstract
Embedding of virtual network (VN) requests on top of a shared physical network poses an intriguing combination of theoretical and practical challenges. Two major problems with the state-of-the-art VN embedding algorithms are their indifference to the underlying substrate topology and their lack of reoptimization mechanisms for already embedded VN requests. We argue that topology-aware embedding together with reoptimization mechanisms can ameliorate the performance of the previous VN embedding algorithms in terms of acceptance ratio and load balancing. The major contributions of this paper are twofold: (1) we present a mechanism to differentiate among resources based on their importance in the substrate topology, and (2) we propose a set of algorithms for reoptimizing and re-embedding initially-rejected VN requests after fixing their bottleneck requirements. Through extensive simulations, we show that not only our techniques improve the acceptance ratio, but they also provide the added benefit of balancing load better than the previous proposals.
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
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
ViNEYard: 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-citationData 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
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
- Farooq Butt, N., Chowdhury, M., & Boutaba, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 27-39
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1480714054
- Cited by
- 171
- References
- 0
- FWCI
- 18.21
- Type
- conference paper
- Language
- en
- Open access
- green
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: Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding. https://app.cochat.ai/papers/10.1007/978-3-642-12963-6_3
- The paper
- Farooq Butt, N., Chowdhury, M., & Boutaba, R. (2010). Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-12963-6_3
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.