| 一种通用的计算机网络拓扑设计模型 |
| |
| 引用本文： | 杜开珍.一种通用的计算机网络拓扑设计模型[J].电子科技大学学报(社会科学版),1991(1). |
| |
| 作者姓名： | 杜开珍 |
| |
| 作者单位： | 电子科技大学无线电技术系 |
| |
| 摘 要： | 提出了一种计算机网络拓扑设计的数学模型。该模型综合考虑拓扑设计中的几个主要问题,它能同时完成节点机选择、骨干网络的链路安排及各通信节点对之间的路由选择等问题的优化工作。文中同时给出该模型的拉格朗日松弛函数 L(?),并利用迭代算法使 L(?)尽可能靠近原模型的优化位。
|
| 关 键 词： | 拓扑设计模型 拉格朗日松弛 次梯度迭代 组合优化 |
A GENERAL MODEL FOR THE TOPOLOGICAL DESIGN OF COMPUTER NETWORKS |
| |
| Du Kaizhen.A GENERAL MODEL FOR THE TOPOLOGICAL DESIGN OF COMPUTER NETWORKS[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),1991(1). |
| |
| Authors: | Du Kaizhen |
| |
| Institution: | Dept.of Radio Technology |
| |
| Abstract: | A mathematical model for the topological design of computer networks is pres-ented.It considers some of the main design problems simutaneously such as the selection ofnode processors,the link assigment for backbone networks and routing for all communicationpairs.The lagrangean relaxation and the subgradient optimization for this model are also pres-ented,which produce a good lower bound to the optimal solution. |
| |
| Keywords: | topological design model Lagrangean relaxation subgradient iteration combinatorial optimization |
| 本文献已被 CNKI 等数据库收录！ |
