Hierarchical Algorithms Design And Simulation Of Network Topology

Planning the evolution of a large communications network requires a variety of approximations and estimates. A demand forecast for the various services is required, as well as low-level service planning assumptions. The number and location of sites containing equipment is typically uncertain, as are equipment capacities, due to frequent vendors' upgrades. Hence, a detailed trunking plan early in the planning process is less valuable than the capability to quickly estimate the trunking cost of various scenarios. With the improvement of computing performance, the performance of the interconnection network also continue to improve. And the increasing size of the computer network, the network interconnection issues have become more serious. These problems prompted the hierarchical network topology and the in-depth research continually advance.This paper studied the subject for the performance of a class can be used in computer networks, such as road traffic on the topology of the optimal design. In the model of Eric Rosenberg, there is a method for designing a network interconnecting n nodes, under the constraints that the network is single node survivable, the diameter is bounded by some specified bound d, and the maximum node degree is bounded by some specified bound A.The major work has done in the following areas:(1) Paper introduced network topology and the related concepts of graph theory and the basic situation of routing algorithm, describe and analysis the algorithm on the topological network topology by Eric Rosenberg's research paper;(2) According to the network topology models and algorithms, using concepts and relevant knowledge of graph theory to solve the ploblem. on the issue of the smaller networks, we use the implicit enumeration method in network topology optimal design, calculation and simulation of the original method which can be used as recursive exports smaller networks, and draw Matlab simulation map;(3) This paper improved the algorithms of Spare ports and backbone degree, and simulation experiments prove the feasibility of the algorithm. Discussed the nature of the 2 diameter connectivity graph, and using it to research the network topology. Thus it improved the original method of recursive equation.(4) Finally, the algorithms of expansion and routing of this topology networks has been researched, and simulation has been taken out.