移动网络中卫星链路容量规划的启发式方法

S. Krile, M. Kos
{"title":"移动网络中卫星链路容量规划的启发式方法","authors":"S. Krile, M. Kos","doi":"10.1109/ITI.2001.938038","DOIUrl":null,"url":null,"abstract":"Taking into account the continuous increase of traffic demands, it is necessary to increase satellite link capacity rationally. An efficient algorithm for sizing of N satellite links in mobile networks during exploitation is being developed, minimizing the total expansion cost. Capacity shortages are allowed so the problem is denoted as CEPS (Capacity Expansion Problem with Shortages). Using a network flow approach, the paper develops all possible expansion solutions for SPEP (Single Period Expansion Problem) and properties of extreme point solution are identified. The extreme flow theory enables separation of these extreme flows which can be a part of an optimal expansion solution from those which cannot. Such a heuristic approach enables the optimal result, using significantly less effort in programming and algorithm development. Our heuristic algorithm is compared with an algorithm based on an exact approach through many numerical examples. It is obvious that it is very effective, providing an optimal result with reasonable effort. The algorithm can be applied to short- or medium-term satellite network planning with a finite number of discrete time periods.","PeriodicalId":375405,"journal":{"name":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A heuristic approach to satellite link capacity planning applied in mobile networks\",\"authors\":\"S. Krile, M. Kos\",\"doi\":\"10.1109/ITI.2001.938038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Taking into account the continuous increase of traffic demands, it is necessary to increase satellite link capacity rationally. An efficient algorithm for sizing of N satellite links in mobile networks during exploitation is being developed, minimizing the total expansion cost. Capacity shortages are allowed so the problem is denoted as CEPS (Capacity Expansion Problem with Shortages). Using a network flow approach, the paper develops all possible expansion solutions for SPEP (Single Period Expansion Problem) and properties of extreme point solution are identified. The extreme flow theory enables separation of these extreme flows which can be a part of an optimal expansion solution from those which cannot. Such a heuristic approach enables the optimal result, using significantly less effort in programming and algorithm development. Our heuristic algorithm is compared with an algorithm based on an exact approach through many numerical examples. It is obvious that it is very effective, providing an optimal result with reasonable effort. The algorithm can be applied to short- or medium-term satellite network planning with a finite number of discrete time periods.\",\"PeriodicalId\":375405,\"journal\":{\"name\":\"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITI.2001.938038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd International Conference on Information Technology Interfaces, 2001. ITI 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITI.2001.938038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

考虑到业务需求的持续增长,有必要合理增加卫星链路容量。研究了一种有效的移动网络中N条卫星链路的扩展算法,使扩展总成本最小化。容量短缺是允许的,所以这个问题被记作cceps(短缺的容量扩展问题)。利用网络流方法,给出了单周期展开问题的所有可能展开解,并给出了极值点解的性质。极值流理论可以将这些极值流从那些不能成为最优膨胀解的极值流中分离出来。这样的启发式方法可以在编程和算法开发中显著减少工作量,从而实现最佳结果。通过许多数值算例,将启发式算法与基于精确逼近的算法进行了比较。很明显,它是非常有效的,以合理的努力提供了最佳的结果。该算法可用于有限离散时段的中短期卫星网络规划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A heuristic approach to satellite link capacity planning applied in mobile networks
Taking into account the continuous increase of traffic demands, it is necessary to increase satellite link capacity rationally. An efficient algorithm for sizing of N satellite links in mobile networks during exploitation is being developed, minimizing the total expansion cost. Capacity shortages are allowed so the problem is denoted as CEPS (Capacity Expansion Problem with Shortages). Using a network flow approach, the paper develops all possible expansion solutions for SPEP (Single Period Expansion Problem) and properties of extreme point solution are identified. The extreme flow theory enables separation of these extreme flows which can be a part of an optimal expansion solution from those which cannot. Such a heuristic approach enables the optimal result, using significantly less effort in programming and algorithm development. Our heuristic algorithm is compared with an algorithm based on an exact approach through many numerical examples. It is obvious that it is very effective, providing an optimal result with reasonable effort. The algorithm can be applied to short- or medium-term satellite network planning with a finite number of discrete time periods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信