考虑抗毁性及业务需求的站址规划算法

doi:10.3724/SP.J.1087.2005.01704

计算机应用 ›› 2005, Vol. 25 ›› Issue (07): 1704-1706.DOI: 10.3724/SP.J.1087.2005.01704

考虑抗毁性及业务需求的站址规划算法

高京伟

中国电子科技集团公司第54研究所

收稿日期:2005-01-07 修回日期:2005-03-08 发布日期:2005-07-01 出版日期:2005-07-01
作者简介:高京伟（1970-），男，河北赵县人，工程师，硕士，主要研究方向：网络规划、网络管理

An algorithm for designing communication station to meet service requirement and destroy-resistance target

GAO Jing-wei

No.54th Research Institute, China Electronics Technology Group Corporation

Received:2005-01-07 Revised:2005-03-08 Online:2005-07-01 Published:2005-07-01

摘要/Abstract

摘要：

基于用户分布已知的条件下，提出考虑抗毁性和业务分布的图的分离方法；提出折中考虑地理复杂度、抗毁性和业务量的链路重要性衡量指标——链路权衡因子LWF；提出相交圆算法寻找干线节点的实际可行位置；以及寻找网络相对业务中心的虚拟小区方法。站址的规划设计是与地理信息系统紧密结合进行的，这样设计出的结果将是可行的、可用的。

关键词: 站址规划, 割集, 抗毁分离, 饱和分离, 链路权衡因子(LWF), 虚拟小区(VC)

Abstract:

The separation method of the graph was proposed for improving destroy-resistance and throughput at the assumption of known user distribution. Link Weight Factor (LWF) that eclectically thinks over geography complexities, destroyresistance and portfolio is defined. Putting forward the intersection circle algorithm that seeks the feasible seat of nodes and virtual cell algorithm that seeks the service center.The Communication Station design closely combines with the geography information systems, therefore the result is feasible and available.

Key words: communication station design, cutset, destroy-resistance separation, saturation separation, Link Weight Factor (LWF, Virtual Cell(VC)

中图分类号:

高京伟. 考虑抗毁性及业务需求的站址规划算法[J]. 计算机应用, 2005, 25(07): 1704-1706.

GAO Jing-wei. An algorithm for designing communication station to meet service requirement and destroy-resistance target[J]. Journal of Computer Applications, 2005, 25(07): 1704-1706.

考虑抗毁性及业务需求的站址规划算法

An algorithm for designing communication station to meet service requirement and destroy-resistance target

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

编辑推荐

Metrics