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.
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
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,703
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
Black-box and gray-box strategies for virtual machine migration
Wood, T., Shenoy, P. J., Venkataramani, A., & Yousif, M. S. (2007) · Networked Systems Design and Implementation · Cited by 920
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
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
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
Self-citationEppstein, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365697 · Cited by 349
Turner, J. S., & Taylor, D. E. (2005) · GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · doi:10.1109/glocom.2005.1577741 · Cited by 316
Theoretical Approaches to Node Assignment
Andersen, D. G. (2018) · Figshare · doi:10.1184/r1/6610829 · Cited by 278
Efficient Mapping of Virtual Networks onto a Shared Substrate
Lu, J. (2006) · doi:10.7936/k78w3bj4 · Cited by 265
NetScope: traffic engineering for IP networks
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., & Rexford, J. (2000) · IEEE Network · doi:10.1109/65.826367 · Cited by 224
Self-citationResource management with hoses: point-to-cloud services for virtual private networks
Duffield, N. G., Goyal, P., Greenberg, A. G., Mishra, A. B., Ramakrishnan, K. K., & van der Merwe, J. E. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.803918 · Cited by 195
Improved approximation algorithms for unsplittable flow problems
Kolliopoulos, S. G., & Stein, C. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646131 · Cited by 138
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
Resource Allocation in NFV: A Comprehensive Survey
Gil Herrera, J., & Botero, J. F. (2016) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2016.2598420 · Cited by 904
Virtual Network Embedding with Coordinated Node and Link Mapping
Chowdhury, N. M. M. K., Rahman, M. R., & Boutaba, R. (2009) · IEEE INFOCOM 2009 · doi:10.1109/infcom.2009.5061987 · Cited by 823
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
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
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.