Latency and Mobility–Aware Service Function Chain Placement in 5G Networks


It is anticipated that 5G networks will be able to support a wide variety of cutting-edge services and applications that have diverse quality of service (QoS) requirements. These requirements may include high data transfer rates and low end-to-end (E2E) latency. It is generally accepted that end-to-end (E2E) latency can be decreased by relocating computational capability to locations closer to the edge of the network. However, the limited amount of computational resources of the edge nodes presents a challenge in terms of utilizing these resources in an efficient manner while simultaneously satisfying QoS requirements. In this study, we use mixed-integer linear programming (MILP) techniques to formulate and solve a joint user association, service function chain (SFC) placement, where SFCs are composed of virtualized service functions (VSFs), and resource allocation problem in 5G networks that are composed of decentralized units (DUs), centralized units (CUs), and a core network. SFCs are composed of virtualized service functions (VSFs), and resource allocation problem in 5G networks (5GC). In particular, we analyze and contrast four different strategies for resolving the issue. The E2E latency that users experience can be reduced with the first two approaches, while the cost of providing the service can also be reduced with these approaches. The other two strategies instead focus on reducing the number of VSF migrations and the negative effects those migrations have on the overall quality of the user experience. The third strategy also works to reduce the number of inter-CU handovers. The scalability problem of the MILP-based solutions is then approached with the help of a heuristic that we propose. The effectiveness of the heuristic algorithm that was proposed was demonstrated by the results of simulations.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Near-Optimal Energy-Efficient Algorithm for Virtual Network Function Placement ABSTRACT: Network Function Virtualization, or NFV, is a relatively new networking technology that was developed in the hope that it
PROJECT TITLE : Optimal Sensor Placement for Source Localization: A Unified ADMM Approach ABSTRACT: Source localization is an important part of many different applications, including radar, wireless communications, and communications
PROJECT TITLE : A Learning-based Data Placement Framework for Low Latency in Data Center Networks ABSTRACT: The provision of data services with a low latency is becoming an increasingly important challenge for data center applications.
PROJECT TITLE : Multi-Objective Predictability Based Optimal Placement and Parameters ABSTRACT: Operators of the electrical systems face a difficult problem when it comes to managing uncertainty in their decisions. Systems
PROJECT TITLE : Optimal placement of DG and DSTATCOM ABSTRACT: Due to the increasing depletion of fossil fuels and massive environmental pollution, attention is shifting away from traditional power generation methods and toward

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry