학술논문

Remote Robotic Surgery: Joint Placement and Scheduling of VNF-FGs
Document Type
Conference
Source
2022 18th International Conference on Network and Service Management (CNSM) Network and Service Management (CNSM), 2022 18th International Conference on. :205-211 Oct, 2022
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Greedy algorithms
Tactile Internet
Costs
Simulation
Surgery
Quality of service
Network function virtualization
Remote Robotic Surgery
Network Function Virtualization
Latency
Virtual Network Function
VNF Forwarding Graph
Joint Placement and Scheduling
Language
ISSN
2165-963X
Abstract
Remote robotic surgery is one of the most interesting Tactile Internet (TI) applications. It has a huge potential to deliver healthcare services to remote locations. Moreover, it provides better precision and accuracy to diagnose and operate on patients. Remote robotic surgery requires ultra-low latency and ultra-high reliability. The aforementioned stringent requirements do not apply for all the multimodal data traffic (i.e., audio, video, and haptic) triggered during a surgery session. Hence, customizing resource allocation policies according to the different quality-of-service (QoS) requirements is crucial in order to achieve a cost-effective deployment of such system. In this paper, we focus on resource allocation in a softwarized 5G-enabled TI remote robotic surgery system through the use of Network Functions Virtualization (NFV). Specifically, this work is devoted to the joint placement and scheduling of application components in an NFV-based remote robotic surgery system, while considering haptic and video data. The problem is formulated as an integer linear program (ILP). Due to its complexity, we propose a greedy algorithm to solve the developed ILP in a computationally efficient manner. The simulation results show that our proposed algorithm is close to optimal and outperforms the benchmark solutions in terms of cost and admission rate. Furthermore, our results demonstrate that splitting application traffic to multiple VNF-forwarding graphs (VNF-FGs) with different QoS requirements achieves a significant gain in terms of cost and admission rate compared to modeling the whole application traffic with one VNF-FG having the most stringent requirements.