Hierarchical CORD for NFV Datacenters: Resource Allocation with Cost-Latency Tradeoff

Ying-Dar Lin*, Chih Chiang Wang, Chien Ying Huang, Yuan Cheng Lai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

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.

Original languageEnglish
Article number8337815
Pages (from-to)124-130
Number of pages7
JournalIEEE Network
Volume32
Issue number5
DOIs
StatePublished - 1 Sep 2018

Fingerprint Dive into the research topics of 'Hierarchical CORD for NFV Datacenters: Resource Allocation with Cost-Latency Tradeoff'. Together they form a unique fingerprint.

Cite this