Adaptive Interference-Aware VNF Placement for Service-Customized 5G Network Slices

Zhang, Qixia; Liu, Fangming; Zeng, Chaobing

doi:10.1109/infocom.2019.8737660

Cited by 133 publications

(64 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…2) SGHP. The second scheduler, shortened greedy heuristic policy (SGHP), adapts the most recent existing heuristics SGH [15] and SPH [7] which do not require any a priori information like arrival rate or resource demand of a request. Upon receiving a packet, SGHP extends the routing path iteratively and selects the next SFI among all possible site-local ones which is likely to provide the shortest delay to serve the packet based on link latency and queue state information.…”

Section: A Algorithms Compared Againstmentioning

confidence: 99%

“…NSF's 18-535 [1] and EU's ICT-20 [2] calls for proposals detail the demand for providing such end-to-end network services, which steer packets through sequences of service function instances (SFIs), referred to as service function chains (SFCs) [3]. However, one missing component towards these visions, especially considering that service functions (SFs) increasingly include application-specific services [4]- [6], are SFCs provisioning mechanisms [1], [7], [8], that are capable of creating SFC instances, and scheduling traffic through them, on the fly [1]. This requires making decision on both (1) placement of SFIs and (2) scheduling of traffic through them [9].…”

Section: Introductionmentioning

confidence: 99%

“…Few dynamic solutions are discussed [7], [8], [16]- [19], in which the deployment of these SFIs and their resource assignments are periodically adapted to changes in network traffic and topology, as required for future carrier networks. However, these solutions are still coarse-grained [17], where the adaptation takes seconds to take effect [19], or cannot be applied in real time due to its high complexity [7] and the involvement of disruptive SFIs migration [17]. Therefore, these proposals are not able to explore and exploit the resources that become available on the fly as a result of real-time, sudden, changes in network traffic.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Letting off STEAM: Distributed Runtime Traffic Scheduling for Service Function Chaining

Blöcher

Khalili

Wang

et al. 2020

IEEE INFOCOM 2020 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Network function virtualization has introduced a high degree of flexibility for orchestrating service functions. The provisioning of chains of service functions requires making decisions on both (1) placement of service functions and (2) scheduling of traffic through them. The placement problem (1) can be tackled during the planning phase, by exploiting coarsegrained traffic information, and has been studied extensively. However, runtime traffic scheduling (2) for optimizing system utilization and service quality, as required for future edge cloud and mobile carrier scenarios, has not been addressed so far. We fill this gap by presenting a queuing-based system model to characterize the runtime traffic scheduling problem for service function chaining. We propose a throughput-optimal scheduling policy, called integer allocation maximum pressure policy (IA-MPP). To ensure practicality in large distributed settings, we propose multi-site cooperative IA-MPP (STEAM), fulfilling runtime requirements while achieving near-optimal performance. We examine our policies in various settings representing realworld scenarios. STEAM closely matches IA-MPP in terms of throughput, and significantly outperforms (possible adaptations of) existing static or coarse-grained dynamic solutions, requiring 30%-60% less server capacity for similar service quality. Our STEAM prototype shows feasibility running on a standard server.

show abstract

Section: A Algorithms Compared Againstmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Letting off STEAM: Distributed Runtime Traffic Scheduling for Service Function Chaining

Blöcher

Khalili

Wang

et al. 2020

IEEE INFOCOM 2020 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…The development of improved algorithms to assist in the deployment and operation of virtualised network functions is a highly active research area. A method for customised VNF placement is proposed in 5G networks [16], showing that due to the diverse performance requirements among different 5G scenarios, an adaptive VNF placement approach is needed to accommodate service-specific requirements automatically. In addition to placement, scaling algorithms can also enhance the operation of VNFs.…”

Section: Related Workmentioning

confidence: 99%

The Next Generation Platform as A Service: Composition and Deployment of Platforms and Services

et al. 2019

View full text Add to dashboard Cite

The emergence of widespread cloudification and virtualisation promises increased flexibility, scalability, and programmability for the deployment of services by Vertical Service Providers (VSPs). This cloudification also improves service and network management, reducing the Capital and Operational Expenses (CAPEX, OPEX). A truly cloud-native approach is essential, since 5G will provide a diverse range of services - many requiring stringent performance guarantees while maximising flexibility and agility despite the technological diversity. This paper proposes a workflow based on the principles of build-to-order, Build-Ship-Run, and automation; following the Next Generation Platform as a Service (NGPaaS) vision. Through the concept of Reusable Functional Blocks (RFBs), an enhancement to Virtual Network Functions, this methodology allows a VSP to deploy and manage platforms and services, agnostic to the underlying technologies, protocols, and APIs. To validate the proposed workflow, a use case is also presented herein, which illustrates both the deployment of the underlying platform by the Telco operator and of the services that run on top of it. In this use case, the NGPaaS operator facilitates a VSP to provide Virtual Network Function as a Service (VNFaaS) capabilities for its end customers.

show abstract

“…[7] proposes an Integer Linear Programming (ILP) model for VNF placement that considers latency requirements of SCs with the objective of minimizing resource utilization. Authors in [8] propose a heuristic algorithm for VNF placement to consider VNF interference caused by VNF consolidation. Their algorithm tries to maximize the throughput of provisioned service requests.…”

Section: Related Workmentioning

confidence: 99%

A Techno-Economic Evaluation of VNF Placement Strategies in Optical Metro Networks

Askari

Musumeci

Tornatore

2019

2019 4th International Conference on Computing, Communications and Security (ICCCS)

View full text Add to dashboard Cite

Network Function Virtualization (NFV) has changed the way operators can provision network services. Decoupling network functions from dedicated hardware and running them on software, on top of commodity servers and switches, not only helps operators have more flexible and easy-to-manage networks, but also reduces their capital and operational expenditures. This is especially true for incoming 5G services, characterized by ultra-low latency, high reliability and bandwidth requirements. To satisfy these challenging requirements, multi-layer optical networks based on Optical Transport Network (OTN) over wavelength division multiplexing (WDM) are being deployed in the metro segment to support 5G services. In addition, the possibility to equip metro nodes with computing capabilities, enabled by new paradigms such as CORD (Central Office Re-architected as a Datacenter) is being exploited. In this scenario, an efficient placement of Virtual Network Functions (VNFs) for Service Chain (SC) provisioning within the metro network is needed, and different VNF placement strategies can lead to different costs for network operators. In this paper we analyze the impact of different VNF placement strategies on the optical metro network cost, considering specific Service Level Agreement (SLA) requirements, expressed in terms of service blocking probability. We provide a cost model which takes into consideration both capital and operational expenditures. Through extensive numerical results, we quantify the impact of using a cost-effective VNF placement strategy in decreasing network cost while meeting the desired SLA performance.

show abstract

Adaptive Interference-Aware VNF Placement for Service-Customized 5G Network Slices

Cited by 133 publications

References 23 publications

Letting off STEAM: Distributed Runtime Traffic Scheduling for Service Function Chaining

Letting off STEAM: Distributed Runtime Traffic Scheduling for Service Function Chaining

The Next Generation Platform as A Service: Composition and Deployment of Platforms and Services

A Techno-Economic Evaluation of VNF Placement Strategies in Optical Metro Networks

Contact Info

Product

Resources

About