{'fraction_non_alphanumeric': 0.013623978201634877, 'fraction_numerical': 0.0, 'mean_word_length': 5.5625, '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}}
Routing to enhance traffic capacity for scale-free networks with tunable clustering

In this paper, for the optimization of transport on scale-free networks with tunable clustering, a new routing algorithm is investigated. The algorithm can balance the traffic on complex networks by minimizing the maximum node betweenness centrality in a small number of iteration steps for convergence and with little path lengthening. The simulations show that the traffic congestion is effectively alleviated and the traffic capacity is greatly enhanced in a model of scale-free networks with different clustering coefficients, the results also demonstrated that the more clustered network, the lower efficiency for the transportation of packets.