P2p-computing

paul nick

Outline

P2p-computing

Abstract

The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.

Figures (103)

Fig. 1.1 Peer-to-peer computing. Peer A requests for some data that Peer B has. However, Peer A has to first locate Peer B through other peers in the P2P network. Once Peer B is located, Peer A deals directly with Peer B

We begin by looking at a taxonomy of P2P systems. This taxonomy is derived from examining existing P2P systems. Figure 2.1 shows the taxonomy. In general, we can categorize the systems into two broad categories, centralized vs. decentralized, based on the availability of one or more servers, and to what extent the peers depend on the services provided by those servers. As expected, most of the research focuses on decentralized systems. There are essentially two main design issues to consider in decentralized systems: (a) the structure—flat (single tier) vs. hierarchical (multi- tier); and (b) the overlay topology—unstructured vs. structured. Besides these two main categories, there are also hybrid P2P systems that combine both centralized and decentralized architectures to leverage the advantages of both architectures. We shall examine each of these issues here. shall examine each of these issues here.

Bdetiy speaking, a centralized P2P system enjoys two merits: (a) It speeds up the process of resource location, and guarantees finding all possible nodes that maintain the desired files; (b) It is easy to maintain, organize, and administer the whole system through the central server. However, the central server may become the bottleneck of the system’s scalability. Even worse, it may result in a single point of failure. Therefore, improving the scalability, robustness, and security of these systems is an important research issue. In the next two subsections, we present Napster and

