ID 原文 译文
5374 其次，提出和详细阐述新型切换机制的信令交互流程，并分别建立新型切换机制与传统切换机制中数据传输时序模型； Then, the novel mechanism's signaling interaction was elaborated and the time se-quence models for the novel scheme and the legacy scheme were further established.
5375 最后，基于数据传输时序模型，用数学推导和仿真的方法对新型机制与传统机制进行对比评估，相关结果显示出新型机制在单个数据分组传输时延、数据分组平均传输时延和数据分组总传输时延三方面的优势。 Finally, based on the time sequencemodel, the performance evaluation processes were carried out in terms of mathematical modeling and experimental sim-ulations. The analysis results demonstrate that the proposed novel scheme reduces the single packet transmission delay,the average transmission delay and the total transmission delay, and has good performance advantages.
5376 为解决双层卫星网络高、低轨卫星间的组网认证问题，提出了一种安全、高效的星间组网认证方案。 To solve the issue of networking authentication among GEO and LEO satellites in double-layer satellite network,a secure and efficient authenticated key agreement scheme was proposed.
5377 该方案基于对称加密设计，能够在无可信第三方参与的情况下，实现高、低轨卫星间的信任建立和安全通信。 Based on symmetric encryption, the proposedscheme can achieve trust establishment and secure communication between satellites without the trusted third party.
5378 针对卫星网络时钟高度统一、节点运行轨迹可预测的场景特点，设计了认证预计算机制，有效提升了星间组网的认证效率。 Mean-while, considering characteristics of highly unified clock and predictable satellite trajectory in satellite networks, apre-calculation method was designed, which can effectively improve the authentication efficiency of satellite networking.
5379 形式化证明与安全性分析表明，所提方案能够满足卫星在组网阶段的多种安全需求。 Moreover, formal proof and security analysis demonstrate that the scheme can satisfy various security requirements duringsatellite networking.
5380 性能分析及仿真结果显示，所提方案具有较低的计算和通信开销，能够实现卫星在资源有限场景下的安全组网认证。 Performance analysis and simulation results show that the scheme has low computation and communi-cation overhead, which can achieve the authentication of satellite networking in resource-limited scenarios.
5381 服务功能链技术通过对虚拟网络功能的编排来支持灵活的网络服务请求。 Service function chain can support flexible network service requirement by linking virtual network functions.
5382 针对资源有限网络中的服务功能链部署问题，提出了一种基于最优加权图匹配的服务功能链部署方法， Aiming at the problem of service function chain deployment in a resource-constrained network, an algorithm for servicefunction chain deployment based on optimal weighted graph matching was proposed.
5383 把服务功能链组合为功能拓扑图，利用邻接矩阵特征向量分解算法获取功能拓扑与物理拓扑的加权图匹配方式，并通过爬山算法对匹配结果进一步优化。 The service function chains was composed into graphs of functional topography, and the optimal matching results between graphs of functional topologyand physical topology was obtained using eigendecomposition approach, and furtherly the matching results byhill-climbing method was optimized.