{'fraction_non_alphanumeric': 0.019021739130434784, 'fraction_numerical': 0.0, 'mean_word_length': 5.981042654028436, '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}}
An entropy-based probabilistic forwarding strategy in Named Data Networking

The forwarding strategy is the key to the resiliency and efficiency of Named Data Networking (NDN), which is a new and fundamental research area. For forwarding strategy, dynamically selecting an optimal interface from multiple alternative interfaces to forward an Interest packet is indeed a multiple attribute decision making (MADM) problem. In this paper, an entropy-based probabilistic forwarding (EPF) strategy is proposed to make a stochastic interface selection based on the combination of interfaces' dynamic availabilities and static routing information, which achieves better load balance in comparison with deterministic interface selection. By objectively assigning weights to attributes and considering multiple real-time network condition metrics, EPF can obtain the availabilities of interfaces more accurately and comprehensively. Since additional network metrics can be easily added and integrated into interfaces' assessment model, EPF provides good extensibility. In addition, we innovatively define two parameters (γ, δ) which can be used to trade off the effect factors between static routing information and dynamic running status of interfaces to customize EPF strategy for different network and application scenarios. Experiments show that EPF can realize preferable load balance and achieve higher throughput compared to the representative BestRoute forwarding strategy.