检索结果-南通市图书馆

multicommodity flow Modeling for the Data Transmission Scheduling Problem in Navigation Satellite Systems

Complex System Modeling and Simulation 2021年第3期1卷 232-241页

作者： Jungang Yan Lining Xing Chao Li Zhongshan Zhang the College of Systems Engineering National University of Defense TechnologyChangsha 410073China Department of Computer Science KU LeuvenKortrijk 8500Belgium

Introducing InterSatellite Links(ISLs)is a major trend in new-generation Global Navigation Satellite Systems(GNSSs).Data transmission scheduling is a crucial problem in the study of ISL *** existing research on intersatellite data transmission has not considered the capacities of ISL ***,the current study is the first to describe the intersatellite data transmission scheduling problem with capacity restrictions in GNSSs.A model conversion strategy is designed to model the aforementioned problem as a length-bounded single-path multicommodity flow *** integer programming model is constructed to minimize the maximal sum of flows on each intersatellite edge;this minimization is equivalent to minimizing the maximal occupied ISL *** iterated tree search algorithm is proposed to resolve the problem,and two ranking rules are designed to guide the *** based on the BeiDou satellite constellation are designed,and results demonstrate the effectiveness of the proposed model and algorithm.

关键词： intersatellite link navigation satellite system data transmission multicommodity flow tree search

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Improvements on the proof of an approximate scheme for the maximum multicommodity flow problem

Improvements on the proof of an approximate scheme for the m...

引用

2010 4th International Conference on Intelligent Information Technology Application (IITA2010)

作者： Congdian Cheng College of Mathematics and Systems Science Shenyang Normal University Shenyang 110034 People’s Republic of China Zhenpeng Li Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 People’s Republic of China

To approximately solve the maximum multicom-modity flow problem has been attacked since the 50 years of last century. In 2000, according to the framework of Garg and Ko¨nernann, Korte and Vygen presented a scheme for the problem, and showed that it was a full polynomial time approx-imation scheme （FPTAS） to find the flapproximate solutions of the maximum multicommodity flow problem. The present work improves the described contributions of Korte and Vygen.

关键词： network multicommodity flow algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：