The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Algorithms for Assigning Substrate Network Resources to Virtual Network Components
Abstract
Recent proposals for network virtualization provide a promising way to overcome the Internet ossification. The key idea of network virtualization is to build a diversified Internet to support a variety of network services and architectures through a shared substrate. A major challenge in network virtualization is the assigning of substrate resources to virtual networks (VN) efficiently and on-demand. This paper focuses on two versions of the VN assignment problem: VN assignment without reconfiguration (VNA-I) and VN assignment with reconfiguration (VNAII). For the VNA-I problem, we develop a basic scheme as a building block for all other advanced algorithms. Subdividing heuristics and adaptive optimization strategies are then presented to further improve the performance. For the VNA-II problem, we develop a selective VN reconfiguration scheme that prioritizes the reconfiguration of the most critical VNs. Extensive simulation experiments demonstrate that the proposed algorithms can achieve good performance under a wide range of network conditions.
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
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
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
Krishnan, P., Raz, D., & Shavitt, Y. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879344 · Cited by 380
On-line load balancing with applications to machine scheduling and virtual circuit routing
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167248 · Cited by 212
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
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
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
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
Virtual 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
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
A Distributed Virtual Network Mapping Algorithm
Houidi, I., Louati, W., & Zeghlache, D. (2008) · 2008 IEEE International Conference on Communications · doi:10.1109/icc.2008.1056 · Cited by 282
Efficient Mapping of Virtual Networks onto a Shared Substrate
Lu, J. (2006) · doi:10.7936/k78w3bj4 · Cited by 265
On 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
Metadata
- Authors
- Zhu, Y., & Ammar, M.
- Venue
- Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2006
- Pages
- 1-12
- OpenAlex
- W2142547489
- Cited by
- 779
- References
- 5
- FWCI
- 9.09
- 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
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.