Citation Context

...egies can be combined in different hybrid approaches. Protocols that combine push and pull approaches have been described in [1, 19]. A protocol that combines eager push and lazy push is described in =-=[3]-=-. As its name implies, Plumtree also combines eager and lazy push. 2.3. Metrics In this section we define three metrics to evaluate a gossip protocol. Reliability Gossip reliability is defined as the ...

Citation Context

... distributed sets of data two main approaches prevail: structured network overlays [16, 20, 18], in which all nodes are logically organized in a well-know structure; and unstructured network overlays =-=[14, 9, 2]-=-, in which nodes are not (a priori) structured but are probabilistically managed. The structured approach, heavily depends on the attributes and adjustment of the logical overlay to the underlying phy...

Citation Context

... two fundamental building blocks for dependable distributed systems – consensus and reliable multicast – can be extended to support autonomic principles. In fact, we point out that existing protocols =-=[6, 1]-=- support decentralized decisions and fine grained adaptation with a single algorithm thus surpassing the impairments pointed above. Furthermore, the correctness of the algorithms is always ensured no ...

Citation Context

...e Nesos. Then, in the second step, each member of the Nesos propagates the query to all external neighbors. This allows to expand the breadth of the query in the first gossip steps (see for instance, =-=[2]-=- for the advantages of such approach). Further gossip steps attempt to forward the query to f external neighbors from Nesoi that have not been visited yet; if a node has less than f external neighbors...

Citation Context

... eerSampleLocal and P eerSampleRemote that return a set of local and remote nodes, respectively. 4.2 Dissemination Protocol This section presents the dissemination protocol which improves the work in =-=[5]-=-. The original protocol combines eager and lazy push strategies to achieve desirable bandwidth/latency trade-offs in a single protocol without endangering correctness. It is divided in two main compon...

Citation Context

...desired overlay topology. These peers are chosen based on the perceived reliability of peers, quantified as a peer’s age [25]. While hybrid overlay construction was adopted by researchers in the past =-=[6, 18, 27]-=-, previous efforts were not churn-aware when building such overlays, thus reducing their practical applicability. In summary, the new contributions of this work are: – A gossip-based algorithm that im...

Citation Context

...tion, lets say remote. A dissemination protocol that combines the eager and lazy push strategies to achieve desirable bandwidth/latency trade-offs in a single protocol without endangering correctness =-=[4]-=-. In this work we take advantage of this properties of this protocol and extend it with the locality awareness concept presented above. The protocol is divided in two main components, one responsible ...

Citation Context

...aches is basically scalability and resiliency vs. adaptiveness and efficiency. 1.1 Combining Approaches Recently, there has been several efforts to combine both tree-based and gossip-based approaches =-=[12, 13, 14]-=-. With such an approach, one can build and maintain a low-cost spanning tree for efficient multicast, and rely on the remaining links of the network for fault-tolerance. Unfortunately, existing soluti...