This paper is an attempt to quantify the performance differences for content-based multicast implemented inside the overlay routing algorithm or built on top of the simple API provided by the routing layer. We focus on overlay networks designed for peer-to-peer distributed hash table (DHT) applications where content-based multicast is most applicable. In particular we study the Content Addressa...

In Peer to Peer (P2P) systems, peers can join and leave the network whenever they want. Such “freedom” causes unpredictable network environment which leads to the most complex design challenge of a p2p protocol: how to make p2p service available under churn? What is more, where is the extreme of a system’s resistibility to high churn? A careful evaluation of some typical peer-to-peer networks w...

BACKGROUND A culture of health requires a commitment from all-individuals, families, communities, organizations, and municipalities-to value health and make decisions reflective of a healthy society. At the individual level, health literacy is a necessary precursor to assist individuals in achieving a higher level of health. METHOD One method for ensuring that staff members are routinely asse...

In this paper we propose to replace the standard Picard iteration in the Newton–Raphson method by Mann and Ishikawa iterations. This iteration’s replacement influence the solution finding process that can be visualized as polynomiographs for the square systems of equations. Polynomiographs presented in the paper, in some sense, are generalization of Kalantari’s polynomiography from a single pol...

In this paper, we show that two peer-to-peer systems, Pastry [13] and Tapestry [17] can be made tolerant to certain classes of failures and a limited class of attacks. These systems are said to operate properly if they can find the closest node matching a requested ID. The system must also be able to dynamically construct the necessary routing information when new nodes enter or the network cha...

We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies over one dimensional hash spaces is particularly difficult as the higher dimensionality of the underlying network makes close fits unlikely. Instead, current schemes are limite...