Hierarchical CORD for NFV Datacenters: Resource Allocation with Cost-Latency Tradeoff
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Network Function Virtualization (NFV) allows datacenters to consolidate network appliance functions onto commodity servers and devices. Currently telecommunication carriers are re-architecting their central offices as NFV datacenters that, along with SDN, help network service providers to speed deployment and reduce cost. However, it is still unclear how a carrier network shall organize its NFV datacenter resources into a coherent service architecture to support global network functional demands. This work proposes a hierarchical NFV/SDN-integrated architecture in which datacenters are organized into a multi-tree overlay network to collaboratively process user traffic flows. The proposed architecture steers traffic to a nearby datacenter to optimize user-perceived service response time. Our experimental results reveal that the 3-tier architecture is favored over others as it strikes a good balance between centralized processing and edge computing, and the resource allocation should be decided based on traffic's source-destination attributes. Our results indicate that when most traffic flows within the same edge datacenter, the strategy whereby resources are concentrated at the carrier's bottom-tier datacenters is preferred, but when most traffic flows across a carrier network or across different carrier networks, a uniform distribution over the datacenters or over the tiers, respectively, stands out from others.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111 · cited 6×
“With VL2, sending a packet always incurs a directory system lookup for the actual location of the destination.”
InfluentialVL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1594977.1592576 · Cited by 711
Globally distributed content delivery
Dilley, J., Maggs, B., Parikh, J., Prokop, H., Sitaraman, R., & Weihl, B. (2002) · IEEE Internet Computing · doi:10.1109/mic.2002.1036038 · Cited by 691 · cited 2×
“From another perspective, telecommunication carriers, when acting as service providers, may want to place sufficient datacenter resources at the Internet’s edge to improve user-perceived service response time [2].”
BackgroundCloudNaaS: a cloud networking platform for enterprise applications
Benson, T., Akella, A., Shaikh, A., & Sahu, S. (2011) · Proceedings of the 2nd ACM Symposium on Cloud Computing · doi:10.1145/2038916.2038924 · Cited by 206 · cited 4×
“CloudNaaS [8] Excellent Excellent Low Uncertain”
BackgroundInfluentialNetLord: a scalable multi-tenant network architecture for virtualized datacenters
Mudigonda, J., Yalagandula, P., Mogul, J., Stiekes, B., & Pouffary, Y. (2011) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2018436.2018444 · Cited by 133 · cited 5×
“The NetLord architecture provides good scalability and logical isolation between tenants.”
BackgroundInfluentialReliability evaluation for NFV deployment of future mobile broadband networks
Liu, J., Jiang, Z., Kato, N., Akashi, O., & Takahara, A. (2016) · IEEE Wireless Communications · doi:10.1109/mwc.2016.7498079 · Cited by 95 · cited 1×
“Last, the evaluation of the proposed architecture in terms of the reliability performance [15] or the quality of experience is complex but crucial and deserves a second article for a thorough investigation.”
BackgroundElastic network functions: opportunities and challenges
Szabo, R., Kind, M., Westphal, F.-J., Woesner, H., Jocha, D., & Csaszar, A. (2015) · IEEE Network · doi:10.1109/mnet.2015.7113220 · Cited by 70 · cited 1×
“However, the conventional tightly-coupled routing paradigm still prevents the carrier network from intelligently steering traffic flows to fully utilize the benefits of NFV architecture [4].”
Background
Research works printed but not linked: 9
- 0, Ryu Sdn Framework
- 0, Mininet
- 0, Open Vswitch
- 0, SNORT
- 0, Ostinato
- 0, NFV White Paper – ETSI Portal
- 0, AT&T Domain 2 0 Vision White Paper
- peterson, 2015, CORD: Central Office Re-Architected as a Datacenter, IEEE Softwarization eNewsletter
- 0, OpenFlow Switch Specification Version 1 3
Cited by
Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
Wang, X., Han, Y., Leung, V. C. M., Niyato, D., Yan, X., & Chen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2970550 · Cited by 1,498
“For example, with the support of NFV/SDN, edge nodes can be efficiently orchestrated and integrated with cloud data centers [73].”
BackgroundSoftware-Defined Cloud Computing: A Systematic Review on Latest Trends and Developments
Abbasi, A. A., Abbasi, A., Shamshirband, S., Chronopoulos, A. T., Persico, V., & Pescapè, A. (2019) · IEEE Access · doi:10.1109/access.2019.2927822 · Cited by 104
Giorgetti, A., Sgambelluri, A., Casellas, R., Morro, R., Campanella, A., & Castoldi, P. (2019) · Journal of Optical Communications and Networking · doi:10.1364/jocn.12.00a171 · Cited by 65
Dynamic Service Provisioning in the Edge-Cloud Continuum With Bounded Resources
Cohen, I., Chiasserini, C. F., Giaccone, P., & Scalosub, G. (2023) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2023.3271674 · Cited by 48
“These service chains provide a plethora of applications, including infotainment [2], road safety [3] and virtual network functions [5], [8], [9], [10].”
BackgroundNFV Data Centers: A Systematic Review
de Souza, R. R., Dias, K., & Fernandes, S. (2020) · IEEE Access · doi:10.1109/access.2020.2973568 · Cited by 27
“, [36](ID27), [69](ID29), and [80](ID59), none focused on the resiliency aspects of such applications.”
Background
Metadata
- Authors
- Lin, Y.-D., Wang, C.-C., Huang, C.-Y., & Lai, Y.-C.
- Affiliations
- National Yang Ming Chiao Tung University (TW)
- National Kaohsiung University of Science and Technology (TW)
- National Taiwan University of Science and Technology (TW)
- Venue
- IEEE Network
- Published
- 2018-09
- Volume
- 32
- Issue
- 5
- Pages
- 124-130
- ISSN
- 0890-8044 (ISSN-L)
- 1558-156X
- OpenAlex
- W2801183184
- Cited by
- 18
- References
- 7
- Citations by year
- 2026: 1 · 2025: 1 · 2023: 4 · 2022: 2 · 2020: 5 · 2019: 5
- FWCI
- 1.55
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Network (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Optical Network Technologies
- Physical Sciences › Computer Science › Computer Networks and Communications › Caching and Content Delivery
- Keywords
- network function virtualization, resource allocation, software-defined networking, hierarchy, overlay networks, traffic steering, service response time, edge computing, carrier networks
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.