{'fraction_non_alphanumeric': 0.02857142857142857, 'fraction_numerical': 0.0, 'mean_word_length': 5.043103448275862, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Topology aggregation method for multiple link parameters

In a hierarchical network, each subnetwork advertises its topology information to the other subnetworks. Many studies have been done to minimize the amount of advertised topology information. The existing works assume a logical link can be represented with only a few parameters. However, for the QoS and policy-based networks, more parameters are used to represent the state of a link (e.g., cost, policies). For these networks, with the existing methods, the amount of advertised information linearly increases to the order of the number of link-state parameters. To solve this problem, this work proposes a new topology aggregation method.