Asymmetric Attribute Aggregation in Hierarchical Networks

Beijing University of Posts and Telecommunications, Peping, Beijing, China
IEICE Transactions on Communications (Impact Factor: 0.23). 08/2007; E90B(8). DOI: 10.1093/ietcom/e90-b.8.2034
Source: OAI


To achieve scalability and security, large networks are often structured hierarchically as a collection of domains. In hierarchical networks, the topology and QoS parameters of a domain have to be first aggregated before being propagated to other domains. However, topology aggregation may distort useful information. Although spanning tree aggregation can perfectly encode attribute information of symmetric networks, it can not be applied to asymmetric networks directly. In this paper, we propose a spanning tree based attribute aggregation method for asymmetric networks. The time complexity of the proposed method and the space complexity of its resulted aggregated topology are the same with that of the spanning tree aggregation method in symmetric networks. This method can guarantee that the attributes of more than half of the links in the networks are unaltered after aggregation. Simulation results show that the proposed method achieves the best tradeoff between information accuracy and space complexity among the existing asymmetric attribute aggregation methods.

3 Reads
  • Source
    • "첫 번째는 비대칭 양방향 링크의 풀 메쉬를 단방향 링크를 가진 두 개의 풀 메쉬로 분할한다. 분할 특성은 DSTA[6] "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this study, we present a method for efficiently aggregating network state information. It is especially useful for aggregating links that have both delay and bandwidth in an asymmetric network. Proposed method reduces the information distortion of logical link by integration process after similar measure and grouping of logical links in multi-level topology transformation to reduce the space complexity. It is applied to transform the full mesh topology whose Service Boundary Line (SBL) serves as its logical link into a spanning tree topology. Simulation results show that aggregated information accuracy and query response accuracy are higher than that of other known method.
    Preview · Article · Dec 2011 · The KIPS Transactions PartC
  • [Show abstract] [Hide abstract]
    ABSTRACT: In an optical network, the connections are generally bidirectional, but their QoS parameters in each direction may be not the same. In this paper, we propose an enhanced algorithm called Node Label Order First (NLOF), which can maintain asymmetrical information and guarantee availability of the compressed topology. Besides, a decoding algorithm to restore the compressed topology named Average Proportional point (AP) is also proposed, which not only retains the space complexity of the aggregation process but also improves the accuracy of the restored information. Simulation results show that combing NLOF with AP can balance the contradiction between space complexity of the aggregation algorithm and routing accuracy. KeywordsMulti-domain–Topology aggregation–Asymmetric–Direction–Decoding
    No preview · Article · Feb 2011 · Photonic Network Communication
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O(N3) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.
    No preview · Article · Aug 2015 · Journal of Communications and Networks