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
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Raghavan, P., & Tompson, C. D. (1987) · Combinatorica · doi:10.1007/bf02579324 · Cited by 1,010
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
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
Self-citationAlgorithms 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
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
The Power of Two Random Choices: A Survey of Techniques and Results
Mitzenmacher, M., Richa, A. W., & Sitaraman, R. (2001) · Combinatorial Optimization · doi:10.1007/978-1-4615-0013-1_9 · Cited by 431
Turner, J. S., & Taylor, D. E. (2005) · GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · doi:10.1109/glocom.2005.1577741 · Cited by 316
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
Theoretical Approaches to Node Assignment
Andersen, D. G. (2018) · Figshare · doi:10.1184/r1/6610829 · Cited by 278
GENI - global environment for network innovations
Elliott, C. (2008) · 2008 33rd IEEE Conference on Local Computer Networks (LCN) · doi:10.1109/lcn.2008.4664143 · Cited by 278
Efficient Mapping of Virtual Networks onto a Shared Substrate
Lu, J. (2006) · doi:10.7936/k78w3bj4 · Cited by 265
Large-scale Virtualization in the Emulab Network Testbed
Hibler, M., Ricci, R., Stoller, L. B., et al. (2008) · Cited by 220
Resource 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
Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding
Farooq Butt, N., Chowdhury, M., & Boutaba, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12963-6_3 · Cited by 171
Self-citationSurvivable Virtual Network Embedding
Rahman, M. R., Aib, I., & Boutaba, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12963-6_4 · Cited by 165
Self-citationImproved 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
On the Influence of Lookahead in Competitive Paging Algorithms
Albers, S. (1997) · Algorithmica · doi:10.1007/pl00009158 · Cited by 68
Online bin packing with lookahead
Grove, E. F. (1995) · Symposium on Discrete Algorithms · doi:10.5555/313651.313781 · Cited by 50
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
QoS-Aware Deployment of IoT Applications Through the Fog
Brogi, A., & Forti, S. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2701408 · Cited by 472
Luizelli, M. C., Bays, L. R., Buriol, L. S., Barcellos, M. P., & Gaspary, L. P. (2015) · 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM) · doi:10.1109/inm.2015.7140281 · Cited by 400
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
Wei, W., Fan, X., Song, H., Fan, X., & Yang, J. (2018) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2528246 · Cited by 348
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
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.