IEEE INFOCOM 2023 – IEEE Conference on Computer Communications Workshops · Conference workshop paper · 2023
Authors: Yilu Cao, Ziye Jia, Chao Dong, Yanting Wang, Jiahao You, Qihui Wu
Published in: IEEE INFOCOM 2023 – IEEE Conference on Computer Communications Workshops, Hoboken, NJ, USA, pp. 1–6.
Authorship: Coauthor / 合作作者
DOI: 10.1109/INFOCOMWKSHPS57453.2023.10226168
Research overview
This paper studies how service function chains can use heterogeneous space, air, and ground resources through a matching-game deployment strategy.
The problem
Dynamic connectivity and heterogeneous nodes make it difficult to share resources across multiple services. A task may require several virtual network functions to be placed in an appropriate sequence.
The approach
A reconfigurable time-extension graph represents network dynamics. The service-chain completion objective is first formulated as a mixed-integer linear program, then addressed through many-to-one two-sided matching and a Gale–Shapley-based algorithm.
Evaluation
Simulations examine service-chain deployment and resource utilization. Full network settings, constraints, and baseline comparisons are provided in the workshop paper.
基于匹配博弈的空天地一体化网络服务功能链部署
本文研究利用匹配博弈部署服务功能链，以协同使用空、天、地异构资源。
研究问题
动态连接与节点异构性增加了多业务资源共享的难度。每项任务可能需要按顺序部署多个虚拟网络功能。
研究方法
论文通过可重构时间扩展图描述网络动态，将服务链完成目标建模为混合整数线性规划，再转化为多对一双边匹配问题，并设计基于 Gale–Shapley 的算法。
研究评估
论文通过仿真考察服务链部署与资源利用。完整网络设置、约束条件和基线比较见研讨会原文。
中文题名为便于阅读所作的译名，正式引用请使用英文原题。
Citation
[1] Y. Cao, Z. Jia, C. Dong, Y. Wang, J. You, and Q. Wu, “SFC deployment in space-air-ground integrated networks based on matching game,” in Proc. IEEE Conf. Comput. Commun. Workshops (INFOCOM WKSHPS), Hoboken, NJ, USA, 2023, pp. 1–6, doi: 10.1109/INFOCOMWKSHPS57453.2023.10226168.
