Stamping Approaches to Efficient Broadcast for Unstructured Overlay Networks

• Main Authors: Chung-Yu Lee, 李崇右
• Other Authors: Chun-Hsin Wu
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/01310360034197491148

碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 99 === Since there is no efficient structure to support communication in peer-to-peer unstructured overlay networks, broadcasting is a primitive mechanism of communication for the networks, even for unicast and multicast among the nodes. For this reason, how to broadcast efficiently has become a fundamental, important issue for unstructured overlay networks. At present most unstructured networks rely on message flooding to communicate. In spirit of redundancy, message flooding always supports high delivery ratio, but it often makes the networks very congested. Having messages with time-to-live (TTL) stamp is thus widely adopted to avoid unlimited flooding. Prior researches also mainly focus on adapting TTL values intelligently and efficiently. In this study, we propose a new, simple idea to stamp identities in messages to avoid redundant broadcast. We evaluate several stamping approaches to improve broadcast efficiency of unstructured overlay networks, and we also propose many compression methods like bloom filters to reduce stamping cost. The simulation results show that trace stamping can reduce redundant broadcast messages dramatically, and stamp reduction and compression can reduce stamping cost significantly for unstructured overlay networks.