{'fraction_non_alphanumeric': 0.01707317073170732, 'fraction_numerical': 0.0, 'mean_word_length': 5.0814814814814815, '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}}
COLM: Overlay Multicast on Vertex-disjoint Subgraph of Cayley Graph

The study on the overlay multicast protocol based on Cayley graph's spanning tree, namely Cayley Overlay multicast (COLM) is proposed. The overlay multicast tree structure is built with the efficient algorithms which can comprise vertex disjoint path on Cayley graph. Because the proposed structure is based on a specific Cayley graph with constant degree and logarithmic diameter, the message forwarding path can make use of the vertex disjoint spanning tree which makes the shortest path in the point-to-point communication independent of the total number of nodes in the network. The extensive simulation to imitate the real Internet data is also present. The results show that COLM is good for message multicasting at overlay and has low overhead.