The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Rethinking virtual network embedding: substrate support for path splitting and migration
Abstract
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying resources requires effective techniques for virtual network embedding--mapping each virtual network to specific nodes and links in the substrate network. Since the general embedding problem is computationally intractable, past research restricted the problem space to allow efficient solutions, or focused on designing heuristic algorithms. In this paper, we advocate a different approach: rethinking the design of the substrate network to enable simpler embedding algorithms and more efficient use of resources, without restricting the problem space. In particular, we simplify virtual link embedding by: i) allowing the substrate network to split a virtual link over multiple substrate paths and ii) employing path migration to periodically re-optimize the utilization of the substrate network. We also explore node-mapping algorithms that are customized to common classes of virtual-network topologies. Our simulation experiments show that path splitting, path migration,and customized embedding algorithms enable a substrate network to satisfy a much larger mix of virtual networks
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
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
The power of two choices in randomized load balancing
Mitzenmacher, M. (2001) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.963420 · Cited by 1,399
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
Dummynet: a simple approach to the evaluation of network protocols
Rizzo, L. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/251007.251012 · Cited by 888
Black-box and gray-box strategies for virtual machine migration
Wood, T., Shenoy, P. J., Venkataramani, A., et al. (2007) · Cited by 824
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
Self-citationExploiting process lifetime distributions for dynamic load balancing
Harchol-Balter, M., & Downey, A. B. (1997) · ACM Transactions on Computer Systems · doi:10.1145/263326.263344 · Cited by 442
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
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
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
- Yu, M., Yi, Y., Rexford, J., & Chiang, M.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2008-03-31
- Volume
- 38
- Issue
- 2
- Pages
- 17-29
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2114298221
- Cited by
- 1,244
- References
- 18
- FWCI
- 74.07
- 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: Rethinking virtual network embedding: substrate support for path splitting and migration. https://app.cochat.ai/papers/10.1145/1355734.1355737
- The paper
- Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008). Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1355734.1355737
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.
