An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 1
|
|
- Sharlene Hodges
- 6 years ago
- Views:
Transcription
1 An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 1 Bo Xie, Peng Han, Fan Yang, Ruimin Shen Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai , China {Bxie, phan, fyang, rmshen}@sjtu.edu.cn Abstract. Distributed Collaborative Filtering (DCF) has gained more and more attention as an alternative implementation scheme of CF based recommender system, because of its advantage in scalability and privacy protection. However, as there is no central user database in DCF systems, the task of neighbor searching becomes much more difficult. In this paper, we first propose an efficient distributed user profile management scheme based on distributed hash table (DHT) method, which is one of the most popular and effective routing algorithm in Peer-to-Peer (P2P) overlay network. Then, we present a heuristic neighbor searching algorithm to locate potential neighbors of the active users in order to reduce the network traffic and executive cost. The experimental data show that our DCF algorithm with the neighbor searching scheme has much better scalability than traditional centralized ones with comparable prediction efficiency and accuracy. 1 Introduction While the rapid development of network and information technology provides people with unprecedented abundant information resources, it also brings the problem of information overload. So how to help people find their interested resources attracted much attention from both the researchers and the vendors. Among the technologies proposed, Collaborative Filtering (CF) has proved to be one of the most effective for its simplicity both in theory and implementation. Since Goldberg et al [1] published the first account of using it for information filtering, CF has achieved great success both in the research [2, 3] and application [4, 5, 6] area. The key idea of CF is that users will prefer those items that people with similar interests prefer. Due to different techniques used to describe and calculate the similarities between users, CF algorithms have often been divided into two general classes [3]: memory-based algorithm and model-based algorithm. Memory-based algorithms directly calculate the similarities between the active users and other users, and then use the K most similar users (K nearest neighbors) to make prediction. In contrast, model-based algorithms first construct a predictive model from the user database, and then use it to make prediction. As the calculation complexity of both the 1 Supported by the National Natural Science Foundation of China under Grant No
2 2 Bo Xie, Peng Han, Fan Yang, Ruimin Shen calculation of similarities and the construction of model increased quickly both in time and space as the record in the database increases, the two kinds of algorithms both suffered from their shortage in efficiency and scalability. So recent years, Distributed CF (DCF) has gained more and more attention as an alternative implementation scheme of CF based recommender system [8, 9] because of its advantage in scalability. However, as there is no central user database in DCF systems, the task of neighbor searching becomes much more difficult. In [8], Tviet uses a routing algorithm similar to Gnutella [15] to forward the neighbor query information. As it is a broadcasting routing algorithm, when the user number is large it will cause unimaginable heavy traffic in the network. In [9], Olsson improves this by only exchanging information between neighbors, however it also reduces the efficiency of finding similar users. Still, as they all used a totally different mechanism to make prediction, their performance is hard to analyze and the existing improvement on CF algorithms cannot be used any more. In this paper, we first propose an efficient distributed user profile management scheme based on distributed hash table (DHT) method, which is one of the most popular and effective routing algorithm in Peer-to-Peer (P2P) overlay network. Then, we present a heuristic neighbor searching algorithm to locate potential neighbors of the active users. The main advantages of our algorithm include: 1. Both the user database management and prediction computation task can be done in a decentralized way which increases the algorithm s scalability dramatically. 2. The implementation of our neighbor searching algorithm on a DHT-based P2P overlay network is quite straightforward which can obtain efficient retrieval time and excellent performance at the same time. 3. It keeps all the other features of traditional memory-based CF algorithm so that the system s performance can be analyzed both empirically and theoretically and the improvement on traditional memory-based algorithm can also be applied here. The rest of this paper is organized as follows. In Section 2, several related works are presented and discussed. In Section 3, we give the architecture and key features of our algorithm, and describe the implementation of it on a DHT-based P2P overlay network in Section 4. In Section 5 the experimental results of our system are presented and analyzed. Finally we make a brief concluding remark in Section 6. 2 Related Works 2.1 Memory-Based CF Algorithm Generally, the task of CF is to predict the votes of active users from the user database which consists of a set of votes corresponding to the vote of user i on item j. The memory-based CF algorithm calculates this prediction as a weighted average of other users votes on that item through the following formula:
3 An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 3 P n a, j = va + κ ϖ ( a, j)( vi, j vi ) i = 1 (1) Where P a, j denotes the prediction of the vote for active user a on item j and n is the number of users in user database. v i is the mean vote for user i as: 1 (2) v i = vi j Ii, j I i Where Ii is the set of items on which user i has voted. The weights ϖ ( a, j) reflect the similarity between active user and users in the user database. κ is a normalizing factor to make the absolute values of the weights sum to unity. 2.2 P2P System and DHT Routing Algorithm The term Peer-to-Peer refers to a class of systems and applications that employ distributed resources to perform a critical function in a decentralized manner. With the pervasive deployment of computers, P2P is increasingly receiving attention in research and more and more P2P systems have been deployed on the Internet. Some of the benefits of a P2P approach include: improving scalability by avoiding dependency on centralized points; eliminating the need for costly infrastructure by enabling direct communication among clients; and enabling resource aggregation. As the main purpose of P2P systems are to share resources among a group of computers called peers in a distributed way, efficient and robust routing algorithms for locating wanted resource is critical to the performance of P2P systems. Among these algorithms, distributed hash table (DHT) algorithm is one of the most popular and effective and supported by many P2P systems such as CAN [10], Chord [11], Pastry [12], and Tapestry [13]. A DHT overlay network is composed of several DHT nodes and each node keeps a set of resources (e.g., files, rating of items). Each resource is associated with a key (produced, for instance, by hashing the file name) and each node in the system is responsible for storing a certain range of keys. There are two basic operations: (1) put(key, value); (2)lookup(key), and two layers: (1)route(key, message); (2)key/value storage in the DHT overlay network. Peers in the DHT overlay network can announce what resource they have by issue a put(key, value) message, or locate their wanted resource by issue a lookup(key) request which returns the identity (e.g., the IP address) of the node that stores the resource with the certain key. The primary goals of DHT are to provide an efficient, scalable, and robust routing algorithm which aims at reducing the number of P2P hops, which are involved when we locate a certain resource, and to reduce the amount of routing state that should be preserved at each peer. In Chord [11], each peer keeps track information of logn other peers where N is the total number of peers in the community. When a peer joins and leaves the overlay
4 4 Bo Xie, Peng Han, Fan Yang, Ruimin Shen network, this highly optimized version of DHT algorithm will only require notifying logn peers about that change. 3 Our Neighbor Searching Algorithm 3.1 Distributed User Profile Management Scheme Distributed user profile management has two key points: Division and Location. In our scheme, we wish to divide the original centralized user database into fractions (For concision, we will call such fractions by the term bucket in the following of this paper) in such a manner that potential neighbors can be put into the same bucket. So later we can access only several buckets to fetch the useful user profiles for the active users since retrieve all the buckets will cause unimaginable traffic in the network and often unnecessary. Here, we solve the first problem by proposing a division strategy which makes each bucket hold a group of users record who has a particular <ITEM_ID, VOTE> tuple. It means that users in the same bucket at least voted one item with the same rating. Figure1 illustrate our division strategy: Fig. 1. User Database Division Strategy Later when we want to make prediction for a particular user, we only need to retrieve those buckets which the active user s record is in. This strategy is based on the heuristic that people with similar interests will at least rate one item with similar votes. As we can see in Figure 3 of section 5.3.1, this strategy has a very high hitting ratio. Still, we can see that through this strategy we reduce about 50% calculation than traditional CF algorithm and obtain comparable prediction as shown in Figure 4 in section 5. After we make the proper division and choosing strategy of buckets, we still need an efficient way to locate and retrieve the needed buckets from the distributed network. As we mentioned in section 2.2, DHT has provided an efficient infrastructure to accomplish this task. We will discuss this in detail in section 4.
5 An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network Neighbor Searching in DCF Return All vs. Return K In the buckets choosing strategy mentioned in section 3.1, we return all users which are in the at least one same bucket with the active user. As we can see in Figure 5 in section 5.3.2, this strategy has an O(N) fetched user number where N is the total user number. In fact, as Breese presented in [3] by the term inverse user frequency, universally liked items are not as useful as less common items in capturing similarity. So we introduce a new concept significance refinement (SR) which reduces the returned user number of the original strategy by limiting the number of returned users for each bucket. We term this strategy improved by SR as Return K which means for every rated item, we return no more than K users for each bucket and call the original strategy as Return All. The experimental result in Figure 5 and 6 of Section shows that this method reduces the returned user number dramatically and also improves the prediction accuracy Improved Return K Strategy Although the Return K strategy proved to increase the scalability of our DCF algorithm, it has the shortage of unstable when the number of users in each bucket increases because the chosen of the K users is random. As we can see in Figure 7, when the total number of users is above 40,000, the average bucket size is more than 60. So the randomization of neighbor choosing will cause much uncertainty in prediction. There are two natural ways to solve this problem: increase the value of K or do some filtering at the node holding the bucket. However, the first method will increase the traffic dramatically while the second will cause much more calculation. In our method, we add a mergence procedure in our neighbor choosing strategy, which we called Improved Return K strategy. In this new strategy, before we retrieve the user record back, we first get the user ID list from each bucket which will cause little traffic. Then we merge the same user ID locally and generate a ranked list of user ID according to their occurrence. The user ID with the most occurrences, which mean those users who have the most same voting as the active user, will appear at the top of the list. After that, we only fetch the top K users record in the ranked list and made prediction based on them. We can see from Figure 5 and 6 in Section 5, the improved return K strategy has a better scalability and prediction strategy. 4 Implementation of Our Neighbor Searching Algorithm on a DHT-based P2P Overlay Network 4.1 System Architecture Figure 2 gives the system architecture of our implementation of DCF on the DHT-based P2P overlay network. Here, we view the users rating as resources and the
6 6 Bo Xie, Peng Han, Fan Yang, Ruimin Shen system generate a unique key for each particular <ITEM_ID, VOTE> tuple through the hash algorithm, where the ITEM_ID denotes identity of the item user votes on and VOTE is the user s rating on that item. As different users may vote particular item with same rating, each key will correspond to a set of users who have the same <ITEM_ID, VOTE> tuple corresponding to the key in their rating vector. As we stated in section 3, we call such set of users record as bucket. As we can see in Figure 2, each peer in the distributed CF system is responsible for storing one or several buckets using the distributed storage strategy described in Figure 1. Peers are connected through a DHT-based P2P overlay network. Peers can find their wanted buckets by their keys efficiently through the DHT-based routing algorithm which is the foundation of our implementation. As we can see from Figure 1 and Figure 2, the implementation of our PipeCF on DHT-based P2P overlay network is quite straightforward. DHT has provided a basic infrastructure to do the following things: 1. Define IDs, Vote ID to Node ID assignment 2. Define per-node routing table contents 3. Lookup algorithm that uses routing tables 4. Join procedure to reflect new nodes in tables 5. Failure recovery For our DHT-based CF scenario, IDs are 128-bit numbers. Vote IDs are chosen by MD5 hash of user s <ITEM_ID,VOTE> tuple, and Node IDs are chosen by MD5 hash of user s <IP address, MAC address>. Key is stored on node with numerically closest ID. If node and key IDs are uniform, we get reasonable load balance. There are already two basic operations in DHT overlay network: put(key, value) and lookup(key). And for our special DHT-based CF scenario, we present two new operations: getuserid(votekey) and getuservalue(votekey,userkey). The first operation returns many userids which have the same <ITEM_ID,VOTE> tuple with the active user, and the second operation returns the candidate user s real rating vectors.
7 An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 7 Local vote vector Cached vote vectors Item_ID_1 1.0 Item_ID_2 5.0 Item_ID_1 3.0 USER_5 Item_ID_n 9.0 Item_ID_1 3.0 USER_K USER_5 Local vote vector Item_ID_1 5.0 Item_ID_2 9.0 Item_ID_n 2.0 Cached vote vectors Item_ID_4 4.0 USER_3 Item_ID_4 4.0 USER_K Local vote vector Item_ID_1 9.5 Item_ID_2 3.0 Item_ID_n 7.5 Cached vote vectors Item_ID_2 4.0 USER_3 Item_ID_2 4.0 USER_T USER_4 USER_3 Local vote vector Item_ID_1 5.0 Item_ID_2 7.5 Item_ID_n 6.0 Cached Vote Vectors Local vote vector Item_ID_1 5.5 Item_ID_2 2.5 Item_ID_n 9.0 Cached vote vectors Item_ID_3 4.0 USER_3 Item_ID_3 4.0 USER_K Fig. 2. System Architecture of Distributed CF Recommender System 5 Experimental Results 5.1 Data Set We use EachMovie data set [7] to evaluate the performance of improved algorithm. The EachMovie data set is provided by the Compaq System Research Center, which ran the EachMovie recommendation service for 18 months to experiment with a collaborative filtering algorithm. The information they gathered during that period consists of 72,916 users, 1,628 movies, and 2,811,983 numeric ratings ranging from 0 to Metrics and Methodology The metrics for evaluating the accuracy of we used here is statistical accuracy metrics which evaluate the accuracy of a predictor by comparing predicted values with userprovided values. More specifically, we use Mean Absolute Error (MAE), a statistical accuracy metrics, to report prediction experiments for it is most commonly used and easy to understand: MAE = a T a, j va, j p T (3)
8 8 Bo Xie, Peng Han, Fan Yang, Ruimin Shen Where v a, j is the rating given to item j by user a, is the predicted value of user a on item j, T is the test set, T is the size of the test set. We select 2000 users and choose one user as active user per time and the remainder users as his candidate neighbors, because every user only make self s recommendation locally. We use ALL-BUT-ONE strategy [3] and the mean prediction accuracy of all the 2000 users as the system's prediction accuracy. 5.3 Experimental Result We design several experiments for evaluating our algorithm and analyze the effect of various factors by comparison. All our experiments are run on a Windows 2000 based PC with Intel Pentium 4 processor having a speed of 1.8 GHz and 512 MB of RAM The Efficiency of Neighbor Choosing We used a data set of 2000 users and show among the users chosen by Return-All neighbor searching scheme, how many are in the top-100 users who have the most similarities with active users calculated by the traditional memory-based CF algorithms in Figure 3. We can see from the data that when the user number rises above 1000, more than 80 users who have the most similarities with the active users are chosen by our Neighbor choosing scheme Performance Comparison We compare the prediction accuracy of traditional CF algorithm and our Return-All algorithm and the results are shown as Figure 4. We can see that our algorithm has better prediction accuracy than the traditional CF algorithm. This result looks surprising at the first sight as the traditional CF selecting similar users from the whole user database while we use only a fraction. However, as we look in depth into our strategy, we find that we may filter out those users who have high-correlations with the active users but no same ratings. We have found that these users are bad predictors in [16] which provide explanation to our result. We then compared the performance of Return K and Return All by setting the K as 5. From the result Figure 6 we can see that by eliminating those users who have same ratings on popular items, the prediction accuracy can be increased further. DHT-based bucket distribution is illustrated in Figure 7, we can see that the more users, the larger bucket size, and when the total number of users is above 40,000, the average bucket size is more than 60. At last, we compare the performance of Improved Return K strategy. We can see In Figure 6 that we can obtain better performance while retrieving only 30 user records. Size of Users in Top 100(Predict 20%) Vector Similarity Pearson Similarity Total Size of Train Set(# of users) Fig. 3. How Many Users Chosen by DHT-based CF Fall in Traditional CF s Top 100 Mean Absolute Error Traditional CF DHT-based CF(Return All) Total Size of Train Set(# of users) Fig. 4. DHT-based CF vs. Traditional CF
9 An Efficient Neighbor Searching Scheme of Distributed Collaborative Filtering on P2P Overlay Network 9 Size of Fetched DHT Users DHT-based CF Return All DHT-based CF Return K(K=5) DHT-based CF Inproved Return K(K=30) Mean Absolute Error DHT-based CF Return All DHT-based CF Return K(K=5) DHT-based CF improved Return K(K=30) Total Size of Train Set(# of users) Fig. 5. The Effect on Scalability of Our Neighbor Searching Strategy Total Size of Train Set(# of users) Fig. 6. The Effect on Prediction Accuracy of Our Neighbor Searching Strategy users of eachmovie users of eachmovie 5000 Bucket Number User Number per Bucket(# of users) Fig. 7. The DHT Buckets Size Distribution 6 Conclusion In this paper, we first propose an efficient distributed user profile management scheme based on distributed hash table (DHT) method in order to solve the scalability problem of centralized KNN-based CF algorithm. Then, we present a heuristic neighbor searching algorithm to locate potential neighbors of the active users in order to reduce the network traffic and executive cost. The experimental data show that our DCF algorithm with the neighbor searching scheme has much better scalability than traditional centralized ones with comparable prediction efficiency and accuracy.
10 10 Bo Xie, Peng Han, Fan Yang, Ruimin Shen References 1. David Goldberg, David Nichols, Brian M. Oki, Douglas Terry.: Using collaborative filtering to weave an information tapestry, Communications of the ACM, v.35 n.12, p.61-70, Dec J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl.: An algorithmic framework for performing collaborative filtering. In Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, pages , Breese, J., Heckerman, D., and Kadie, C.: Empirical Analysis of Predictive Algorithms for Collaborative Filtering. Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, 1998 (43-52). 4. Paul Resnick, Neophytos Iacovou, Mitesh Suchak, Peter Bergstrom, John Riedl.: GroupLens: an open architecture for collaborative filtering of netnews, Proceedings of the 1994 ACM conference on Computer supported cooperative work, p , October 22-26, 1994, Chapel Hill, North Carolina, United States. 5. Upendra Shardanand, Pattie Maes.: Social information filtering: algorithms for automating word of mouth, Proceedings of the SIGCHI conference on Human factors in computing systems, p , May 07-11, 1995, Denver, Colorado, United States. 6. G. Linden, B. Smith, and J. York, Amazon.com Recommendations Item-to-item collaborative filtering, IEEE Internet Computing, Vo. 7, No. 1, pp. 7680, Jan Eachmovie collaborative filtering data set.: 8. Amund Tveit.: Peer-to-peer based Recommendations for Mobile Commerce. Proceedings of the First International Mobile Commerce Workshop, ACM Press, Rome, Italy, July 2001, pp Tomas Olsson.: "Bootstrapping and Decentralizing Recommender Systems", Licentiate Thesis , Department of Information Technology, Uppsala University and SICS, J. Canny.: Collaborative filtering with privacy. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages , Oakland, CA, May IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press. 11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker.: A scalable contentaddressable network. In SIGCOMM, Aug Stocal I et al.: Chord: A scalable peer-to-peer lookup service for Internet applications (2001). In ACM SIGCOMM, San Diego, CA, USA, 2001, pp Rowstron A. Druschel P.: Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In IFIP/ACM Middleware, Hedelberg, Germany, Zhao B Y et al.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech.Rep.UCB/CSB-0-114,UC Berkeley,EECS, M.Ripeanu, "Peer-to-peer Architecture Case Study: Gnutella Network", Technical Report, University of Chicago, Han Peng,Xie Bo,Yang Fan,Shen Ruimin, A Scalable P2P Recommender System Based on Distributed Collaborative Filtering, Expert systems with applications,27(2) Elsevier Sep 2004 (To appear)
A Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol
A Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol Min Li 1, Enhong Chen 1, and Phillip C-y Sheu 2 1 Department of Computer Science and Technology, University of Science and Technology of China,
More informationEarly Measurements of a Cluster-based Architecture for P2P Systems
Early Measurements of a Cluster-based Architecture for P2P Systems Balachander Krishnamurthy, Jia Wang, Yinglian Xie I. INTRODUCTION Peer-to-peer applications such as Napster [4], Freenet [1], and Gnutella
More informationA Super-Peer Based Lookup in Structured Peer-to-Peer Systems
A Super-Peer Based Lookup in Structured Peer-to-Peer Systems Yingwu Zhu Honghao Wang Yiming Hu ECECS Department ECECS Department ECECS Department University of Cincinnati University of Cincinnati University
More informationAthens University of Economics and Business. Dept. of Informatics
Athens University of Economics and Business Athens University of Economics and Business Dept. of Informatics B.Sc. Thesis Project report: Implementation of the PASTRY Distributed Hash Table lookup service
More informationPrivacy-Preserving Collaborative Filtering using Randomized Perturbation Techniques
Privacy-Preserving Collaborative Filtering using Randomized Perturbation Techniques Huseyin Polat and Wenliang Du Systems Assurance Institute Department of Electrical Engineering and Computer Science Syracuse
More informationArchitectures for Distributed Systems
Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced
More informationBuilding a low-latency, proximity-aware DHT-based P2P network
Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan
More informationDistributed Hash Table
Distributed Hash Table P2P Routing and Searching Algorithms Ruixuan Li College of Computer Science, HUST rxli@public.wh.hb.cn http://idc.hust.edu.cn/~rxli/ In Courtesy of Xiaodong Zhang, Ohio State Univ
More informationA Survey on Various Techniques of Recommendation System in Web Mining
A Survey on Various Techniques of Recommendation System in Web Mining 1 Yagnesh G. patel, 2 Vishal P.Patel 1 Department of computer engineering 1 S.P.C.E, Visnagar, India Abstract - Today internet has
More informationA Constrained Spreading Activation Approach to Collaborative Filtering
A Constrained Spreading Activation Approach to Collaborative Filtering Josephine Griffith 1, Colm O Riordan 1, and Humphrey Sorensen 2 1 Dept. of Information Technology, National University of Ireland,
More informationA Scalable Content- Addressable Network
A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics
More informationA Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables
A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables Takehiro Miyao, Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku,
More informationThe Tourism Recommendation of Jingdezhen Based on Unifying User-based and Item-based Collaborative filtering
The Tourism Recommendation of Jingdezhen Based on Unifying User-based and Item-based Collaborative filtering Tao Liu 1, a, Mingang Wu 1, b and Donglan Ying 2, c 1 School of Information Engineering, Jingdezhen
More informationA Recursive Prediction Algorithm for Collaborative Filtering Recommender Systems
A Recursive rediction Algorithm for Collaborative Filtering Recommender Systems ABSTRACT Jiyong Zhang Human Computer Interaction Group, Swiss Federal Institute of Technology (EFL), CH-1015, Lausanne, Switzerland
More informationProject Report. An Introduction to Collaborative Filtering
Project Report An Introduction to Collaborative Filtering Siobhán Grayson 12254530 COMP30030 School of Computer Science and Informatics College of Engineering, Mathematical & Physical Sciences University
More informationPUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks
PUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks Duc A. Tran Cuong Pham Network Information Systems Lab (NISLab) Dept. of Computer Science University of Massachusetts,
More informationCollaborative Filtering based on User Trends
Collaborative Filtering based on User Trends Panagiotis Symeonidis, Alexandros Nanopoulos, Apostolos Papadopoulos, and Yannis Manolopoulos Aristotle University, Department of Informatics, Thessalonii 54124,
More informationA Framework for Peer-To-Peer Lookup Services based on k-ary search
A Framework for Peer-To-Peer Lookup Services based on k-ary search Sameh El-Ansary Swedish Institute of Computer Science Kista, Sweden Luc Onana Alima Department of Microelectronics and Information Technology
More informationShould we build Gnutella on a structured overlay? We believe
Should we build on a structured overlay? Miguel Castro, Manuel Costa and Antony Rowstron Microsoft Research, Cambridge, CB3 FB, UK Abstract There has been much interest in both unstructured and structured
More informationEffect of Links on DHT Routing Algorithms 1
Effect of Links on DHT Routing Algorithms 1 Futai Zou, Liang Zhang, Yin Li, Fanyuan Ma Department of Computer Science and Engineering Shanghai Jiao Tong University, 200030 Shanghai, China zoufutai@cs.sjtu.edu.cn
More informationA Directed-multicast Routing Approach with Path Replication in Content Addressable Network
2010 Second International Conference on Communication Software and Networks A Directed-multicast Routing Approach with Path Replication in Content Addressable Network Wenbo Shen, Weizhe Zhang, Hongli Zhang,
More informationComparison of Recommender System Algorithms focusing on the New-Item and User-Bias Problem
Comparison of Recommender System Algorithms focusing on the New-Item and User-Bias Problem Stefan Hauger 1, Karen H. L. Tso 2, and Lars Schmidt-Thieme 2 1 Department of Computer Science, University of
More informationCollaborative Filtering using a Spreading Activation Approach
Collaborative Filtering using a Spreading Activation Approach Josephine Griffith *, Colm O Riordan *, Humphrey Sorensen ** * Department of Information Technology, NUI, Galway ** Computer Science Department,
More informationamount of available information and the number of visitors to Web sites in recent years
Collaboration Filtering using K-Mean Algorithm Smrity Gupta Smrity_0501@yahoo.co.in Department of computer Science and Engineering University of RAJIV GANDHI PROUDYOGIKI SHWAVIDYALAYA, BHOPAL Abstract:
More informationCS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University
CS 555: DISTRIBUTED SYSTEMS [P2P SYSTEMS] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Byzantine failures vs malicious nodes
More informationAggregation of a Term Vocabulary for P2P-IR: a DHT Stress Test
Aggregation of a Term Vocabulary for P2P-IR: a DHT Stress Test Fabius Klemm and Karl Aberer School of Computer and Communication Sciences Ecole Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
More informationIN recent years, the amount of traffic has rapidly increased
, March 15-17, 2017, Hong Kong Content Download Method with Distributed Cache Management Masamitsu Iio, Kouji Hirata, and Miki Yamamoto Abstract This paper proposes a content download method with distributed
More informationDesign of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem
Design of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem Bidyut Gupta, Nick Rahimi, Henry Hexmoor, and Koushik Maddali Department of Computer Science Southern Illinois
More informationPeer-to-Peer Systems and Distributed Hash Tables
Peer-to-Peer Systems and Distributed Hash Tables CS 240: Computing Systems and Concurrency Lecture 8 Marco Canini Credits: Michael Freedman and Kyle Jamieson developed much of the original material. Selected
More informationDYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS
DYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS Herwig Unger Markus Wulff Department of Computer Science University of Rostock D-1851 Rostock, Germany {hunger,mwulff}@informatik.uni-rostock.de KEYWORDS P2P,
More informationSimRank : A Measure of Structural-Context Similarity
SimRank : A Measure of Structural-Context Similarity Glen Jeh and Jennifer Widom 1.Co-Founder at FriendDash 2.Stanford, compter Science, department chair SIGKDD 2002, Citation : 506 (Google Scholar) 1
More informationVisualizing Recommendation Flow on Social Network
Journal of of Universal Computer Science, vol. 11, no. 11 11 (2005), 1780-1791 submitted: 1/9/05, 1/9/05, accepted: 1/10/05, appeared: 28/11/05 J.UCS J.UCS Visualizing Recommendation Flow on Social Network
More informationApplication of Dimensionality Reduction in Recommender System -- A Case Study
Application of Dimensionality Reduction in Recommender System -- A Case Study Badrul M. Sarwar, George Karypis, Joseph A. Konstan, John T. Riedl Department of Computer Science and Engineering / Army HPC
More informationStructured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup Alper Mizrak (Presenter) Yuchung Cheng Vineet Kumar Stefan Savage Department of Computer Science & Engineering University
More informationToday. Why might P2P be a win? What is a Peer-to-Peer (P2P) system? Peer-to-Peer Systems and Distributed Hash Tables
Peer-to-Peer Systems and Distributed Hash Tables COS 418: Distributed Systems Lecture 7 Today 1. Peer-to-Peer Systems Napster, Gnutella, BitTorrent, challenges 2. Distributed Hash Tables 3. The Chord Lookup
More informationPeer Clustering and Firework Query Model
Peer Clustering and Firework Query Model Cheuk Hang Ng, Ka Cheung Sia Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong SAR {chng,kcsia}@cse.cuhk.edu.hk
More informationExtension Study on Item-Based P-Tree Collaborative Filtering Algorithm for Netflix Prize
Extension Study on Item-Based P-Tree Collaborative Filtering Algorithm for Netflix Prize Tingda Lu, Yan Wang, William Perrizo, Amal Perera, Gregory Wettstein Computer Science Department North Dakota State
More informationLoad Balancing in Structured P2P Systems
1 Load Balancing in Structured P2P Systems Ananth Rao Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica fananthar, karthik, sonesh, karp, istoicag@cs.berkeley.edu Abstract Most P2P systems
More informationRobustness and Accuracy Tradeoffs for Recommender Systems Under Attack
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference Robustness and Accuracy Tradeoffs for Recommender Systems Under Attack Carlos E. Seminario and
More informationContent Overlays. Nick Feamster CS 7260 March 12, 2007
Content Overlays Nick Feamster CS 7260 March 12, 2007 Content Overlays Distributed content storage and retrieval Two primary approaches: Structured overlay Unstructured overlay Today s paper: Chord Not
More informationScalability In Peer-to-Peer Systems. Presented by Stavros Nikolaou
Scalability In Peer-to-Peer Systems Presented by Stavros Nikolaou Background on Peer-to-Peer Systems Definition: Distributed systems/applications featuring: No centralized control, no hierarchical organization
More informationDistriubted Hash Tables and Scalable Content Adressable Network (CAN)
Distriubted Hash Tables and Scalable Content Adressable Network (CAN) Ines Abdelghani 22.09.2008 Contents 1 Introduction 2 2 Distributed Hash Tables: DHT 2 2.1 Generalities about DHTs............................
More informationSurvey of DHT Evaluation Methods
Survey of DHT Evaluation Methods Markus Meriläinen Helsinki University of Technology Markus.Merilainen@tkk.fi Abstract In this paper, we present an overview of factors affecting the performance of the
More informationComparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks
Comparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks Hakem Beitollahi Hakem.Beitollahi@esat.kuleuven.be Geert Deconinck Geert.Deconinck@esat.kuleuven.be Katholieke Universiteit
More informationA Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery
A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery Shawn Chen 1, Steve Liang 2 1 Geomatics, University of Calgary, hschen@ucalgary.ca 2 Geomatics, University of Calgary, steve.liang@ucalgary.ca
More informationEvolution of Peer-to-peer algorithms: Past, present and future.
Evolution of Peer-to-peer algorithms: Past, present and future. Alexei Semenov Helsinki University of Technology alexei.semenov@hut.fi Abstract Today peer-to-peer applications are widely used for different
More informationProblems in Reputation based Methods in P2P Networks
WDS'08 Proceedings of Contributed Papers, Part I, 235 239, 2008. ISBN 978-80-7378-065-4 MATFYZPRESS Problems in Reputation based Methods in P2P Networks M. Novotný Charles University, Faculty of Mathematics
More informationPChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity
546 PAPER Special Section on Parallel/Distributed Computing and Networking PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity Feng HONG a),mingluli,minyouwu, and
More informationRecommender System using Collaborative Filtering Methods: A Performance Evaluation
Recommender System using Collaborative Filtering Methods: A Performance Evaluation Mr. G. Suresh Assistant professor, Department of Computer Application, D. Yogeswary M.Phil.Scholar, PG and Research Department
More informationQuery Processing Over Peer-To-Peer Data Sharing Systems
Query Processing Over Peer-To-Peer Data Sharing Systems O. D. Şahin A. Gupta D. Agrawal A. El Abbadi Department of Computer Science University of California at Santa Barbara odsahin, abhishek, agrawal,
More informationCollaborative Filtering Using Random Neighbours in Peer-to-Peer Networks
Collaborative Filtering Using Random Neighbours in Peer-to-Peer Networks Arno Bakker Department of Computer Science Vrije Universiteit De Boelelaan 8a Amsterdam, The Netherlands arno@cs.vu.nl Elth Ogston
More informationSemantic feedback for hybrid recommendations in Recommendz
Semantic feedback for hybrid recommendations in Recommendz Matthew Garden and Gregory Dudek McGill University Centre For Intelligent Machines 3480 University St, Montréal, Québec, Canada H3A 2A7 {mgarden,
More informationShaking Service Requests in Peer-to-Peer Video Systems
Service in Peer-to-Peer Video Systems Ying Cai Ashwin Natarajan Johnny Wong Department of Computer Science Iowa State University Ames, IA 500, U. S. A. E-mail: {yingcai, ashwin, wong@cs.iastate.edu Abstract
More informationImproving Results and Performance of Collaborative Filtering-based Recommender Systems using Cuckoo Optimization Algorithm
Improving Results and Performance of Collaborative Filtering-based Recommender Systems using Cuckoo Optimization Algorithm Majid Hatami Faculty of Electrical and Computer Engineering University of Tabriz,
More informationP2P Overlay Networks of Constant Degree
P2P Overlay Networks of Constant Degree Guihai Chen,2, Chengzhong Xu 2, Haiying Shen 2, and Daoxu Chen State Key Lab of Novel Software Technology, Nanjing University, China 2 Department of Electrical and
More informationA Constrained Spreading Activation Approach to Collaborative Filtering
A Constrained Spreading Activation Approach to Collaborative Filtering Josephine Griffith 1, Colm O Riordan 1, and Humphrey Sorensen 2 1 Dept. of Information Technology, National University of Ireland,
More informationThe Design and Implementation of an Intelligent Online Recommender System
The Design and Implementation of an Intelligent Online Recommender System Rosario Sotomayor, Joe Carthy and John Dunnion Intelligent Information Retrieval Group Department of Computer Science University
More informationPeer-to-peer computing research a fad?
Peer-to-peer computing research a fad? Frans Kaashoek kaashoek@lcs.mit.edu NSF Project IRIS http://www.project-iris.net Berkeley, ICSI, MIT, NYU, Rice What is a P2P system? Node Node Node Internet Node
More informationChapter 10: Peer-to-Peer Systems
Chapter 10: Peer-to-Peer Systems From Coulouris, Dollimore and Kindberg Distributed Systems: Concepts and Design Edition 4, Addison-Wesley 2005 Introduction To enable the sharing of data and resources
More informationMaking Gnutella-like P2P Systems Scalable
Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker Presented by: Herman Li Mar 2, 2005 Outline What are peer-to-peer (P2P) systems? Early P2P systems
More informationDATA. The main challenge in P2P computing is to design and implement LOOKING UP. in P2P Systems
LOOKING UP DATA in P2P Systems By Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica The main challenge in P2P computing is to design and implement a robust and scalable
More informationCIS 700/005 Networking Meets Databases
Announcements CIS / Networking Meets Databases Boon Thau Loo Spring Lecture Paper summaries due at noon today. Office hours: Wed - pm ( Levine) Project proposal: due Feb. Student presenter: rd Jan: A Scalable
More informationDistributed Information Processing
Distributed Information Processing 14 th Lecture Eom, Hyeonsang ( 엄현상 ) Department of Computer Science & Engineering Seoul National University Copyrights 2016 Eom, Hyeonsang All Rights Reserved Outline
More informationA Scalable Content- Addressable Network
A Scalable Content Addressable Network S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Proceedings of ACM SIGCOMM 01 Sections : 3.8, 4 Πλίτσης Ζήσης Ρόβα Ευθυµία 1 Caching and Replication 2 Caching
More informationScalable P2P architectures
Scalable P2P architectures Oscar Boykin Electrical Engineering, UCLA Joint work with: Jesse Bridgewater, Joseph Kong, Kamen Lozev, Behnam Rezaei, Vwani Roychowdhury, Nima Sarshar Outline Introduction to
More informationAggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test
Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test Fabius Klemm and Karl Aberer School of Computer and Communication Sciences Ecole Polytechnique Fédérale de Lausanne
More informationScalable and Self-configurable Eduroam by using Distributed Hash Table
Scalable and Self-configurable Eduroam by using Distributed Hash Table Hiep T. Nguyen Tri, Rajashree S. Sokasane, Kyungbaek Kim Dept. Electronics and Computer Engineering Chonnam National University Gwangju,
More informationContent-Based Recommendation for Web Personalization
Content-Based Recommendation for Web Personalization R.Kousalya 1, K.Saranya 2, Dr.V.Saravanan 3 1 PhD Scholar, Manonmaniam Sundaranar University,Tirunelveli HOD,Department of Computer Applications, Dr.NGP
More informationContent-based Dimensionality Reduction for Recommender Systems
Content-based Dimensionality Reduction for Recommender Systems Panagiotis Symeonidis Aristotle University, Department of Informatics, Thessaloniki 54124, Greece symeon@csd.auth.gr Abstract. Recommender
More informationMill: Scalable Area Management for P2P Network based on Geographical Location
Mill: Scalable Area Management for PP Network based on Geographical Location MATSUURA Satoshi sato-mat@is.naist.jp FUJIKAWA Kazutoshi fujikawa@itc.naist.jp SUNAHARA Hideki suna@wide.ad.jp Graduate School
More informationDistributed Hash Tables: Chord
Distributed Hash Tables: Chord Brad Karp (with many slides contributed by Robert Morris) UCL Computer Science CS M038 / GZ06 12 th February 2016 Today: DHTs, P2P Distributed Hash Tables: a building block
More informationReCord: A Distributed Hash Table with Recursive Structure
ReCord: A Distributed Hash Table with Recursive Structure Jianyang Zeng and Wen-Jing Hsu Abstract We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized-
More informationGoals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations.
Goals CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University of California, Berkeley
More informationProposing a New Metric for Collaborative Filtering
Journal of Software Engineering and Applications 2011 4 411-416 doi:10.4236/jsea.2011.47047 Published Online July 2011 (http://www.scip.org/journal/jsea) 411 Proposing a New Metric for Collaborative Filtering
More informationDistributed Hash Tables
Smruti R. Sarangi Department of Computer Science Indian Institute of Technology New Delhi, India Smruti R. Sarangi 1/34 Outline 1 2 Smruti R. Sarangi 2/34 Normal Hashtables Hashtable : Contains a set of
More information08 Distributed Hash Tables
08 Distributed Hash Tables 2/59 Chord Lookup Algorithm Properties Interface: lookup(key) IP address Efficient: O(log N) messages per lookup N is the total number of servers Scalable: O(log N) state per
More informationA Peer-to-Peer Architecture to Enable Versatile Lookup System Design
A Peer-to-Peer Architecture to Enable Versatile Lookup System Design Vivek Sawant Jasleen Kaur University of North Carolina at Chapel Hill, Chapel Hill, NC, USA vivek, jasleen @cs.unc.edu Abstract The
More informationUpdate Propagation Through Replica Chain in Decentralized and Unstructured P2P Systems
Update Propagation Through Replica Chain in Decentralized and Unstructured PP Systems Zhijun Wang, Sajal K. Das, Mohan Kumar and Huaping Shen Center for Research in Wireless Mobility and Networking (CReWMaN)
More informationEfficient Resource Management for the P2P Web Caching
Efficient Resource Management for the P2P Web Caching Kyungbaek Kim and Daeyeon Park Department of Electrical Engineering & Computer Science, Division of Electrical Engineering, Korea Advanced Institute
More informationRelaxing Routing Table to Alleviate Dynamism in P2P Systems
Relaxing Routing Table to Alleviate Dynamism in P2P Systems Hui FANG 1, Wen Jing HSU 2, and Larry RUDOLPH 3 1 Singapore-MIT Alliance, National University of Singapore 2 Nanyang Technological University,
More informationLessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems
LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems Kuang-Li Huang, Tai-Yi Huang and Jerry C. Y. Chou Department of Computer Science National Tsing Hua University Hsinchu,
More informationCPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University
CPSC 4/5 PP Lookup Service Ennan Zhai Computer Science Department Yale University Recall: Lec- Network basics: - OSI model and how Internet works - Socket APIs red PP network (Gnutella, KaZaA, etc.) UseNet
More informationCompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4 Xiaowei Yang xwy@cs.duke.edu Overview Problem Evolving solutions IP multicast Proxy caching Content distribution networks
More informationDynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others
Dynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others Sabina Serbu, Silvia Bianchi, Peter Kropf and Pascal Felber Computer Science Department, University of Neuchâtel
More informationSearching for Shared Resources: DHT in General
1 ELT-53206 Peer-to-Peer Networks Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
More informationSearching for Shared Resources: DHT in General
1 ELT-53207 P2P & IoT Systems Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
More informationPERFORMANCE ANALYSIS OF R/KADEMLIA, PASTRY AND BAMBOO USING RECURSIVE ROUTING IN MOBILE NETWORKS
International Journal of Computer Networks & Communications (IJCNC) Vol.9, No.5, September 27 PERFORMANCE ANALYSIS OF R/KADEMLIA, PASTRY AND BAMBOO USING RECURSIVE ROUTING IN MOBILE NETWORKS Farida Chowdhury
More informationKademlia: A P2P Informa2on System Based on the XOR Metric
Kademlia: A P2P Informa2on System Based on the XOR Metric Today! By Petar Mayamounkov and David Mazières, presented at IPTPS 22 Next! Paper presentation and discussion Image from http://www.vs.inf.ethz.ch/about/zeit.jpg
More informationINF5070 media storage and distribution systems. to-peer Systems 10/
INF5070 Media Storage and Distribution Systems: Peer-to to-peer Systems 10/11 2003 Client-Server! Traditional distributed computing! Successful architecture, and will continue to be so (adding proxy servers)!
More informationLecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011
Lecture 6: Overlay Networks CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 1 Overlay networks: Motivations Protocol changes in the network happen very slowly Why? Internet is shared
More informationOn User Recommendations Based on Multiple Cues
On User Recommendations Based on Multiple Cues G. Dudek and M. Garden Centre for Intelligent Machines, McGill University 3480 University St, Montréal, Québec, Canada H3A 2A7 dudek,mgarden @cim.mcgill.ca
More informationEECS 426. Multimedia Streaming with Caching on Pure P2P-based Distributed e-learning System using Mobile Agent Technologies
EECS 426 Multimedia Streaming with Caching on Pure P2P-based Distributed e-learning System using Mobile Agent Technologies Masayuki Higashino Tadafumi Hayakawa Kenichi Takahashi Takao Kawamura Kazunori
More informationOverlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma
Overlay and P2P Networks Structured Networks and DHTs Prof. Sasu Tarkoma 6.2.2014 Contents Today Semantic free indexing Consistent Hashing Distributed Hash Tables (DHTs) Thursday (Dr. Samu Varjonen) DHTs
More informationA P2P File Sharing Technique by Indexed-Priority Metric
A P2P File Sharing Technique by Indexed-Priority Metric Toshinori Takabatake and Yoshikazu Komano Abstract Recently, the improvements in processing performance of a computer and in high speed communication
More informationIntroduction to Peer-to-Peer Systems
Introduction Introduction to Peer-to-Peer Systems Peer-to-peer (PP) systems have become extremely popular and contribute to vast amounts of Internet traffic PP basic definition: A PP system is a distributed
More informationPerformance Modelling of Peer-to-Peer Routing
Performance Modelling of Peer-to-Peer Routing Idris A. Rai, Andrew Brampton, Andrew MacQuire and Laurent Mathy Computing Department, Lancaster University {rai,brampton,macquire,laurent}@comp.lancs.ac.uk
More informationSolving the Sparsity Problem in Recommender Systems Using Association Retrieval
1896 JOURNAL OF COMPUTERS, VOL. 6, NO. 9, SEPTEMBER 211 Solving the Sparsity Problem in Recommender Systems Using Association Retrieval YiBo Chen Computer school of Wuhan University, Wuhan, Hubei, China
More informationMulti-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment
Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Dewan Tanvir Ahmed, Shervin Shirmohammadi Distributed & Collaborative Virtual Environments Research Laboratory School of Information
More informationTelematics Chapter 9: Peer-to-Peer Networks
Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session
More informationDistributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016
Distributed Systems 17. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2016 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can
More information