Limits...
Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

Yoon Y, Kim BH - PLoS ONE (2016)

Bottom Line: This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks.We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance.Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Engineering, Hongik University, Seoul, South Korea.

ABSTRACT
Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

No MeSH data available.


A simple broker replication example for handling the case where a Byzantine broker violates the reliable publication delivery requirement.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4930217&req=5

pone.0158516.g002: A simple broker replication example for handling the case where a Byzantine broker violates the reliable publication delivery requirement.

Mentions: Suppose the publisher P1 sends out a publication p1 via broker B1 as shown in Fig 2. Assume that B1 is the Byzantine broker and drops p1. In order to prevent the loss of messages, a redundant path can be established via replica . Duplicate publications can be sent through the redundant paths so that at least one message is guaranteed to be forwarded towards the subscribers. With the replica, the pub/sub overlay becomes tolerant to a single failure of reliable delivery. As a generalization, if there are f failures at each hop on an overlay, at least f + 1 replicas are needed on that hop. These replicas form a group that we call a virtual node.


Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network.

Yoon Y, Kim BH - PLoS ONE (2016)

A simple broker replication example for handling the case where a Byzantine broker violates the reliable publication delivery requirement.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4930217&req=5

pone.0158516.g002: A simple broker replication example for handling the case where a Byzantine broker violates the reliable publication delivery requirement.
Mentions: Suppose the publisher P1 sends out a publication p1 via broker B1 as shown in Fig 2. Assume that B1 is the Byzantine broker and drops p1. In order to prevent the loss of messages, a redundant path can be established via replica . Duplicate publications can be sent through the redundant paths so that at least one message is guaranteed to be forwarded towards the subscribers. With the replica, the pub/sub overlay becomes tolerant to a single failure of reliable delivery. As a generalization, if there are f failures at each hop on an overlay, at least f + 1 replicas are needed on that hop. These replicas form a group that we call a virtual node.

Bottom Line: This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks.We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance.Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

View Article: PubMed Central - PubMed

Affiliation: Department of Computer Engineering, Hongik University, Seoul, South Korea.

ABSTRACT
Publish/subscribe is a communication paradigm where loosely-coupled clients communicate in an asynchronous fashion. Publish/subscribe supports the flexible development of large-scale, event-driven and ubiquitous systems. Publish/subscribe is prevalent in a number of application domains such as social networking, distributed business processes and real-time mission-critical systems. Many publish/subscribe applications are sensitive to message loss and violation of privacy. To overcome such issues, we propose a novel method of using secret sharing and replication techniques. This is to reliably and confidentially deliver decryption keys along with encrypted publications even under the presence of several Byzantine brokers across publish/subscribe overlay networks. We also propose a framework for dynamically and strategically allocating broker replicas based on flexibly definable criteria for reliability and performance. Moreover, a thorough evaluation is done through a case study on social networks using the real trace of interactions among Facebook users.

No MeSH data available.