{'fraction_non_alphanumeric': 0.021750663129973476, 'fraction_numerical': 0.0, 'mean_word_length': 5.245033112582782, '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}}
Hierarchical Small World Overlay for Efficient Forwarding in Volunteer Clouds

Volunteer cloud is a new paradigm of cloud computing where volunteer resources, i.e. user machines are used instead of (or in addition to) dedicated resources, i.e. data centers. Although volunteer clouds offer potential benefits in terms of energy and cost saving as well as elasticity, the volatility and the scalability of the volunteer resources are still open challenges that need to be studied. In this paper, we focus on optimizing the forwarding process and managing the connectivity in a scalable and dynamic fashion in volunteer clouds. We show that volunteer clouds could be modelled by a small-world structure, characterized by short average path lengths among nodes, and strong local clustering, which implies small latency between nodes and therefore robust forwarding. First, we propose to build a hierarchical small world overlay network supporting scalability and dynamicity constraints of volunteer clouds. Second, we explore the benefits of the use of the Recursive InterNetwork Architecture (RINA) as a networking solution. The advantages that RINA brings comparing to the IP protocol is its recursiveness and its layer management functions. RINA is based on a "divide and conquer" strategy enabling scalability over large networks. On the other hand, in RINA there is a common layer management protocol that could be leveraged to design a flexible and dynamic forwarding management layer to maintain our hierarchical small world overlay network. Finally, simulation experiments are provided to evaluate the performance of our proposal. The results show that our hierarchical small world overlay network, compared to a random based overlay topology, achieves a trade-off between bounding the routing table size and ensuring transmission efficiency i.e., reducing the end-to-end latency.