• Smart Media Journal
• /
• v.3 no.1
• /
• pp.9-15
• /
• 2014

In these days, along with the extreme popularity of online social network services, it becomes an important problem understanding the role of social network in the research of message dissemination. Past studies of message dissemination over online social network services mostly consider the coverage of message dissemination and the methods to maximize it. But, these works lack of the consideration of the impact of multi channel social network, which has multiple communication channel with distinct properties of message transfer and various users with distinct channel preferences. In this paper, the new message dissemination model over multi-modal multi-channel social network, the Delay Weighted Independent Cascade Model, is proposed. The proposed model considers various channels including online social network service, email, SMS messaging, phone and mouth-to-mouth and their distinct message transfer properties. In order to consider the various user properties, the different value of probability of forwarding a message and the different preference of communication channel is considered. Moreover, the proposed model considers the distribution of user location and allows to analyze the properties of message dissemination under various scenarios. Based on the proposed model, a message dissemination simulator is generated and the message disseminations on various scenarios are analyzed.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.783-793
• /
• 2010

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collisions at the link layer due to an excessive number of broadcast packets. We present a fuzzy alert message dissemination algorithm to improve performance for road safety alert application in Vehicular Ad-hoc Network (VANET). In the proposed algorithm, when a vehicle receives an alert message for the first time, the vehicle rebroadcasts the alert message according to the fuzzy control rules for rebroadcast degree, where the rebroadcast degree depends on the current traffic density of the road and the distance between source vehicle and destination vehicle. Also, the proposed algorithm is the hybrid algorithm that uses broadcast protocol together with token protocol according to traffic density. The performance of the proposed algorithm is evaluated through simulation and compared with that of other alert message dissemination algorithms.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.95-103
• /
• 2003

Event notification service is a event-based messaging middle ware service needed for various vertical domains, such as, business applications, distributed system management, and web service integration. In this paper, we investigate the architecture of an event notification service that includes a subject-based event dissemination service and a flexible message communication service. The event dissemination service is in charge of transferring events asynchronously but speedy according to the subjects of events and their environmental knowledge. It also includes content-based message filtering. The message communication service provides a common communication infrastructure supporting variety types of messages and variety of protocols. Depending on application domains and situation, we can re-configurate the communication infrastructure in order to optimize the efficiency and usability. This paper shows the performance analysis of our event notification service with various types of message formats and protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1990.04a
• /
• pp.312-325
• /
• 1990

This paper addresses the process of information dissemination in a network whereby a message, originated at a node, is transmitted to all other nodes of the network. We restrict our attention to a speccial type of dissemination process,called 'local broadcasting', where a vertex can either transmit or receive a message and an informed vertex can transmit it to only one of its neighbors at a time. Based on the recently published results for a tree by Koh and Tcha, this paper proposes an efficient heuristic which determines the call sequence at each vertex node under both minimax and minisum criteria. Computational experiments with this heuristic are conducted on a variety of networks of medium size.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.109-129
• /
• 1999

This study deals with the problem of information dissemination in a communication network, which is defined to be the process whereby a set of messages, generated by an originator, is transmitted to all the members within the network. Since this type of message generally includes control data to manage the network or global information that all members should know, it is to be required to transmit it to all the members as soon as possible. In this study, it is assumed that a member can either transmit or receive a message and an informed member can transmit it to only one of its neighbors at time. This type of transmission is called 'local broadcasting' Several schemes of call sequencing are designed for a general-type network with nonuniform edge transmission times, and then computer simulations are performed. Some heuristics for information dissemination are proposed and tested. For this, optimal call sequence in a tree-type network, sequencing theory and graph theory are applied. The result shows that call sequencing based on the shortest path tree is the most desirable.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.201-208
• /
• 2005

Event notification service is a event-based messaging middleware service needed for various vertical domains, such as, business applications, distributed system management, and web service integration. In this paper, we investigate the architecture of an event notification service that includes a subject-based event dissemination service and a flexible message communication service. The event dissemination service is in charge of transferring events asynchronously but speedy according to the subjects of events and their environmental knowledge. It also includes content-based message filtering. The message communication service provides a common communication infrastructure supporting variety types of messages and variety of protocols. Depending on application domains and situation, we can re-configurate the communication infrastructure in order to optimize the efficiency and usability. This paper shows the performance analysis of our event notification service with various types of message formats and protocols.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.26-35
• /
• 2010

In this paper, we propose the peer indexing scheme using data dissemination considering content and mobility. The proposed scheme consists of an index table, a buddy table, a routing table to support the cost of data dissemination, the search accuracy and cost. In this proposed scheme, a neighbor peer is recognized through a signal function and the cost of data dissemination is reduced by timestamp message. The transmitted messages are stored in the index structure considering timestamp and weight of interests which improves search accuracy and reduces the cost of search.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.5
• /
• pp.989-998
• /
• 2011

Cloud computing provides computation, software, data access, and storage services that do not require end-user knowledge of the physical location and configuration of the system that delivers the services. Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers around the world. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a group quorum system (GQS)-based dissemination for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed GQS-based method organizes these distributed clouds into a group quorum ring overlay to support a constant event dissemination latency. Our numerical results show that the GQS-based method improves the efficiency as compared with Chord-based and Plume methods.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.6
• /
• pp.1259-1269
• /
• 2012

Cloud computing has rapidly become a new infrastructure for organizations to reduce their capital cost in IT investment and to develop planetary-scale distributed applications. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a geographic group quorum system (GGQS)-based hybrid algorithm for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed algorithm first organizes these distributed clouds into a geographic group quorum overlay to support a constant event dissemination latency. Then it uses a hybrid protocol that combines geographic group-based broad-cast with quorum-based multicast. Our numerical results show that the GGQS-based hybrid algorithm improves the efficiency as compared with Chord-based, Plume an GQS-based algorithms.