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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Lei LEI, Yuefeng JI, Lin GUO, "Asymmetric Attribute Aggregation in Hierarchical Networks" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 8, pp. 2034-2045, August 2007, doi: 10.1093/ietcom/e90-b.8.2034.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.8.2034/_p
Copy
@ARTICLE{e90-b_8_2034,
author={Lei LEI, Yuefeng JI, Lin GUO, },
journal={IEICE TRANSACTIONS on Communications},
title={Asymmetric Attribute Aggregation in Hierarchical Networks},
year={2007},
volume={E90-B},
number={8},
pages={2034-2045},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e90-b.8.2034},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - Asymmetric Attribute Aggregation in Hierarchical Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2034
EP - 2045
AU - Lei LEI
AU - Yuefeng JI
AU - Lin GUO
PY - 2007
DO - 10.1093/ietcom/e90-b.8.2034
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2007
AB - 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.
ER -