Service Function Chain Scheduling Under the Multi-Cloud Collaborative Service of Information Networks Used for Cross-Domain Remote Surgery

Remote surgery is an emerging medical business derived from information networking technology and plays an increasingly essential role in the medical system. In remote surgery, it is imperative to facilitate cross-regional information transmission and processing by leveraging medical information net...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE eTransactions on network and service management 2024-08, Vol.21 (4), p.4598-4612
Hauptverfasser: Zhang, Qinghua, Zhang, Xianchao, Chen, Jia, Gao, Deyun, Wu, Yingda, Wang, Yinhao, Huang, Xu, Zhang, Hongke
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Remote surgery is an emerging medical business derived from information networking technology and plays an increasingly essential role in the medical system. In remote surgery, it is imperative to facilitate cross-regional information transmission and processing by leveraging medical information networks to establish a collaborative service model served by multiple data centers in different regions, enabling collaboration and support for surgery operations. Additionally, the implementation of service function chain scheduling technology is crucial for the efficient allocation of computing resources of data centers. In this paper, we design a novel multi-cloud collaborative medical information network framework. Based on this framework, the service function chain (SFC) scheduling problem is investigated to minimize the total weighted end-to-end delay. To solve the scheduling problem, the original problem is reformulated as a Multiple Markov Decision Process (MMDP). Then, a multiple-state-action deep reinforcement learning (MSA-DRL) algorithm is developed to learn the best scheduling policy. Simulation results are presented to demonstrate the superiority of the proposed approach in the aspect of total weighted end to end delay against other benchmark algorithms.
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2024.3424297