arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.00302cs.DM
收藏

与若干类K-测地计算机网络相关的结构的拓扑分析与综合

Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks

Carlos E. Frasser

AI总结:

本文研究计算机网络拓扑设计中的未解优化问题,提出以k-测地图作为替代方案,并对其若干类网络进行拓扑分析与综合。

摘要:

计算机网络的一个基本特征是其拓扑结构。对计算机网络结构特征进行描述的问题是一个尚未完全解决的问题。针对其运行质量所选参数取极值的计算机网络结构,相应的搜索方法也尚未完全发展成熟。构造具有最优运行质量指标的计算机网络可归结为图上的离散优化问题。本文详细描述了在计算机网络拓扑设计中实际使用k-测地图[2, 3]的优势,将其作为解决上述基本问题的一种替代方案,我们认为这些问题至今仍未解决。此外,本文还对若干类此类网络进行了拓扑分析与综合。

英文摘要:

A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for structures of computer networks, for which the values of the selected parameters of their operation quality are extreme, have not been completely developed. The construction of computer networks with optimum indices of their operation quality is reduced to the solution of discrete optimization problems over graphs. This paper describes in detail the advantages of the practical use of k-geodetic graphs [2, 3] in the topological design of computer networks as an alternative for the solution of the fundamental problems mentioned above which, we believe, are still open. Also, the topological analysis and synthesis of some classes of these networks have been performed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