Maximum Flow Routing Strategy for Space Information Network With Service Function Constraints

IEEE Transactions on Wireless Communications(2022)

引用 14|浏览9
暂无评分
摘要
In this paper, we investigate the maximum flow routing strategy with the service function chain (SFC) constraints in the space information networks (SINs), where a SFC consists of a specific ordered sequence of service functions, and the mission flow must go through these functions in a predefined order. The time-varying SIN is modeled by the time-expanded graph (TEG). We formulate the maximum flo...
更多
查看译文
关键词
Routing,Complexity theory,Satellites,Wireless communication,Network topology,Service function chaining,Residual neural networks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要