• The Journal of Korean Association of Computer Education
• /
• v.13 no.5
• /
• pp.81-90
• /
• 2010

Cloud computing is an Internet-based computing paradigm that provides services in a virtualized form composed of plenty of resources sharable. In Cloud computing environments, gossip protocols are engaged as a method to rapidly disseminate the state information for innumerable resources. Although gossip protocols provide a robust and scalable multicast, there is a drawback that requires redundant messages in satisfying 100% of reachability. In our study, we propose a Group-based Gossip Multicast Protocol in order to reduce the message overhead while delivering the state information efficiently. Furthermore, we verified the performance of the proposed protocol through experiments.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.11-22
• /
• 2010

In case that group communication protocols assume every process is interested in all events occurring in a large scale group, the events multicasting to a subset of a large process group, such as a sensor network, potentially varying for every event based on their interests might lead to very high communication overhead on each individual process. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped group using gossip based group communication for multicasting in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present a new gossip-based causal message order guaranteeing multicast protocol based on local views and delegates representing subgroups and fully utilizing multi-group features to improve scalability. In the proposed protocol, the message delivery order in overlapped groups has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, these features of the proposed protocol might be significantly scalable rather than those of the protocols guaranteeing atomic order dependencies between multicast messages by hierarchical membership list of dedicated groups like traditional committee protocols and much stronger rather than fully decentralized protocols guaranteeing dependencies between multicast messages based on only local views. And the proposed protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.619-622
• /
• 2009

P2P networks are undergoing rapid progress and inspiring numerous developments by gossip-based protocol. Gossip-based protocols for group communication have attractive scalability and reliability properties. We propose a self-organizing algorithm in the sense that the size of neighbor list achieved without any node knowing the group size. We also propose an efficient mechanism to reduce the redundancy of the system by backing up the nodes in the neighbor list. We present the design, theoretical analysis, and a detailed evaluation of the proposed algorithm and its refinements.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.299-300
• /
• 2010

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.215-221
• /
• 2011

Communication infrastructure of wireless sensor networks significantly tends to depend on application requirements. Gossip communication is becoming one of the promising solutions for addressing its scalability problems in providing information propagation functionality based on the P (publish)/S (subscribe) paradigm. In particular, despite the importance of both guaranteeing message delivery order required and supporting overlapping groups in sensor networks, there exist little research works on development of gossip-style dissemination protocols to satisfy all these requirements. In this paper, we present the latest causal information transmission protocol between publishers and subscribers for overlapping groups. In this protocol, sensor leaders as publishers might guarantee consistently causally ordered message delivery among themselves by aggregating causality information. On the other hand, only the latest causal information piggybacked on each multicast message is transmitted from publishers to subscribers through gossip-style dissemination. Its scalability feature might be highly suitable for the area of the applications requiring only the minimum meaningful information.