Se ee ee ee ES DS a ae a eo ee ee ee a oe The key idea behind of the Canonical approach is that it uses recursive rout- ng structure to construct a hierarchical DHT. For example, Fig. 2.5 shows a part of hierarchical structure of National University of Singapore. In the Canonical ap- oroach, all nodes in any domain are interconnected with each other to form a flat DHT routing structure. Notice that “nodes in domain X” refers to all nodes in the subtree rooted at X. However, different from any flat DHT structure, the Canonical upproach ensures the nodes located in different sub-domains, will be merged into 1 new, high-level DHT structure in the current domain by adding some links from -ach node in one domain to some nodes in other domains. For example, there are hree research groups in the SoC domain, i.e., DB, IS, and DS, and all computers of each sub-domain forms a Chord ring. Similarly, in SoC domain, all nodes of DB, [S, and DS domains form a new, high-level Chord ring. In this way, all participating 10des will form a hierarchical DHT according to the hierarchical structure of their Jomains.

Fig. 2.6 Merging Chord rings of DB and IS into Chord ring of SoC

Fig. 2.7 A Skip List with 5 nodes. The arrow lines show the process of search node 41 from head, through node 26 and node 30, to node 41

Fig. 2.8 A skip graph with 7 nodes, where level 0, 1, 2, and 3 contain | list, 2 lists, 4 lists, and 7 lists, respectively. For example, in level 1, there are 2 lists and their membership vectors are m(x) = 0 (node 7, node 23, node 30, and node 57) and m(x) = 1 (node 12, node 26, and node 41)

the query result, the information of the key k is also cached (stored) in the routing tables of Peer 1 and Peer 3. 3.2.2 Heuristic-Based Routing Strategies OI COAST EA EON TE LENA “SIRS TO EEN SS EIS SERS RE MEMETS te TAS SENN fue, Ree =| INAR Mee OGRE givea specific example | to explain the use of P and W during query processing. Suppose we have a policy of three iterations, P = 2,4,7 and W = 5 second: Under this policy, the source node S first sends a query message to the network vi BFS search of depth 2. The nodes that are within 2-hops away from the source nod would receive the message. These nodes then evaluate this query message locall and return the results to S. In the meantime, the query would be temporarily store on the nodes that are 2-hops away from S. After W seconds, S would terminat the query if the results satisfy the user. Otherwise, S issues another resend quer message with a BFS depth of 4, whose query ID is the same as the query ID o the previous query message. Upon receiving this resend query, the nodes that ar less than 2-hops away from the query node would do nothing but forward the quer to their neighbors. This process repeats until the resend query message reaches th

»f the performance of the networks in terms of query success rates [207]. A common onclusion of these works is that hamiltonicity (i.e., the existence of a hamiltonian -ycle) is an important property of the structures. This is mainly because it provides . “default” route in the network. [207] goes a bit further with the analysis of the yroperties of these networks and identifies the node bisection width (the number yf nodes that need to be removed to split the network in equal subnetworks) as a ignificant measure of quality for the underlying structures. Through extensive tests yver the different networks mentioned above in this section, [207] shows that the 1igher the node bisection width of the underlying graph, the higher the success rate yf the queries.

Chord orders identifiers of nodes and data items in an identifier circle modulo 2” i.e., the identifier space is a circle of numbers from 0 to 2” — 1. This is the reason why we call Chord a ring structure. The system assigns a key k to the first node n whose identifier is equal or follows the identifier of k in the circle space. In other words, k is assigned to the first node clockwise from k. In this case, n is called the successor node of k, denoted as n(k). Figure 3.5 shows a graph representing a Chord ring where two keys Ke and Kj are assigned to the same node identifier N30 obtained by hashing the IP address “202.120.224.102”; Key Ks56 obtained by hashing the word “Sailing” is assigned to node identifier N79; Key K100 is assigned to node identifier Nj95; Two nodes N42 and Njo9 store no data items. Simple Lookup Algorithm. In this algorithm, each node in the system only needs to know its immediate successor node to perform lookup operations. When a node = me

node, node N7 asks node Ng; to resolve the query. In turn, node Ng; determines node N15 as the farthest node in its finger table that precedes K 17 in the identi- fier space. As a result, Ng; forwards the query to Nios. Node Nios then discovers that its immediate successor, node Nj29, succeeds key K 117, and hence it continues to forward the query to Nj29. Finally, since Nj29 holds the queried key, it returns the result to node N7. It is shown that the expected number of routing hops in this search algorithm is O(log NV) steps, assuming accurate finger tables and no recent node failures.

nate space into different zones, each of which is assigned to a node. Each node in the system stores all data items belonging to the zone it is responsible for. To insert a new data item, the system uses a uniform hash function to map the key value of the data item to a point p in the coordinate space and finds the node n whose zone covers p to store the new data item. To process a query, the system also uses the same hash function to map the query to a point p’ in the coordinate space and find the node n’ whose zone covers p’. If the query’s result exists, it should be stored at n'. To find a node whose zone covers a point, the system starts at the requester node and follows immediate neighbor nodes step by step until it reaches the destina- tion node. As a result, for routing purpose, each node in CAN needs to maintain the information of its neighbor nodes that are nodes holding adjacent coordinate nodes to the node’s zone. Information of a node’s neighbor nodes forms the routing table of that node. Figure 3.9 shows an example of a CAN system with 5 nodes in a two dimensional space.

nS Re NE: REO Nears Me creer Oe eee RO OPN ie TR The Basic Idea. In PRR scheme, each node is assigned a unique t-bit identifier (nodeID) randomly from identifier space (below we denote it as ID-Space). We can divide the nodeID into / levels of w = t/I bits each; let w bits represent a digit and h = 2w be the basis of node identifier. Each node i has (b — 1) log N neighbors ! = log N levels of 2w neighbors each, such that each level k, 0 < k </, will have nodes with identifiers as follows: k common digits with i’s identifier, followed by all possible 2” values for the (kK + 1)st digit, and any of the 2” possible values for each of the remaining digits. These sets of neighbors form a routing table. An example of routing table is given in Fig. 3.10. In the figure, at level Lj, 3AF2 has one neighbor 3C57 (these two nodes share the common first digit), and at level L3, 3AF2’s two neighbors (3AF1 and 3AFC) share the same first three digits. For each node i in the [D-Space, we define closest(i) as the node whose nodelID is “closest” to i, where he definition of “closest” varies, but subject to the ID-Space. Routing in PRR Tree. It is essential to find closest(i) of each node i. In general, we can find closest(i) from node with identifier 7 by greedily forwarding the message o anode &k in the routing table of j that (1) has the longest matching prefix with } among neighbor nodes and (2) has the longer matching prefix compared to the a I a ee ee a a Oe a era eee

example, in Fig. 3.12, node FFFF is the host of object 0000, so the routing path is also the publication path. Node OFO0 is an intermediate node of the publication path, which has a reference to 0000’s host (node FFFF) indicated by the dashed line. If there are several replicas of object O on different nodes, each node publishes its own copy independently. Tapestry nodes can store references to object O according to network latency from their perspective. To locate object O in the Tapestry network, a client routes a message to object O’s root node R to get the reference to O. If there is a reference to object O in a node of the routing path, the message is redirected to node S.

down-right link to node D. At last node D issues a “vicinity” search to the destina- tion node B using its level-ring link. Canon [126] is a kind of hierarchical DHT schemes for structured P2P overlay, and Crescendo is a canonical version of Chord. The members of Crescendo system form a conceptional hierarchy that is constituted by multiple domains in different levels. In each level of the hierarchy, all nodes in one domain maintain a Chord- like ring and add links to outside nodes. In addition, two separate Chord rings in low level can be merged into a large Crescendo ring of upper level according to the following conditions that, besides retaining all its original links each node n in one ring establishes a link to node m in the other ring iff: (a) m immediately succeeds n at least distance 2! away for some 0 <i < N (the space size is N-bit), and (b) m is closer to n than any node in n’s ring. —_ a4 1 1 . a a” + Gee We oF a°64 7 1 oe ae oS eg &

to node 6. Then node 6 switches routing to the merged ring of the next higher level of the hierarchy, and in turn routes to node 10 using the greedy clockwise algorithm.

Searching in Skip Graph is based on the same principle as searching in Skip List except with a minor difference. Instead of sending a search query from a low level node to a high level node, in a Skip Graph, when a node issues a query, the search process always starts at the highest level of that node. At each step, if there is a neighbor node at the same level that keeps a closer value to the search key, the node forwards the query to that neighbor node. Otherwise, the node continues the search process at a lower lever. The destination node containing the result is found when the search process reaches the bottom level. The search algorithm of Skip Graph is shown in Algorithm 5. As in Skip List, it takes approximately O(log NV) steps to process a query in an N node system.

Fig. 3.16 Level rings of SkipNet and the routing table

74 as in Fig. 3.20. Since the searched value is greater than H’s upper bound, H first sends the query to L, the farthest neighbor node nearer to but not overshooting the searched key. Similarly, L then forwards the query to M. Since there is no neighbor node of M whose upper bound is less then the searched key, M continues to forward the query to its right child W. Finally, following right adjacent link from W to C, the query is forwarded to the destination node.

schema. As such, all organizations can use the standard query language RDF-QEL-i to find their desired resources and process raw materials for their further purposes. The core Edutella network is a HyperCuP [286] network that is composed of superpeers. All common peers will select one of superpeers as their access point for the whole network. In order to route queries on behalf of client peers, each superpeer is also responsible for indexing its client peers’ RDF schemes, which is defined as superpeer-peer routing indices. To route queries among superpeers, all superpeers then exchange these indexed RDF schemes to build a high level index, which is defined as superpeer-superpeer routing indices. oe ee ee

as ans In the ultrapeer network, all ultrapeers form an unstructured P2P network. To locate desired resources, a leaf peer should send a search query to its ultrapeer. The ultrapeer will propagate the query to all neighboring ultrapeers and each neighbor- ing ultrapeer then propagates the query to its neighboring ultrapeers and so on. Once receiving the query, the ultrapeer will search the query with its reflector indexing to locate which leaf peer has the desired resources. If a leaf peer is found, then the [P address of the leaf peer will be returned to the query peer. Here, we notice the concept of “reflector indexing”, which is a kind of index for meta data of shared

To locate the peer with a specific key, the query peer first requests its superpeer and the superpeer checks whether the key falls into its own range. If so, the query peer will use the Chord protocol to locate the peer. Otherwise, the lookup key will be forwarded to the superpeer whose range contains the key, by using the super- peer table. Last, the superpeer sends the lookup query to its successor and then the successor uses the Chord protocol to locate the desired peer.

Table 3.1 Summary of existing routing methods in P2P systems

hat is in the other side of the tree rooted at a’. In this way, VBI-Tree can search all 10des whose region intersects with the searched region without causing bottle neck it the root or nodes near the root. Algorithm 9 displays the basic search algorithm of VBI-Tree. It is important to mention that (1) to avoid search loop, the system <eeps track the search path and (2) to avoid frequently update of upside links due to changes in covered regions at ancestor nodes, VBI-Tree proposes a new concept of liscrete data. Discrete data are data that are stored at internal nodes and do not fall nto any regions covered by children of internal nodes.

attribute produces a lot of results, the system performance degrades significantly. Therefore, it is important to choose the dominant attribute wisely. The disadvantage of Mercury is that it incurs a high cost in data insertion and deletion especially when the number of index attributes is big. It is because when a new data item is added to the system, it is inserted to all hubs corresponding to index attributes. Similarly, when an existing data item is deleted, all hubs are checked to delete the corresponding data item.

values in one-dimensional space. As an example, Fig. 4.5(b) shows a query corre- sponding to the shaded region in the Hilbert space. This query is converted to three different search segments in the one-dimensional index space. This is indeed a com- mon problem with the use of curves in data mapping. In particular, the higher the dimension is, the higher the possibility of having more search segments in query processing is and hence the higher the cost of query processing is.

in a Skip Graph structure is determined by the position of its holding subspace in the Z-curve ordering. An example of ZNet structure is shown in Fig. 4.6, where the partition of the data space is displayed in Fig. 4.6(a) and the positions of ZNet nodes in a Skip Graph structure are displayed in Fig. 4.6(b). eames

LSH Forest [39] is an index structure containing a set of / LSH Trees, each of whicl is a prefix tree. For indexing purposes, the system uses a family H of locality sen sitive hash functions. In this index structure, each inserted object O is indexed times to / LSH Trees. At each LSH Tree, O is assigned a variable length x-digi identifier, which is the concatenating result of {h1(O),h2(O),...,4x(O)}, wher h\(O),...,hx(O) are hashing functions chosen from 71. This identifier determine the position of O in the LSH Tree where O is a leaf node and each digit in the iden tifier of O represents a part of the path from the root to O’s position. An example o a LSH Tree containing 4 objects is shown in Fig. 4.9 where the identifiers of thes objects are 00, 01, 110, and 111. It is important to note that the length of objec identifiers should be long enough so that each object can have a distinct identifier and hence a distinct position in the LSH Tree. To process a similarity search query, LSH Forest first uses hash functions se

The tree structure and summary index structure are illustrated in Fig. 4.11. Based on this summary index structure, when a peer node issues a query, it first sends the query to its super peer. The super-peer then checks the super-peer summary level to find super-peers holding relevant indices to the query. These relevant super-peers are forwarded the query. When a super-peer receives a query from another super- peer, it checks the peer summary level to find suitable peers to forward the query. Finally, at peer nodes in the leaf-peer level, document summary level is referenced to process the query and the results are returned to the query issuer. Algorithm 12 shows the overall search algorithm. —* Tt °4 a? ree 1 ae 1 . 4 mn - . ae

documents are indexed in nearby regions, the overlay network returns all document indices with in a radius r from the query point (r is a configurable parameter de- termined by either the similarity threshold or the number of wanted documents). A pSearch engine constructed on a 6 CAN nodes is illustrated in Fig. 4.12. Note that in pSearch global knowledge is created and maintained at each node in the overlay network. The way global knowledge is managed is independent with the way documents are indexed.

Fig. 4.13 A rotation of a 4-dimensional points to two 2-dimensional points

scans peers containing data in N, and fetches corresponding data in S for each tuple in N. FetchMatches has the disadvantage that selections on non-DHT attributes cannot be pushed into the DHT layer [159]. It is because if the selection functions are integrated into the DHT layer, they may dirtying the DHT APIs. To solve this problem, two improved algorithms, namely symmetric semi-join and Bloom join, are studied [159].

This is the most complex scheme involving many lightly loaded nodes and many heavily loaded nodes in the load balancing process. To serve the process of moving virtual nodes, this scheme creates a pool to keep virtual nodes temporarily while they are not assigned to any node. The scheme is executed in three phases:

Fig. 5.3. Many-to-many load balancing scheme

node. The problem now is how to direct a query, given that the routing table keeps only one entry for log N nodes. Yo deals with this problem by modifying the search algorithm a little: A node still tries to forward the search request to the farthest node in its routing table not overshooting the searched key and the message stops when it arrives at a node whose range of values covers the search key, as in Chord. However, that node may not actually keep the key because there are internal nodes between the virtual nodes that are actually maintained at the node. At this point, the succes- sor link of the virtual node, which is the nearest with respect to the searched key, is selected for forwarding the request. The next node receiving the request repeats the same process to forward the query through a successor link towards the destination node. In particular, if a virtual node keeps O(log N) successor links (the main pur- pose is fault tolerance!), the query processing only takes O(1) additional steps. The Yo protocol is illustrated as in Fig. 5.4.

5.2.4 A Combination of Both Local and Random Probes In order to reduce the cost of random choices paradigm, some authors [182, 215] suggest that the node should ask for the load of not only random nodes (random probe) but also neighbor nodes surrounding them (local probe) to estimate the load distribution of the system. Since it is much cheaper to ask for the load of an adja- cent node of a contact node than to ask for the load of a contact node (1 message compared to O(log NV) messages), the node can reduce the cost of load querying by decreasing the number of contact random nodes and increasing the number of contact neighbor nodes in the vicinity of contact nodes while still achieve the same performance.

get local load distribution. The node also periodically samples a number of ran- dom distant nodes, to ask for the local load distribution of these nodes. The process of sampling distant nodes is based on random walk algorithm. In particular, the node first sends sampling requests with log N hops time-to-live to random neighbor nodes. After that, at each node along the sampling path, a random neighbor node is selected to forward the request. In this way, the process finally sends sampling requests uniformly to nodes in the system, with high probability. The node at the end of the sampling path returns to the requester node its local load distribution. Based on the received samples, a load distribution histogram is constructed at the node. The process of constructing and maintaining the histogram of a node is illus- trated as in Fig. 5.7. As discussed before the method to construct and maintain the histogram is based on the combination of local and random probes presented in the above section. In particular, in the figure of the example, values of random probe (r) and local probe (v) are respectively, 4 and 5.

Even though maintaining such a Skip Graph is expensive, since any of operation from node join, node departure to data insertion or data deletion can make node in the Skip Graph change their positions, this method can achieve the maximun imbalance ratio load, which is the ratio between the heavily loaded node and thi lightly loaded node in the system, by 5°. Note that, depending on applications, 6 ca be set to a low or a high value. The lower value the 6 is, the better the load balanc: of the system is and certainly the higher the cost of load balancing is. in the Skip Graph change their positions, this method can achieve the maximum

_ The first technique uses the successor replication scheme. Each block stored at a node is replicated to k following nodes in the Chord ring to increase avail- ability of the block. This technique is based on a property of Chord ring that if a node fails, the immediate successor node will take responsibility for all data belonging to the failed node. As a result, using this replication technique, blocks are always available to retrieve even thought the block owner fails. Furthermore, this technique can help clients to select the fastest download server from a group

At the center of Beehive there is an analytical model, which helps to identify optimal replication levels for objects based on the query distribution. Let a be the parameter of the query distribution in which the i most popular object has the number of queries proportional to i~%; M and N be the number of objects and the number of nodes in the system; b be the fan-out of the search tree structure in the system; k = log, N be the maximum number of search steps; C be the desired lookup constant.

Fig. 6.4 Self-verification scheme version and another fragment has to be obtained. A solution to this problem is to build a Merkle hash tree for the data object and its fragment i.e., the data object and its fragments form the leaves of the tree (in a similar manner as that described in Sect. 6.4.1). Figure 6.4(a) shows an exam- ple of a Merkle hash tree for data object with 4 fragments. Here, fragment F; has hash value of Hj and the data object has hash value of Hy. The digest GUID is the unique identifier that can be used to identify and verify the object. Each fragment is made self-verifiable by storing in each fragment all necessary information to ver- ify the fragment’s hash value i.e., hash values of sibling nodes in the path from the leaf fragment to the root. Figure 6.4(b) shows the self-verifiable fragments’ content for the example in Fig. 6.4(a). When a node receives a fragment to reconstruct the object, the node verifies the fragment by first computing the hash value of the frag- ment, and then repeating the process of hashing the result computed the previous step with the correspondent hash value in the Merkle hash tree until the hash value of the root is obtained. If the final hash value matches the GUID, the fragment is a valid fragment and can be used for reconstruction; otherwise, it is a corrupted version and another fragment has to be obtained.

a “safe” programming language to uniformly describe policies, credentials, and trust relationships instead of treating them separately as other systems [162, 352]. In the system, each agent can take a decision in a flexible way: either locally or via a third party. Furthermore, PolicyMaker separates mechanism from policy, and hence makes applications independent from the infrastructure.

Fig. 7.3. Phases of a negotiation The negotiation process and its phases are described as in Fig. 7.3.

— Strongest path: in this strategy, a peer first finds the strongest path between itself and the destination node. The strongest path is determined as the path whose minimum valued edge along the path or the product of all edges along the path is the highest amongst all possible paths between two nodes. Once the strongest path is known, the trust value is the smallest weight among the edges in the path. For example, if we use the minimum valued edge function for finding the strongest path, the strongest path between A and F in Fig. 7.5 is A—> C > D— F. As aresult, the trust value of F inferred by A is 0.65.

7.5 Trust Systems Based on Both Individual Reputation and Social Relationship

benefits from society reputation once they know the way societies are formed. Here, OR;— ;(k) = SR; ;(k) if k is an atomic feature; ws, represents some weights in the calculation, normalized such that )~ kechildren(s) Wsk = 1. The exis- tence of these weights is necessary because different agents may have different points of view on properties in the formula. Furthermore, these weights at each peer are not fixed. They may change over time, depending on necessities. Figure 7.7 shows an example of an ontology for the reputation of a hotel, consisting of price, service, and location.

this problem is asking a peer to evaluate the reputation of referenced peers too. This may lead to a circular check for all peers in the system, which is costly, but in many cases, the system can decide the correctness of reputation values just after a few steps. This method can be applied in any structured Peer-to-Peer systems such as P-Grid [17], CAN [266], or CHORD [173]. aaa Fr a A a a ee fo In conclusion, the taxonomy of trust management methods can be displayed as in Fig. 7.9. It is interesting to realize that the taxonomy of trust management is similar to the taxonomy of Peer-to-Peer networks: the first model can be consid- ered as the unstructured, server based Peer-to-Peer model, the second model using gossiping can be considered as the unstructured, pure Peer-to-Peer model, and the last one as the structured Peer-to-Peer model. In the following parts of this sec- tion, we introduce three systems that are representatives of these models. They are XenoTrust [113], using server based trust management model, EigenRep [171], em- ploying gossiping based trust management model, and the work of Ge, Luo, and Xu [19], using P-Grid for trust management.

The framework of the XenoServer Open Platform can be seen in the top part of Fig. 7.10. Although the platform has a component, XenoCorp, that can provide a trusted payment service for its clients, it cannot let them know the reputation of each other (i.e., if they are good or bad servers/clients). Since servers and clients are autonomous, it is necessary to provide users (both servers and clients) a mechanism for evaluating the reputation of each other. XenoTrust is dedicated for this purpose. for evaluating the reputation of each other. XenoTrust is dedicated for this purpose.

Table 7.1 Summary of representative P2P systems discussed through the chapter

JXTA defines a set of concepts, at the core of which lies, naturally, that of a peer and of peer services. A peer may be any type of device, ranging from the smallest smart-card to a fully blown server. Function of its capabilities, a peer can provide more or less services for other peers. Figure 8.2 illustrates the hierarchy of services and specific denominations given to the peers implementing only subsets of these services. In this figure, it is worth pointing out the existence of super-peers which are peers that help other peers to communicate with the network by translating some particular communication protocol into the general TCP/IP stack, or act as meeting points between peers. They implement all or a subset of the Relay, Rendezvous and Proxy protocols.

Fig. 8.5 Composition of a PNRP identifier

Fig. 9.2 Overview of pStore The pStore system [38] separates backup and underlying Peer-to-Peer functionality. pStore completely surrenders all Peer-to-Peer tasks to Chord [173], a distributed hash table (DHT) implementation, concentrating on the implementation of backup semantics on top of it. When creating a new backup, pStore splits each individual file of the backup set into a number of equal-size blocks (except the last block, which may be smaller) and creates a metadata record, which are then stored inside the hash table (Fig. 9.2). The mapping of data blocks to nodes inside the Peer-to-Peer overlay is managed by Chord.

Fig. 9.3. Block creation process in pStore

Fig. 9.6 Adding version to file in pStore By employing these techniques, significant savings on the global storage require- ments can be achieved. The authors of pStore claim a reduction of between 3 and 60 percent in total storage requirements. However, savings depend heavily on the data inserted into the backup system and scale directly with the degree of overlap between hosts. (A study conducted as part of the Farsite project [55] found up to 50% overlap between the computers of Microsoft employees.)

Fig. 9.7 Virtual disk using erasure code IER conse ess One ae nee oor a ae ee The main idea of this scheme is: Peers exchange disk space in a symmetric man- ner. When forming a trading partnership, both peers agree on terms like the ex- change quantity, the time-frame of the exchange and certain availability of each peer. Of course, it is rare for two peers to find exact matches in exchanging quanti- ties, so trade ratio might be used. Once both peers have agreed to the deal, they can begin storing data on each other’s hard disk.

Fig. 9.8 Buddy searching process in pastiche Discovering Buddies During the process of finding the partner, one important crite- ria is the overlapping data in backup sets. The reason is that the higher the overlap between buddies the less data they need to exchange. Discovering matching peers is done in a distributed scheme with the help of a central server which is also used by Cooperative Internet Backup Scheme.

Fig. 9.9 Robustness of anchors during file modification on patterns to discover block boundaries, only directly affected blocks are changed during an update process of the file, while the rest blocks are undisturbed (Fig. 9.9).

Fig. 9.10 Generation and forwarding of storage claims in samsara

Fig. 9.11 Data migration in distributed hash table DHT is used to store data items indexed by keys, additional maintenance cost, and probably the more dominant cost, will rise: data migration cost. Whenever a pee! joins or leaves the network, it forces a reorganization of the key mapping in DHT which causes data items to become misplaced. As a result, a number of data items will be stored at a peer that is no longer responsible for them. In order to ensure correct retrieval of these misplaced data items, they need to be moved to the pee that is now responsible for them. As depicted in Fig. 9.11, without this process, more and more data items in the DHT would not be retrievable as queries for them will eventually reach the wrong responsible peer. Ts pies eh. ses thek. Sees A whe Aes serie ee Se Ree tH [Hc

Manager modules. The namespace, resourceID, and instanceID are used to uniquely identify an object, and the namespace and resourceID are used to calculate the DHT key [159]. In implementation, namespaces are relation names, while resourceIDs are by default the values of primary keys, and instanceIDs are used to separate objects with the same namespace and resourceID. This CAN-based DHT layer is enhanced to provide following operators in Provider module:

a Pidvlitdal FLivino. One of the scenarios that BestPeer v2.0 starts from, is that of a Supply Chain Management application, where different participants (i.e., peers) need to share data for mutual advantage (Fig. 9.13). Consequently, apart from the “traditional” PDMS areas of interest (query processing, index management), BestPeer v2.0 also addresses issues of access control and data synchronization (Fig. 9.14) in order to protect each participant’s private data stored, for instance, in an internal ERP* sys- tem. Enterprise Resource Planning.

Table 9.4 Index types for BestPeer v2.0 in addition, it also comes with a native load balancing mechanism. To speed up query processing, be they range or otherwise, BestPeer v2.0 uses three types of indices: table index, column index, and data index. Table 9.4 shows their formats. The first two types (table and column) are rather straightforward: they maintain a list of peers that store that particular table or column. For the data index, the idea used by this system is to assign an ID to every column and to map this ID to a position in a bitmap. Then, when indexing a particular data value, the generated bitmap contains values of 1 only where the data appears as a value in the corresponding column.

picts the architecture of an autonomous peer in Buddy Web. The web browser serves as the front-end interface to the user. Thanks to its transparency, users are not aware of any difference between the Buddy Web-enabled browser and the common one. In the Buddy Web enabled browser, there is a personal proxy that works with the local cache and a HTTP daemon to support HTTP re- quests. The cache, in collaboration with the BestPeer platform [234], is responsible for sharing cached data with other peers in the BuddyWeb network. The low level communication between peers is managed by the BestPeer platform. Whenever the web browser submits an URL query, the local proxy will receive and rewrite the query into the input format of the BestPeer platform. The query will then be passed to the BestPeer platform. Based on the requirement, BestPeer generates several mo- bile agents and dispatches them to the BuddyWeb network to search for matching documents. Upon receiving a match, BestPeer returns the information, i.e., docu- ment location, back to the personal proxy. In this way, the personal proxy will issue HTTP daemon directly to the peer that has the desired documents. The answer con- tributor, upon receiving the HTTP request, will process it by the HTTP daemon and send the requested documents to the requester.

We envision an infrastructure for distributed information sharing among different parties based on Peer-to-Peer technology. Using distributed hash tables, the index- ing mechanism is both efficient and scalable, but challenges arise due to the hetero- geneous nature of the data as well as due to the potential security threats that are characteristic of peer-to-peer networks. We will address these shortly, but first let us consider why would we even want to use this approach.

References (351)

Integrate the mobile device into an already existing peer-to-peer network. Ex- amples of such systems are Symella 9 or Symtorrent 10 which connect to Gnutella and to BitTorrent, respectively. These applications are implementations for the Symbian mobile platform of the usual peer-to-peer client software. As such, they 6 http://www.cloudtrade.com.
Emulab-total network testbed, http://www.emulab.com
Folding@home, http://folding.stanford.edu
Freenet, http://freenet.sourceforge.net
Furi, http://www.jps.net/williamw/furi
Gnewtella, http://sourceforge.net/projects/gnewtella
Gnotella, http://www.overnet-download.de/filesharing/gnotella.html
Gnutella, http://gnutella.wego.com
The Gnutella protocol specification v0.4, http://www.clip2.com
Icq, http://www.icq.com
JXTA Project Home Page, http://www.jxta.org
Magi, http://www.endeavors.com
Napster, http://www.napster.com
Napster protocol, http://david.weekly.org/code
The Network Simulator-ns-2, http://www.isi.edu/nsnam/ns/
K. Aberer, P-Grid: a self-organizing access structure for P2P information systems, in Pro- ceedings of the 9th International Conference on Cooperative Information Systems (CoopIS), 2001
K. Aberer, P. Cudre-Mauroux, M. Hauswirth, The chatty web: emergent semantics through gossiping, in Proceedings of the 12th World Wide Web Conference (WWW), 2003
K. Aberer, Z. Despotovic, Managing trust in a peer-2-peer information system, in Proceed- ings of the 10th ACM International Conference on Information and Knowledge Management (CIKM), 2001
L.A. Adamic, R.M. Lukose, A.R. Puniyani, B.A. Huberman, Search in power-law networks. Phys. Rev. 64 (2001)
E. Adar, B.A. Huberman, Free riding on Gnutella. First Monday 5(10) (2000)
D.A. Agarwal, O. Chevassut, M.R. Thompson, G. Tsudik, An integrated solution for secure group communication in wide-area networks, in Proceedings of the 6th IEEE Symposium on Computers and Communications, pp. 22-28, Hammamet, Tunisia, July 2001
R. Albert, H. Jeong, A. Barabasi, Error and attack tolerance in complex networks. Nature 406, 378-382 (2000)
M. Altinel, M. Franklin, Efficient filtering of XML documents for selective dissemination, in Proceedings of the 26th International Conference on Very Large Databases (VLDB), 2000
Amazon, http://www.amazon.com
Amazon Auctions, http://auctions.amazon.com Q.H. Vu et al., Peer-to-Peer Computing, DOI 10.1007/978-3-642-03514-2, © Springer-Verlag Berlin Heidelberg 2010 References
K.G. Anagnostakis, M.B. Greenwald, Exchange-based incentive mechanisms for peer-to- peer file sharing, in Proceedings of the 24th International Conference on Distributed Com- puting Systems (ICDCS), pp. 524-533, Tokyo, Japan, March 2004
D. Anderson, SETI@home, in Peer-to-Peer: Harnessing the Power of Disruptive Technolo- gies (O'Reilly & Associates, 2001), pp. 67-76
A. Andrzejak, Z. Xu, Scalable, efficient range queries for grid information services, in Pro- ceedings of the 2nd International Conference on Peer-To-Peer Computing, pp. 33-40, 2002
M. Arenas, V. Kantere, A. Kementsietsidis, I. Kiringa, R. Miller, J. Mylopoulos, The Hyper- ion project: from data integration to data coordination. SIGMOD Rec. 32(3) (2003)
J. Aspnes, G. Shah, Skip graphs, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 384-393, 2003
R. Axelrod, The Evolution of Cooperation (Basic Books, New York, 1984)
R.A. Baeza-Yates, B.A. Ribeiro-Neto, Modern Information Retrieval (ACM Press/Addison- Wesley, New York, 1999)
B. Bakos, L. Farkas, Nomadic sharing of media: proximity delivery of mass content within P2P social networks, in Proceedings of IWUC, 2006
H. Balakrishnan, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, Looking up data in P2P systems. Commun. ACM 46(2), 43-48 (2003)
I. Balbin, K. Ramamohanarao, A generalization of the differential approach to recursive query emulation. J. Log. Program. 4(3) (1987)
B. Barber, Logic and Limits of Trust (Rutgers University Press, New Jersey, 1983)
C. Batten, K. Barr, A. Saraf, S. Treptin, pStore: a secure peer-to-peer backup system. Tech- nical Memo MIT-LCS-TM-632, MIT Laboratory for Computer Science, December 2001
M. Bawa, T. Condie, P. Ganesan, LSH forest: self-tuning indexes for similarity search, in Proceedings of the 14th World Wide Web Conference (WWW), pp. 651-660, 2005
D. Bedell, Search for extraterrestrials or extra cash, in The Dallas Morning News, December 1999
M. Bender, S. Michel, C. Zimmer, G. Weikum, The MINERVA project: database selection in the Context of P2P search, in Proceedings of the GI-Fachtagung fur Datenbanksysteme in Business, Technologie und Web (BTW), 2005
J.L. Bentley, Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509-517 (1975)
S. Berchtold, C. Bohm, H.-P. Kriegel, The Pyramid-technique: towards breaking the curse of dimensionality, in Proceedings of the ACM SIGMOD International Conference on Manage- ment of Data, pp. 142-153, 1998
S. Berchtold, D.A. Keim, H.-P. Kriegel, The X-tree: an index structure for high-dimensional data, in Proceedings of the 22nd International Conference on Very Large Databases (VLDB), 1996
K. Berket, A. Essiari, A. Muratas, PKI-based security for peer-to-peer information sharing, in Proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing, August 2004
P.A. Bernstein, F. Giunchiglia, A. Kementsietsidis, J. Mylopoulos, L. Serafini, I. Zaihrayeu, Data management for peer-to-peer computing: a vision, in Proceedings of the 5th Interna- tional Workshop on the Web and Databases (WebDB), 2002
M. Berry, Z. Drmac, E. Jessup, Matrices, vector spaces, and information retrieval. SIAM Rev. 41(2), 335-362 (1999)
E. Bertino, E. Ferrari, A.C. Squicciarini, Trust-X: a peer-to-peer framework for trust estab- lishment. IEEE Trans. Knowl. Data Eng. 7, 827-842 (2004)
A.R. Bharambe, M. Agrawal, S. Seshan, Mercury: supporting scalable multi-attribute range queries, in Proceedings of the ACM SIGCOMM Conference, 2004
M. Blaze, J. Feigenbaum, J. Ioannidis, A. Keromytis, The KeyNote trust management sys- tem, version 2. RFC-2704. IETF, 1999
M. Blaze, J. Feigenbaum, Decentralized trust management, in Proceedings of the IEEE Sym- posium on Security and Privacy (S&P), 1996
Blizzard, http://www.blizzard.com/, 2001
B.H. Bloom, Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422-426 (1970)
S. Boag, D. Chamberlin, M.F. Fernandez, D. Florescu, J. Robie, J. Simeon, M. Stefanescu, XQuery 1.0: An XML query language. W3C working draft, April 2002
W.J. Bolosky, J.R. Douceur, D. Ely, M. Theimer, Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs, in Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (ACM, New York, 2000), pp. 34-43
A. Broder, M. Mitzenmacher, Network applications of bloom filters: a survey, in Allerton, 2002
S. Burleigh, V. Cerf, R. Durst, K. Fall, A. Hooke, K. Scott, H. Weiss, The interplanetary internet: a communications infrastructure for Mars exploration, in Proceedings of the Inter- national Astronautical Congress, 2002
J. Byers, J. Considine, M. Mitzenmacher, Simple load balancing for distributed hash tables, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
J.W. Byers, M. Luby, M. Mitzenmacher, A. Rege, A digital fountain approach to reliable distribution of bulk data, in Proceedings of the ACM SIGCOMM Conference, pp. 56-67, 1998
R. Caceres, F. Douglis, A. Feldmann, G. Glass, M. Rabinovich, Web proxy caching: the devil is in the details, in Proceedings of the 2nd Workshop on Internet Server Performance (WISP), 1999
M. Cai, M. Frank, J. Chen, P. Szekely, MAAN: a multi-attribute addressable network for grid information services, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
D. Carney, U. Cetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, S. Zdonik, Monitoring streams: a new class of data management applications, in Proceedings of the 28th International Conference on Very Large Databases (VLDB), 2002
D. Carroll, C. Rahmlow, T. Psiaki, G. Wojtaszczyk, Distributing science. http://boinc. berkeley.edu/trac/wiki/BoincPapers, 2005
M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D.S. Wallach, Security for peer-to-peer routing overlays, in Proceedings of the 5th USENIX Symposium on Operating Systems De- sign and Implementation (OSDI), Boston, Massachusetts, December 2002
J. Cates, Robust and efficient data management for a distributed hash table. Master's thesis, Massachusetts Institute of Technology, 2003
V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, H. Weiss, Delay- tolerant network architecture. IETF RFC 4838, http://www.ietf.org/rfc/rfc4838.txt, April 2007
S. Ceri, G. Gottlob, L. Tanca, Logic Programming and Databases. Surveys in Computer Science (Springer, Berlin, 1990)
C. Chan, P. Felber, M. Garofalakis, R. Rastogi, Efficient filtering of XML documents with XPath expressions, in Proceedings of the 18th IEEE International Conference on Data En- gineering (ICDE), 2002
S. Chandrasekaran, O. Cooper, A. Deshpande, M.J. Franklin, J.M. Hellerstein, W. Hong, S. Krishnamurthy, S.R. Madden, V. Raman, F. Reiss, M.A. Shah, TelegraphCQ: continuous dataflow processing for an uncertain world, in Proceedings of the 1st Conference on Innova- tive Data Systems Research (CIDR), 2003
D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 4(2) (1982)
J. Chen, D.J. DeWitt, F. Tian, Y. Wang, NiagaraCQ: a scalable continuous query system for internet databases, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000
Y. Chen, R.H. Katz, J. Kubiatowicz, Dynamic replica placement for scalable content delivery, in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), pp. 306- 318, 2002
M. Cherniack, H. Balakrishnan, M. Balazinska, Scalable distributed stream processing, in Proceedings of the 1st Conference on Innovative Data Systems Research (CIDR), 2003
S. Cheshire, M. Krochmal, DNS-Based Service Discovery. http://tools.ietf.org/html/draft- cheshire-dnsext-dns-sd
Y.-H. Chu, J. Feigenbaum, B. LaMacchia, P. Resnick, M. Strauss, REFEREE: trust manage- ment for web applications. Comput. Netw. ISDN Syst. 29(8-13), 953-964 (1997)
B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, M. Bowman, Plan- etlab: an overlay testbed for broad-coverage services. ACM SIGCOMM Comput. Commun. Rev. 33(3) (2003)
P. Ciaccia, M. Patella, P. Zezula, M-Tree: an efficient access method for similarity search in metric spaces, in Proceedings of the 23rd International Conference on Very Large Databases (VLDB), pp. 426-435, 1997
I. Clark, O. Sandberg, B. Wiley, T. Hong, Freenet: a distributed anonymous information storage and retrieval system, in Proceedings of the Workshop on Design Issues in Anonymity and Unobservability (DIAU), Berkeley, CA, 2000
I. Clarke, T.W. Hong, S.G. Miller, O. Sandberg, B. Wiley, Protecting free expression online with Freenet. IEEE Internet Comput. 6(1), 40-49 (2002)
E. Cohen, S. Shenker, Replication strategies in unstructured peer-to-peer networks, in Pro- ceedings of the ACM SIGCOMM Conference, pp. 177-190, 2002
T.E. Condie, S.D. Kamvar, H. Garcia-Molina, Adaptive peer-to-peer topologies, in Proceed- ings of the 4th IEEE International Conference on Peer-to-Peer Computing, August 2004
B. Cooper, M. Bawa, N. Daswani, H. Garcia-Molina, Protecting the pipe from malicious peers. Technical report, Computer Sciences Dept, Stanford University, 2002
F. Cornelli, E. Damiani, S.D.C. di Vimercati, S. Paraboschi, P. Samarati, Choosing reputable servents in a P2P network, in Proceedings of the 11th World Wide Web Conference (WWW), 2002
L.P. Cox, C.D. Murray, B.D. Noble, Pastiche: making backup cheap and easy, in Proceedings of the 5th USENIX Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, December 2002
L.P. Cox, B.D. Noble, Samsara: honor among thieves in peer-to-peer storage, in Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP), Bolton Landing, NY, October 2003
A. Crainiceanu, P. Linga, J. Gehrke, J. Shanmugasundaram, Querying peer-to-peer networks using P-trees, in Proceedings of the 7th International Workshop on the Web and Databases (WebDB), pp. 25-30, 2004
A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, J. Shanmugasundaram, P-Ring: an efficient and robust P2P range index structure, in Proceedings of the ACM SIGMOD Inter- national Conference on Management of Data, 2007
A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems, in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), 2002
A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems, in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), 2002
A. Crespo, H. Garcia-Molina, Semantic overlay networks for P2P systems. Technical report, Computer Science Department, Stanford University, 2003
F. Cuenca-Acuna, T. Nguyen, Text-based content search and retrieval in ad hoc P2P commu- nities. Technical Report DCS-TR-483, Rutgers University, 2002
F.M. Cuenca-Acuna, C. Peery, R.P. Martin, T.D. Nguyen, PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities, in Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing (HPDC), 2003
F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, Wide-area cooperative storage with CFS, in Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), 2001
E. Damiani, D.C. di Vimercati, S. Paraboschi, P. Samarati, F. Violante, A reputation-based approach for choosing reliable resources in peer-to-peer networks, in Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS), 2002
N. Daswani, H. Garcia-Molina, Query-flood DoS attacks in Gnutella, in Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS), pp. 181-192, Washington, DC, 2002
A. Datta, M. Hauswirth, K. Aberer, Updates in highly unreliable, replicated peer-to-peer systems, in Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), 2003
A. Datta, M. Hauswirth, R. John, R. Schmidt, K. Aberer, Range queries in tree-structured overlays, in Proceedings of the 3rd International Workshop on Databases, Information Sys- tems and Peer-to-Peer Computing (DBISP2P), 2005
I. Daubechies, Ten Lectures on Wavelets (Society for Industrial and Applied Mathematics, Philadelphia, 1992)
J. Dawei, X. Han, M. Lupu, B.C. Ooi, H.T. Vo, Q.H. Vu, S. Wu, BestPeer: a peer-to-peer based platform for corporate network applications in Distributed Online Aggregation, ed. by S. Wu, S. Jiang, B.C. Ooi, K.L. Tan. Proceedings of the International Conference on Very Large Data Bases, July 2008 (National University of Singapore, Singapore, 2009)
M. Dean, D. Connolly, F. van Harmelen, J. Hendler, I. Horrocks, D. McGuinness, P. Patel- Schneider, L. Stein, OWL web ontology language 1.0 reference, 2002
G. Decandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasub- ramanian, P. Vosshall, W. Vogels, Dynamo: Amazon's highly available key-value store, in Proceedings of the 21st ACM Symposium on Operating Systems Principles (SOSP), pp. 205- 220, 2007
S. Deerwester, S. Dumais, G. Furnas, R. Harshman, Indexing by latent semantic analysis. J. Am. Soc. Inf. Sci. 41, 391-407 (1990)
M. Deutsch, Cooperation and trust: some theoretical notes, in Nebraska Symposium on Mo- tivation, 1962
M. Deutsch, The Resolution of Conflict (Yale University Press, New Haven, 1973)
P. Devanbu, M. Gertz, C. Martel, S.G. Stubblebine, Authentic data publication over the in- ternet. J. Comput. Secur. 11(3), 291-314 (2003)
Y. Diao, P. Fischer, M. Franklin, R. To, YFilter: efficient and scalable filtering of XML doc- uments, in Proceedings of the 18th IEEE International Conference on Data Engineering (ICDE), 2002
P. Digital, Magic mirror backup, 2003
R. Dingledine, M. Freedman, D. Molnar, Free Haven, in Peer-to-Peer: Harnessing the Power of Disruptive Technologies (O'Reilly & Associates, 2001), pp. 159-187
S. Djilali, P2P-rpc: programming scientific applications on peer-to-peer systems with remote procedure call, in Proceedings of the 3st International Symposium on Cluster Computing and the Grid (CCGRID) (IEEE Computer Society, Washington, 2003), pp. 406-413
S. Djilali, T. Herault, O. Lodygensky, T. Morlier, G. Fedak, F. Cappello, RPC-V: toward fault-tolerant rpc for internet connected desktop grids with volatile nodes, in Proceedings of the ACM/IEEE conference on Supercomputing (SC) (IEEE Computer Society, Washington, 2004), p. 39
J.R. Douceur, The Sybil attack, in Proceedings of the 1st International Workshop on Peer- to-Peer Systems (IPTPS), pp. 251-260, Cambridge, MA, 2002
C. Doulkeridis, A. Vlachou, Y. Kotidis, M. Vazirgiannis, Peer-to-peer similarity search in metric spaces, in Proceedings of the 33rd International Conference on Very Large Databases (VLDB), 2007
B. Dragovic, B. Kotsovinos, S. Hand, P.R. Pietzuch, Xenotrust: event-based distributed trust management, in Proceedings of the 2nd International Workshop on Trust and Privacy in Digital Business (TrustBus), 2003
P. Druschel, A. Rowstron, PAST: a large-scale, persistent peer-to-peer storage utility, in Pro- ceedings of the 8th Workshop on Hot Topics in Operating Systems (HotOS) (IEEE Computer Society Press, Los Alamitos, 2001), pp. 75-80 References
W. Du, J. Jia, M. Mangal, M. Murugesan, Uncheatable grid computing, in Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS), pp. 4-11, Tokyo, Japan, March 2004
eBay, http://www.ebay.com
H. Evans, P. Dickman, Peer-to-peer programming with Teaq, in Proceedings of the Workshop on Web Engineering and Peer-to-Peer Computing, pp. 289-294, 2002
J. Feigenbaum, C. Papadimitriou, R. Sami, S. Shenker, A BGP-based mechanism for lowest- cost routing, in Proceedings of the 21st ACM Symposium on Principles of Distributed Com- puting (PODC), pp. 173-182, 2002
J. Feigenbaum, C. Papadimitriou, S. Shenker, Sharing the cost of multicast transmissions. J. Comput. Syst. Sci. 63, 21-41 (2001)
M. Feldman, K. Lai, J. Chuang, I. Stoica, Quantifying disincentives in peer-to-peer networks, in Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems (P2PEcon), Berkeley, CA, June 2003
I. Foster, A. Iamnitchi, On death, taxes, and the convergence of peer-to-peer and grid com- puting, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, USA, 2003
I. Foster, C. Kesselman (eds.), The Grid: Blueprint for a New Computing Infrastructure (Morgan Kaufmann, San Mateo, 1998)
M.J. Freedman, R. Morris, Tarzan: a peer-to-peer anonymizing network layer, in Proceed- ings of the 9th ACM Conference on Computer and Communications Security (CCS) (ACM, Washington, 2002), pp. 193-206
D. Gambetta, Trust (Blackwell, Oxford, 1990)
P. Ganesan, M. Bawa, H. Garcia-Molina, Online balancing of range-partitioned data with applications to peer-to-peer systems, in Proceedings of the 30th International Conference on Very Large Databases (VLDB), 2004
P. Ganesan, K. Gummadi, H. Garcia-Molina, Canon in G major: designing DHTs with hier- archical structure, in Proceedings of the 24th International Conference on Distributed Com- puting Systems (ICDCS), pp. 263-272, 2004
L. Garber, Denial-of-service attacks rip the internet. Computer 33(4), 12-17 (2000)
L. Ge, J. Luo, Y. Xu, Developing and managing trust in peer-to-peer systems, in Proceedings of the 17th International Conference on Database and Expert Systems Applications (DEXA), 2006
B. Gedik, L. Liu, PeerCQ: a decentralized and self-configuring peer-to-peer information monitoring system, in Proceedings of the 23rd International Conference on Distributed Com- puting Systems (ICDCS), 2003
Genome@home, http://genomeathome.stanford.edu/
A. Ghodsi, L.O. Alima, S. Haridi, Symmetric replication for structured peer-to-peer systems, in Proceedings of the 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), 2005
G. Giakkoupis, V. Hadzilacos, A scheme for load balancing in heterogenous distributed hash tables, in Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), 2005
Gnutella, http://www.gnutella.com
P.B. Godfrey, I. Stoica, Heterogeneity and load balance in distributed hash tables, in Proceed- ings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2005
C.H. Goh, S. Bressan, S. Madnick, M. Siegel, Context interchange: new features and for- malisms for the intelligent integration of information. ACM Trans. Inf. Syst. 17(3), 270-293 (1999)
Google. Google web toolkit. http://code.google.com/webtoolkit/
T.J. Green, G. Miklau, M. Onizuka, D. Suciu, Processing XML streams with deterministic automata, in Proceedings of ICDT'2003, 2003
S. Gribble, A. Halevy, Z. Ives, M. Rodrig, D. Suciu, What can databases do for peer-to-peer, in Proceedings of the 4th International Workshop on the Web and Databases (WebDB), 2001
Groove, http://www.groove.net
S. Guha, N. Daswani, R. Jain, An experimental study of the Skype peer-to-peer VoIP system, in Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS), 2006
A. Gupta, D. Agrawal, A.E. Abbadi, Approximate range selection queries in peer-to-peer systems, in Proceedings of the 1st Conference on Innovative Data Systems Research (CIDR), 2003
A.K. Gupta, A.Y. Halevy, D. Suciu, View selection for stream processing, in Proceedings of the 5th International Workshop on the Web and Databases (WebDB), 2002
A.K. Gupta, D. Suciu, Stream processing of XPath queries with predicates, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2003
A.K. Gupta, D. Suciu, A.Y. Halevy, The view selection problem for XML content based routing, in Proceedings of the 22nd ACM Symposium on Principles of Database Systems (PODS), 2003
A. Guttman, R-trees: a dynamic index structure for spatial searching, in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47-57, 1984
A. Halevy, O. Etzioni, A. Doan, Z. Ives, J. Madhavan, L. McDowell, I. Tatarinov, Cross- ing the structure chasm, in Proceedings of the 1st Conference on Innovative Data Systems Research (CIDR), 2003
A. Halevy, Z. Ives, P. Monk, I. Tatarinov, Piazza: data management infrastructure for se- mantic web applications, in Proceedings of the 12th World Wide Web Conference (WWW), 2003
A. Halevy, Z. Ives, P. Mork, I. Tatarinov, Piazza: data management infrastructure for se- mantic web applications, in Proceedings of the 12th World Wide Web Conference (WWW), 2003
A. Halevy, Z. Ives, D. Suciu, I. Tatarinov, Schema mediation in peer data management systems, in Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE), 2003
S. Hand, T. Harris, E. Kotsovinos, I. Pratt, Controlling the XenoServer open platform, in Proceedings of the 6th IEEE Conference on Open Architectures and Network Programming (OpenArch), 2003
E.N. Hanson, C. Carnes, L. Huang, M. Konyala, L. Noronha, S. Parthasarathy, J.B. Park, A. Vernon, Scalable trigger processing, in Proceedings of the 15th IEEE International Con- ference on Data Engineering (ICDE), 1999
G. Hardin, The tragedy of the commons. Science 162, 1243-1248 (1968)
M. Harren, J.M. Hellerstein, R. Huebsch, B.T. Loo, S. Shenker, I. Stoica, Complex queries in DHT-based peer-to-peer networks, in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002
N.J.A. Harvey, M.B. Jones, S. Sarioiu, M. Theimer, A. Wolman, SkipNet: a scalable overlay network with practical locality properties, in Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS), 2003
Free Haven, http://www.freehaven.net/
K. Hinrichs, J. Nievergelt, The grid file: a data structure designed to support proximity queries on spatial objects, in Proceedings of the 9th International Workshop on Graph- Theoretic Concepts in Computer Science (WG), 1983
HiveCache, Swarmbackup: a peer-to-peer backup system, 2003
R. Housley, W. Ford, W. Polk, D. Solo, Internet x.509 public key infrastructure certificate and crl profile, in RFC 2459, 1999
R. Huebsch, J.M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker, I. Stoica, Querying the inter- net with PIER, in Proceedings of the 29th International Conference on Very Large Databases (VLDB), 2003
P. Indyk, R. Motwani, Approximate nearest neighbor-towards removing the curse of dimen- sionality, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC), 1998
M. Ingram, Online music-swap firm napster forms strategic alliance with media giant bertles- mann. http://www.wsws.org/articles/2000/nov2000/nap-n04.shtml, November 2000 References
International Telegraph and Telephone Consultative Committee (CCITT). The Directory- Authentication Framework, Recommendation X. 509. 1993 update
S. Iyer, A. Rowstron, P. Drusche, SQUIRREL: a decentralized, peer-to-peer web cache, in Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002
Jabber, http://www.jabber.org/
H.V. Jagadish, B.C. Ooi, K.-L. Tan, C. Yu, R. Zhang, iDistance: an adaptive B + -tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364-397 (2005)
H.V. Jagadish, B.C. Ooi, Q.H. Vu, BATON: a balanced tree structure for peer-to-peer networks, in Proceedings of the 31st International Conference on Very Large Databases (VLDB), pp. 661-672, 2005
H.V. Jagadish, B.C. Ooi, Q.H. Vu, R. Zhang, A. Zhou, VBI-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes, in Proceedings of the 22nd IEEE Inter- national Conference on Data Engineering (ICDE), 2006
Joost. Joost P2P tv. http://www.joost.com/
P. Kalnis, W.S. Ng, B.C. Ooi, D. Papadias, K.-L. Tan, An adaptive peer-to-peer network for distributed caching of OLAP results, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2002
V. Kalogeraki, D. Gunopulos, D. Zeinalipour-yazti, A local search mechanism for peer-to- peer networks, in Proceedings of the 11th ACM International Conference on Information and Knowledge Management (CIKM), 2002
S. Kamvar, M. Schlosser, H. Garcia-Molina, Eigenrep: reputation management in P2P net- works, in Proceedings of the 12th World Wide Web Conference (WWW), 2003
G. Kan, Gnutella, in Peer-to-Peer: Harnessing the Power of Disruptive Technologies (O'Reilly & Associates, 2001), pp. 94-122
D. Karger, F. Kaashoek, I. Stoica, R. Morris, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, in Proceedings of the ACM SIGCOMM Conference, pp. 149-160, 2001
D. Karger, M. Ruhl, Simple efficient load balancing algorithms for peer-to-peer systems, in Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004
D.R. Karger, M.F. Kaashoek, Koorde: a simple degree-optimal distributed hash table, in Pro- ceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
T. Katchaounov, V. Josifovski, T. Risch, Scalable view expansion in a peer mediator sys- tem, in Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA), 2003
D. Kato, GISP: global information sharing protocol-a distributed index for peer-to-peer systems, in Proceedings of 2nd IEEE International Conference on Peer-to-Peer Computing, 2002
A. Kementsietsidis, M. Arenas, Data sharing through query translation in autonomous sources, in Proceedings of the 30th International Conference on Very Large Databases (VLDB), 2004
A. Kementsietsidis, M. Arenas, R.J. Miller, Managing data mappings in the Hyperion project, in Proceeding of the 19th IEEE International Conference on Data Engineering (ICDE), 2003
A. Kementsietsidis, M. Arenas, R.J. Miller, Mapping data in peer-to-peer systems: semantics and algorithmic issues, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2003
A. Kementsietsidis, M. Arenas, R.J. Miller, Mapping data in peer-to-peer systems: semantics and algorithmic issues, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2003
K. Kenthapadi, G.S. Manku, Decentralized algorithms using both local and random probes for P2P load balancing, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2004
P. Keyani, B. Larson, M. Senthil, Peer pressure: Distributed recovery from attacks in peer- to-peer systems. Lect. Notes Comput. Sci. 2376, 306-320 (2002)
C. Killian, J.W. Anderson, R. Braud, R. Jhala, A. Vahdat, Mace: language support for build- ing distributed systems, in Proceedings of PLDI Conference, 2007
R.A. Kowalski, The early years of logic programming. Commun. ACM 31(1), 38-43 (1988)
J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weath- erspoon, W. Weimer, C. Wells, B. Zhao, Oceanstore: an architecture for global-scale per- sistent storage, in Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (ACM, New York, 2000), pp. 190-201
V. Kumar, Trust and security in peer-to-peer system, in Proceedings of the 17th International Conference on Database and Expert Systems Applications (DEXA), pp. 703-707, 2006
M. Landers, H. Zhang, K.-L. Tan, PeerStore: better performance by relaxing in peer-to-peer backup, in Proceedings of the 4th IEEE International Conference on Peer-to-Peer Comput- ing, pp. 72-79, August 2004
A. Langley, Freenet, in Peer-to-Peer: Harnessing the Power of Disruptive Technologies (O'Reilly & Associates, 2001), pp. 123-132
J. Lee, H. Lee, S. Kang, S. Choe, J. Song, CISS: an efficient object clustering framework for DHT-based peer-to-peer applications, in Proceedings of the 2nd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), pp. 215-229, 2004
S. Lee, R. Sherwood, B. Bhattacharjee, Cooperative peer groups in nice, in Proceedings of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFO- COM), 2003
M. Li, W.-C. Lee, A. Sivasubramaniam, DPTree: a balanced tree based indexing framework for peer-to-peer systems, in Proceedings of the 14th International Conference on Network Protocols (ICNP), 2006
X. Li, J. Wu, Searching techniques in peer-to-peer networks, in Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor and Peer-to-Peer Network, pp. 613-642. Averbach, 2006
C.Y. Liau, W.S. Ng, Y. Shu, K.-L. Tan, S. Bressan, Efficient range queries and fast lookup services for scalable P2P networks, in Proceedings of the 2nd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), pp. 78-92, 2004
M. Lillibridge, S. Elnikety, A. Birrel, M. Burrows, M. Isard, A cooperative internet backup scheme, in Proceedings of the USENIX Annual Technical Conference, pp. 29-41, 2003
B. Ling, Z. Lu, W.S. Ng, B.C. Ooi, K.-L. Tan, A. Zhou, A content-based resource location mechanism in PeerIS, in Proceedings of the 3rd International Conference on Web Informa- tion Systems Engineering (WISE), pp. 279-290, 2002
L. Liu, C. Pu, W. Tang, Continual queries for internet scale event-driven information delivery. IEEE Trans. Knowl. Data Eng., Special Issue on Web Technology (1999)
B.T. Loo, The design and implementation of declarative networks. PhD thesis, University of California at Berkeley, 2006
B.T. Loo, R. Huebsch, I. Stoica, J. Hellerstein, The case for a hybrid P2P search infrastruc- ture, in Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004
Sharman Networks Ltd. Kazaa media desktop. http://www.kazaa.com, 2001
J. Lu, J. Callan, Content-based retrieval in hybrid peer-to-peer networks, in Proceedings of the 12th ACM International Conference on Information and Knowledge Management (CIKM), pp. 199-206, 2003
J. Lu, J. Callan, Federated search of text-based digital libraries in hierarchical peer-to-peer networks, in Proceedings of the 27th European Conference on Information Retrieval (ECIR), pp. 52-66, 2005
S. Ludwig, J. Beda, P. Saint-Andre, R. McQueen, S. Egan, J. Hildebrand, Jingle: XMPP extension protocol 0166. http://xmpp.org/extensions/xep-0166.html
N. Luhmann, Trust and Power (Wiley, Chichester, 1979) References
M. Lupu, J. Li, B.C. Ooi, S. Shi, Clustering wavelets to speed-up data dissemination in structured P2P MANETs, in Proceeding of the 23rd IEEE International Conference on Data Engineering (ICDE), 2007
M. Lupu, S. Madnick, Implementing the COntext INterchange (COIN) approach through use of semantic web tools, in LNCS, vol. 5005 (Springer, Berlin, 2008), pp. 77-98
M. Lupu, B.C. Ooi, Y.C. Tay, Paths to stardom: calibrating the potential of a peer-based data management system, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008
M. Lupu, B. Yu, HiWaRPP-hierarchical wavelet-based retrieval on peer-to-peer network, in Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE), p. 133, 2006
T. Luu, F. Klemm, I. Podnar, M. Rajman, K. Aberer, Alvis peers: a scalable full-text peer-to- peer retrieval engine, in Proceedings of P2PIR, pp. 41-48, 2006
Q. Lv, P. Cao, E. Cohen, K. Li, S. Shenker, Search and replication in unstructured peer-to- peer networks, in Proceedings of the 16th ACM International Conference on Supercomputing (ICS), pp. 84-95, 2002
S. Madden, M. Shah, J.M. Hellerstein, V. Raman, Continuously adaptive continuous queries over streams, in Proceedings of the ACM SIGMOD International Conference on Manage- ment of Data, 2002
J. Madhavan, A. Halevy, Composing mappings among data sources, in Proceedings of the 29th International Conference on Very Large Databases (VLDB), 2003
D. Malkhi, M. Naor, D. Ratajczak, Viceroy: a scalable and dynamic emulation of the but- terfly, in Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002
U. Manber, Finding similar files in a large file system, in Proceedings of the USENIX Winter 1994 Technical Conference, pp. 1-10, 17-21, San Fransisco, CA, USA, 1994
G.S. Manku, Balanced binary trees for ID management and load balance in distributed hash tables, in Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), 2004
S. Marsh, Formalising trust as a computational concept. PhD thesis, University of Stirling, Stirling, 1994
E. Martinian, Distributed Internet Backup System (DIBS), 2003
P. Maymounkov, D. Mazieres, Kademlia: a peer-to-peer information system based on the xor metric, in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), March 2002
McAfee, McAfee rumor technology. http://www.mcafeeasap.com/intl/EN/content/ virusscan_asap/rumor.asp
R.C. Merkle, A certified digital signature, in Proceedings of the 9th International Cryptology Conference (CRYPTO), pp. 218-238, Santa Barbara, CA, August 1989
Microsoft, Peer name resolution protocol (PNRP) version 4.0 specification. http://msdn.microsoft.com/en-us/library/cc239047.aspx, 2008
J. Miller, Jabber: conversational technologies, in Peer-to-Peer: Harnessing the Power of Dis- ruptive Technologies (O'Reilly & Associates, 2001), pp. 77-88
M. Mitzenmacher, The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst. 12(10), 1094-1104 (2001)
A.T. Mizrak, Y. Cheng, V. Kumar, S. Savage, Structured superpeers: leveraging heterogene- ity to provide constant-time lookup, in Proceedings of the 3rd IEEE Workshop on Internet Applications (WIAPP), 2003
A. Mondal, Y. Lifu, M. Kitsuregawa, P2PR-Tree: an R-tree-based spatial index for peer-to- peer environments, in Proceedings of the EDBT Workshop on P2P and Databases (P2PDB), 2004
Napster filesharing system, shutdown as of March 2001. http://www.napster.com, 2000
R.M. Needham, Denial-of-service: an example. Commun. ACM 37(11), 42-46 (1994)
W. Nejdl, W. Siberski, M. Sintek, Design issues and challenges for rdf-and schema-based peer-to-peer systems. SIGMOD Rec. 32(3), 41-46 (2003)
W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer, T. Risch, Edutella: a P2P networking infrastructure based on rdf, in Proceedings of the 11th World Wide Web Conference (WWW), 2002
Net-Z, http://www.proksim.com/
P.G. Neumann, Inside risks: denial-of-service attacks. Commun. ACM 43(4), 136-136 (2000)
C.H. Ng, K.C. Sia, Peer clustering and firework query model, in Proceedings of the 11th World Wide Web Conference (WWW), 2002
W.S. Ng, B.C. Ooi, Y.F. Shu, K.-L. Tan, W.H. Tok, Efficient distributed CQ processing using peers, in Proceedings of the 12th World Wide Web Conference (WWW), 2003
W.S. Ng, B.C. Ooi, K.L. Tan, BestPeer: a self-configurable peer-to-peer system, in Proceed- ings of the 18th IEEE International Conference on Data Engineering (ICDE), p. 272, San Jose, CA, April 2002
W.S. Ng, B.C. Ooi, K.-L. Tan, A. Zhou, PeerDB: a P2P-based system for distributed data sharing, in Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE) (IEEE Press, New York, 2003)
W.S. Ng, W.H. Tok, B.C. Ooi, K.-L. Tan, A. Zhou, Efficient pervasive continuous query processing using peers. Technical report, Department of Computer Science, National Uni- versity of Singapore, 2002
T.-W. Ngan, D. Wallach, P. Druschel, Enforcing fair sharing of peer-to-peer resources, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, USA, 2003
NICE, http://www.cs.umd.edu/projects/nice/
M. Nottingham, Caching tutorial for web authors and webmasters. http://www.mnot.net/ cache_docs/, 2003
D. Novak, P. Zezula, M-Chord: a scalable distributed similarity search structure, in Proceed- ings of the 1st International Conference on Scalable Information Systems (INFOSCALE), 2006
M.A. Nowak, K. Sigmund, Evolution of indirect reciprocity by image scoring. Nature 393, 573-577 (1998)
OceanStore, http://oceanstore.cs.berkeley.edu/
C. O'Donnell, V. Vaikuntanathan, Information leak in the chord lookup protocol, in Proceed- ings of the 4th IEEE International Conference on Peer-to-Peer Computing, August 2004
L. Oliveira, L. Lopes, F. Silva, P3: parallel peer to peer an internet parallel programming environment, in Proceedings of the Workshop on Web Engineering and Peer-to-Peer Com- puting, pp. 274-288, 2002
B.C. Ooi, K.-L. Tan, C. Yu, S. Bressan, indexing the edges-a simple and yet efficient ap- proach to high-dimensional indexing, in Proceedings of the 19th ACM Symposium on Prin- ciples of Database Systems (PODS), pp. 166-174, 2000
Openext, http://www.openext.com/
A. Oram (ed.), Peer-to-Peer: Harnessing the Power of Disruptive Technologies (O'Reilly & Associates, 2001)
A. Oram, Gnutella and Freenet represent true technological innovation. http://www.openp2p. com/pub/a/208, 2003
J. Ott, D. Kutscher, Applying DTN to mobile internet access: an experiment with HTTP. Technical Report tr-tzi-050701, Helsinki University of Technology, Networking Laboratory, 2005
H. Pang, K.-L. Tan, Authenticating query results in edge computing, in Proceedings of the 20th IEEE Conference on Data Engineering (ICDE) (IEEE Press, New York, 2004), pp. 572-583
X. Pang, B. Catania, K.-L. Tan, Securing your data in agent-based P2P systems, in Proceed- ings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA), 2003
V. Papadimos, D. Maier, Mutant query plans. Inf. Softw. Technol. 44(4), 197-206 (2002) References
V. Papadimos, D. Maier, K. Tufte, Distributed query processing and catalogs for peer-to-peer systems, in Proceedings of the 1st Conference on Innovative Data Systems Research (CIDR), 2003
M. Papazoglou, Web Services: Principles and Technology (Addison-Wesley Longman, Read- ing, 2007)
A. Pfitzmann, M. Köhntopp, Anonymity, unobservability, and pseudonymity: a proposal for terminology. http://www.koehntopp.de/marit/pub/anon/Anon_Terminology_IHW.pdf, 2001
M. Pitkanen, J. Ott, Enabling opportunistic storage for mobile DTNs. in Pervasive and Mo- bile Computing, 2008
C. Plaxton, R. Rajaraman, A. Richa, Accessing nearby copies of replicated objects in a dis- tributed environment, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 311-320, 1997
C.G. Plaxton, R. Rajaraman, A.W. Richa, Accessing nearby copies of replicated objects in a distributed environment, in Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 311-320, 1997
V. Pless, Introduction to the Theory of Error-Correcting Codes, 3rd edn. (Wiley, New York, 1998)
W. Pugh, Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668- 676 (1990)
J. Pujol, R. Sanguesa, Extracting reputation in multi agent systems by means of social net- work topology, in Proceedings of the 1st International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2002
C. Qu, W. Nejdl, M. Kriesell, Cayley DHTs-a group theoretic framework for analyzing DHTs based on Cayley graphs, in Proceedings of the 2nd International Symposium on Par- allel and Distributed Processing and Applications (ISPA), 2004
V. Ramasubramanian, E.G. Sirer, Beehive: exploiting power law query distributions for O(1) lookup performance in peer to peer overlays, in Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 331-342, 2004
A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, I. Stoica, Load balancing in structured P2P systems, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
D. Ratajczak, J.M. Hellerstein, Deconstructing DHTs. Technical Report IRB-TR-04-042, Intel Research Berkeley, November 2003
S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker, A scalable content-addressable network, in Proceedings of the ACM SIGCOMM Conference, pp. 161-172, 2001
D. Reed, I. Pratt, P. Menage, S. Early, N. Stratford, Xenoservers: accounted execution of untrusted code, in Proceedings of the 7th Workshop on Hot Topics in Operating Systems (HotOS), 1999
M.E. Renada, J. Callan, The robustness of content-based search in hierarchical peer to peer networks, in Proceedings of the 13th ACM International Conference on Information and Knowledge Management (CIKM), pp. 562-570, 2004
P. Reynolds, A. Vahdat, Efficient peer-to-peer keyword searching, in Proceedings of the In- ternational Conference on Middleware, pp. 21-40, 2003
S.C. Rhea, J. Kubiatowicz, Probabilistic location and routing, in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2002
R.L. Rivest, RFC 1321: the MD5 message-digest algorithm, in Internet Activities Board, April 1992
A. Rodriguez, C. Killian, S. Bhat, D. Kostic, A. Vahdat, MACEDON: methodology for au- tomatically creating, evaluating and designing overlay networks, in Proceedings of NSDI Symposium, 2004
P. Rodriguez-Gianolli, A. Kementsietsidis, M. Garzetti, I. Kiringa, L. Jiang, M. Masud, R.J. Miller, J. Mylopoulos, Data sharing in the Hyperion peer database system, in Proceedings of the 31st International Conference on Very Large Databases (VLDB), 2005
M. Roussopoulos, M. Baker, CUP: Controlled update propagation in peer-to-peer networks, in Proceedings of the 2003 USENIX Annual Technical Conference, 2003
A. Rowstron, P. Druschel, Pastry: scalable, distributed object location and routing for large- scale peer-to-peer systems, in Proceedings of the 18th IFIP/ACM International Conference of Distributed Systems Platforms (Middleware), pp. 329-350, 2001
A. Rowstron, P. Druschel, Storage management and caching in PAST: a large-scale, persis- tent peer-to-peer storage utility, in Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), pp. 188-201, Banff, Canada, October 2001
J. Sabater, C. Sierra, Regret: a reputation model for gregarious societies, in Proceedings of the 4th Workshop on Deception, Fraud and Trust in Agetn Societies, 2001
H. Sagan, Space-Filling Curves (Springer, Berlin, 1994)
O.D. Sahin, F. Emekci, D. Agrawal, A.E. Abbadi, Content-based similarity search over peer- to-peer systems, in Proceedings of the 2nd International Workshop On Databases, Informa- tion Systems and Peer-to-Peer Computing (DBISP2P), pp. 61-78, 2004
O.D. Sahin, A. Gulbeden, F. Emekci, D. Agrawal, A. El Abbadi, PRISM: indexing multi- dimensional data in P2P networks using reference vectors, in Proceedings of the 13th annual ACM International Conference on Multimedia, pp. 946-955, 2005
O.D. Sahin, A. Gupta, D. Agrawal, A. El Abbadi, A peer-to-peer framework for caching range queries, in Proceedings of the 20th IEEE International Conference on Data Engineer- ing (ICDE), 2004
P. Saint-Andre, Serverless messaging: XMPP extension protocol 0174. http://xmpp.org/ extensions/xep-0174.html
G. Salton, A. Wong, C.S. Yang, A vector space model for automatic indexing. Commun. ACM 18(11), 613-620 (1975)
S. Saroiu, P.K. Gummadi, S.D. Gribble, A measurement study of peer-to-peer file sharing systems, in Proceedings of the 9th Multimedia Computing and Networking (MMCN), 2002
M. Schlosser, M. Sintek, S. Decker, W. Nejdl, A scalable and ontology-based P2P infrastruc- ture for semantic web services, in Proceedings of 2nd IEEE International Conference on Peer-to-Peer Computing, 2002
M.T. Schlosser, M. Sintek, S. Decker, W. Nejdl, HyperCuP-hypercubes, ontologies, and efficient search on peer-to-peer networks, in Proceedings of the International Workshop on Agents and Peer-to-Peer Computing (AP2PC), pp. 112-124, 2002
C. Schmidt, M. Parashar, Flexible information discovery in decentralized distributed sys- tems, in Proceedings of the 12th International Symposium on High Performance Distributed Computing (HPDC), 2003
SETI@home, http://setiathome.ssl.berkeley.edu/
Shareaza, http://www.shareaza.com/
H. Shen, Y. Shu, B. Yu, Efficient semantic-based content search in P2P network. IEEE Trans. Knowl. Data Eng. 16(7), 813-826 (2004)
C. Shirky, Listening to Napster, in Peer-to-Peer: Harnessing the Power of Disruptive Tech- nologies. (O'Reilly & Associates, 2001)
C. Shirky, What is P2P. . . and what isn't. http://www.openp2p.com/pub/a/p2p/2000/11/24/ shirky1-whatisp2p.html
Y. Shu, K.-L. Tan, A. Zhou, Adapting the content native space for load balanced, in Proceed- ings of the 2nd International Workshop On Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), pp. 122-135, 2004
K. Shudo, Y. Tanaka, S. Sekiguchi, Overlay weaver: an overlay construction toolkit. Comput. Commun. 31(2) (2008)
A. Singla, C. Rohrs, Ultrapeers: another step towards Gnutella scalability. http://groups. yahoo.com/group/the_gdf/files/Proposals/Working%20Proposals/Ultrapeer/, 2002
E. Sit, J. Cates, R. Cox, A DHT-based backup system, in Proceedings of the 1st IRIS Student Workshop, 2003
E. Sit, A. Haeberlen, F. Dabek, B.-G. Chun, H. Weatherspoon, R. Morris, M.F. Kaashoek, J. Kubiatowicz, Proactive replication, for data durability, in Proceedings of the 3rd Interna- tional Workshop on Peer-to-Peer Systems (IPTPS), 2006
E. Sit, R. Morris, Security considerations for peer-to-peer distributed hash tables, in Pro- ceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), pp. 261-269, Cambridge, MA, 2002
M. Slee, A. Agarwal, M. Kwiatkowski, Thrift: scalable cross-language services implemen- tation. http://developers.facebook.com/thrift/, 2007
A.C. Snoeren, K. Conley, D.K. Gifford, Mesh-based content routing using XML, in Proceed- ings of the 18th ACM Symposium on Operating Systems Principles (SOSP), 2001
K. Sripanidkulchai, B. Maggs, H. Zhang, Efficient content location using interest-based lo- cality in peer-to-peer systems, in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003
M. Srivatsa, L. Xiong, L. Liu, Trustguard: countering vulnerabilities in reputation manage- ment for decentralized overlay networks, in Proceedings of the 14th World Wide Web Con- ference (WWW), 2005
N. Stakhanova, S. Basu, J. Wang, O. Stakhanov, Trust framework for P2P networks using peer-profile based anamoly technique, in Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS), 2005
W.R. Stevens, UNIX Network Programming (Prentice-Hall, New York, 1998)
J. Stribling, I.G. Councill, J. Li, M.F. Kaashoek, D.R. Karger, R. Morris, S. Shenker, OverCite: a cooperative digital research library, in Proceedings of the 4th International Work- shop on Peer-to-Peer Systems (IPTPS), pp. 69-79, 2005
T. Suel, C. Mathur, J. Wu, J. Zhang, A. Delis, M. Kharrazi, X. Long, K. Shanmugasundaram, ODISSEA: a peer-to-peer architecture for scalable web search and information retrieval, in Proceedings of the 6th International Workshop on the Web and Databases (WebDB), 2003
Q. Sun, H. Garcia-Molina, SLIC: a selfish link-based incentive mechanism for unstructured peer-to-peer networks, in Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS), pp. 506-515, Tokyo, Japan, March 2004
G. Suryanarayana, R.N. Taylor, A survey of trust management and resource discovery tech- nologies in peer-to-peer applications. Technical report, UC Irvine, July 2004
A.S. Tanenbaum, Modern Operating Systems (Prentice-Hall, Upper Saddle River, 2001)
C. Tang, S. Dwarkadas, Hybrid global-local indexing for efficient peer-to-peer information retrieval, in Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 211-224, 2004
C. Tang, Z. Xu, S. Dwarkadas, Peer-to-peer information retrieval using self-organizing se- mantic overlay networks, in Proceedings of the ACM SIGCOMM Conference, pp. 175-186, 2003
C. Tang, Z. Xu, M. Mahalingam, pSearch: information retrieval in structured overlays, in Proceedings of the 1st Workshop on Hot Topics in Networks (HotNets), 2002
I. Tatarinov, A. Halevy, Efficient query reformulation in peer-data management systems, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004
The TLS Protocol Version 1.0. IETF RFC 2246. http://www.ietf.org/rfc/rfc2246.txt
M.R. Thompson, A. Essiari, S. Mudumbai, Certificate-based authorization policy in a PKI environment. ACM Trans. Inf. Syst. Secur. 6(4), 566-588 (2003)
W.H. Tok, S. Bressan, Efficient and adaptive processing of multiple continuous queries, in Proceedings of the 8th International Conference on Extending Database Technology (EDBT), 2002
B. Traversat, M. Abdelaziz, E. Pouyoul, Project jxta: a loosely-consistent dht rendezvous walker, 2003
P. Triantafillow, C. Xiruhaki, M. Koubarakis, N. Ntarmos, Towards high performance peer- to-peer content and resource sharing systems, in Proceedings of the 1st Conference on Inno- vative Data Systems Research (CIDR), 2003
A. Tridgell, Efficient algorithms for sorting and synchronization. PhD thesis, Australian Na- tional University, 1999
C. Tryfonopoulos, S. Idreos, M. Koubarakis, LibraRing: an architecture for distributed digital libraries based on DHTs, in Proceedings of the 9th European Conference on Research and Advanced Technology for Digital Libraries (ECDL), pp. 25-36, 2005
D. Tsoumakos, N. Roussopoulos, Adaptive probabilistic search in peer-to-peer networks, in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003
VeriSign, Addressing the effective enterprise communication challenge. White paper, Octo- ber 2007
A. Vlachou, C. Doulkeridis, Y. Kotidis, M. Vazirgiannis, SKYPEER: efficient subspace sky- line computation over distributed data, in Proceedings of the 23rd IEEE International Con- ference on Data Engineering (ICDE), 2007
Q.H. Vu, B.C. Ooi, D. Papadias, A.K.H. Tung, A graph method for keyword-based selection of the top-K databases, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008
W3C, Simple object access protocol recommendation (second edition). http://www.w3. org/TR/soap/, April 2007
M. Waldman, L. Cranor, A. Rubin, Publius, in Peer-to-Peer: Harnessing the Power of Dis- ruptive Technologies (O'Reilly & Associates, 2001), pp. 145-158
D. Wallach, A survey on peer-to-peer security issues, in Proceedings of the International Symposium on Software Security, Tokyo, Japan, November 2002
J. Wang, A survey of web caching schemes for the internet. ACM Comput. Commun. Rev. 25(9), 36-46 (1999)
S. Wang, B.C. Ooi, A.K.H. Tung, L. Xu, Efficient skyline query processing on peer-to-peer networks, in Proceedings of the 23rd IEEE International Conference on Data Engineering (ICDE), 2007
X. Wang, W.S. Ng, B.C. Ooi, K.-L. Tan, A. Zhou, BuddyWeb: a P2P-based collaborative web caching system, in Proceedings of the Web Engineering and Peer-to-Peer Computing, Networking Workshops, pp. 247-251, Pisa, Italy, 2002
Y. Wang, V. Viradharajan, Trust 2 : developing trust in peer-to-peer environments, in Proceed- ings of the IEEE International Conference on Services Computing (SCC), pp. 24-31, 2005
Y. Wang, V. Viradharajan, Dynamictrust: the trust development in peer-to-peer environments, in Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC), pp. 302-305, 2006
H. Weatherspoon, J. Kubiatowicz, Erasure coding vs. replication: a quantitative comparison, in Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), March 2002
H. Weatherspoon, J. Kubiatowicz, Naming and integrity: self-verifying data in peer-to-peer systems, in Proceedings of the International Workshop on Future Directions in Distributed Computing (FuDiCo), pp. 142-147, 2003
A. Wierzbicki, N. Leibowitz, M. Ripeanu, R. Wozniak, Cache replacement policies revisited: the case of P2P traffic, in Proceedings of the 4th International Workshop on Global and Peer- to-Peer Computing (GP2P), 2004
S.K.M. Wong, W. Ziarko, V.V. Raghavan, P.C.N. Wong, On modeling of information retrieval concepts in vector spaces. ACM Trans. Database Syst. 12(3), 299-321 (1987)
P. Wu, C. Zhang, Y. Feng, B.Y. Zhao, D. Agrawal, A.E. Abbadi, Parallelizing skyline queries for scalable distribution, in Proceedings of the 10th International Conference on Extending Database Technology (EDBT), pp. 112-130, 2006
S. Wu, S. Jiang, B.C. Ooi, K.L. Tan, Distributed online aggregation, in Proceedings of the International Conference on Very Large Data Bases, 2009
S. Wu, J. Li, B.C. Ooi, K.-L. Tan, Just-in-time query retrieval over partially indexed data on structured P2P overlays, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008
L. Xiong, L. Liu, Peertrust: supporting reputation-based trust for peer-to-peer electronic com- munities. IEEE Trans. Knowl. Data Eng. 7, 843-857 (2004)
B. Yang, H. Garcia-Molina, Comparing hybrid peer-to-peer systems, in Proceedings of the 27th International Conference on Very Large Data Bases (VLDB), 2001
B. Yang, H. Garcia-Molina, Efficient search in peer-to-peer networks, in Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS), 2001 References
B. Yang, H. Garcia-Molina, Improving search in peer-to-peer networks, in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), 2002
B. Yang, H. Garcia-Molina, Designing a super-peer network, in Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE), 2003
P.N. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, in Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993
B. Yu, G. Li, K. Sollins, A.K.H. Tung, Effective keyword-based selection of relational data- bases, in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2007
M.J. Yuan, Mobile P2P messaging. http://www.ibm.com/developerworks/wireless/library/ wi-p2pmsg/, December 2002
C. Zhang, A. Krishnamurthy, R.Y. Wang, SkipIndex: towards a scalable peer-to-peer index service for high dimensional data. Technical Report TR-703-04, Princeton University, 2004
B.Y. Zhao, J.D. Kubiatowicz, A.D. Joseph, Tapestry: an infrastructure for fault-tolerant wide- area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley, Berkeley, CA, 2001
R. Zhou, K. Hwang, Powertrust: a robust and scalable reputation system for trusted peer-to- peer computing. IEEE Trans. Parallel Distrib. Syst. 29(8-13), 953-964 (2006)
S. Zhou, Z. Zhang, W. Qian, A. Zhou, SIPPER: selecting informative peers in structured P2P environment for content-based retrieval, in Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE), p. 161, 2006
P. Zimmermann, PGP User's Guide (MIT Press, Cambridge, 1994)

P2p-computing

Sign up for access to the world's latest research

Abstract

Related papers

References (351)

Related papers