Proceedings of the 2nd International Conference on Advances in Computer Science and Engineering (CSE 2013)

Gossip-Pull System-based Dissemination Protocol Satisfying Message Causality Condition

Authors
Jinho Ahn, Cha-Young Kim
Corresponding Author
Jinho Ahn
Available Online July 2013.
DOI
10.2991/cse.2013.72How to use a DOI?
Keywords
distributed algorithms; gossip-pull; message redundancy; message causality
Abstract

This paper introduces a group communication protocol ensuring message causality condition based on gossippull systems. The message causality condition can be satisfied by making all multicast messages transferred to group recipients through redundant message sending by sensor brokers, especially based on gossip-pull systems, which are only used when recipients request their messages to sensor brokers. These advantageous aspects enable the proposed protocol to enormously lower the redundancy of gossip messages compared with the gossip-push systems.

Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2nd International Conference on Advances in Computer Science and Engineering (CSE 2013)
Series
Advances in Intelligent Systems Research
Publication Date
July 2013
ISBN
10.2991/cse.2013.72
ISSN
1951-6851
DOI
10.2991/cse.2013.72How to use a DOI?
Copyright
© 2013, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Jinho Ahn
AU  - Cha-Young Kim
PY  - 2013/07
DA  - 2013/07
TI  - Gossip-Pull System-based Dissemination Protocol Satisfying Message Causality Condition
BT  - Proceedings of the 2nd International Conference on Advances in Computer Science and Engineering (CSE 2013)
PB  - Atlantis Press
SP  - 325
EP  - 327
SN  - 1951-6851
UR  - https://doi.org/10.2991/cse.2013.72
DO  - 10.2991/cse.2013.72
ID  - Ahn2013/07
ER  -