Topology Aggregation Algorithm Research Articles

Design and Simulation of a Topology Aggregation Algorithm in Multi-Domain Optical Networks

The aggregate conversion from the complex physical network topology to the simple virtual topology reduces not only load overhead, but also the parameter distortion of links and nodes during the aggregation process, thereby increasing the accuracy of routing. To this end, focusing on topology aggregation of multi-domain optical networks, a new topology aggregation algorithm (ML-S) was proposed. ML-S upgrades linear segment fitting algorithms to multiline fitting algorithms on stair generation. It finds mutation points of stair to increase the number of fitting line segments and makes use of less redundancy, thus obtaining a significant improvement in the description of topology information. In addition, ML-S integrates stair fitting algorithm and effectively alleviates the contradiction between the complexity and accuracy of topology information. It dynamically chooses an algorithm that is more accurate and less redundant according to the specific topology information of each domain. The simulation results show that, under different topological conditions, ML-S maintains a low level of underestimation distortion, overestimation distortion, and redundancy, achieving an improved balance between aggregation degree and accuracy.

Research on MPLS Network Topology Aggregation Algorithm With The Effective Connected Dominating Sets

Using dominating set can aggregate the complex physical network topologies into simple virtual topologies and reduce the cost of the networks. In the Multi-Protocol Label Switching (MPLS) network, the dominating set constructed based on label router can effectively aggregate MPLS network topology and reduce the amount of Label Switching Path (LSP), so as to save the expenses of network maintain information. However, simply considering the size of dominating set can't guarantee the best performance of the networks after aggregating. Therefore, an improved algorithm based on breadth-first search spanning tree is proposed, considering the size of the dominating set, bandwidth performance of the nodes and path length between nodes, which can effectively extend the MPLS network, with excellent bandwidth performance and reduce the data transmission delay.

Topology Aggregation for Hierarchical Wireless Tactical Networks

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

사설망 인터페이스에서 토폴로지 요약 테스트를 위한 시뮬레이터 설계 구현 및 TA 알고리즘 성능분석

Topology information can be constructed hierarchically in the networks and the process of aggregating topology information is known as TA(Topology Aggregation). It is very important for scalability in networks. In paticular, routing and TA algorithm are very much elements on networks performance in private networks to networks interface. Therefore, in this paper, we designed and implemented routing simulator for TA in private networks to networks interface. And we evaluated and analyzed the existent TA algorithm using the implemented simulator. The implemented simulator can be used valuably to developing TA algorithm.

A kind of topology aggregation algorithm in hierarchical wavelength-routed optical networks

In large-scale networks composed of several hierarchical subnetworks, topology aggregation (TA) is implemented for both scalability and security consideration. However, due to the special characteristic of optical wavelength-routed networks, existing TA algorithms cannot be applied directly for topology compression. In this paper, we propose a kind of TA algorithm suitable for hierarchical wavelength-routed optical networks, thereby considering information of residual wavelengths on network links. Basically, our TA algorithm is based on a transition matrix technique for constructing a full mesh topology and asymmetric star approach for a more compact topology. Simulations with randomly-generated networks show that topology information compression can be achieved with a little loss of its accuracy: the ratio of border node pairs with representation deviation being well below 10%. Results also indicate that the advantage of our algorithm is also behaved on reducing the amount of link-state-advertisement (LSA) messages and making networks less vulnerable to propagation delay of these messages over communication links.

A Kind of Topology Aggregation Algorithm in Hierarchical Wavelength-Routed Optical Networks

A Kind of Topology Aggregation Algorithm in Hierarchical Wavelength-Routed Optical Networks