Searching in variably connected P2P networks
|
|
- Evangeline Henderson
- 6 years ago
- Views:
Transcription
1 Searching in variably connected P2P networks Njål T. Borch Norut Informasjonsteknologi AS Tromsø, Norway Lars Kristian Vognild Norut Informasjonsteknologi AS Tromsø, Norway Abstract Peer-to-Peer networks are gaining popularity through file-sharing communities. Most P2P networks demand a certain stability from it s nodes in order to function satisfactory. A variably connected P2P network, however, is a network where the connectivity of nodes might vary greatly over time. The nodes can be in different connection states, such as connected to the Internet or moving between networks as well as ad-hoc or offline operation. Creating a search infrastructure for variably connected P2P networks is challenging, as it will be very hard to keep updated shared state (such as distributed indexes) within the network. Both scalability and stability must be addressed; scalability for large scale overlay networks and stability in order to handle the large fluctuations in the network. Routing queries in Peer-to-Peer networks based on semantic information looks very promising for solving scalability issues. This paper discusses how a Semantic Query Routing protocol can be extended to solve stability issues and thus better support both mobility and ad-hoc operations. We will make an implementation in the Seers experimental P2P search infrastructure to verify the new protocol. 1 Keywords Variable connectivity, ad-hoc, mobility, search. INTRODUCTION The usage of computers is rapidly changing, moving away from stationary computers to smaller, mobile devices. These small devices are typically equipped with networking capabilities, enabling them to communicate with neighboring devices or to the Internet. The usage patterns of the small devices differs from the static PC, in that they often both produce data (such as photographs or sound recordings) and consume data (such as playing music or displaying a bus timetable). These devices are also to a larger degree a personal device, making it possible to exploit feedback from a user to provide a better service[1]. The Server/Client paradigm is not well suited when clients create content, nor when nodes are disconnected or in adhoc networks. While resource providing clients could be sup- 1 This work was funded by the Norwegian Research Council under contract no /223 ported, it does add much overhead in server management. The overhead can be moderation systems, server costs, bandwidth costs et cetera. The Peer-to-Peer paradigm allows members of the P2P network to both supply and consume resources. P2P makes it possible to create communities of individual nodes with little or no extra cost for the individual user. The P2P paradigm can also be applied on a large variety of network infrastructures, such as ad-hoc networks or as an overlay network on top of the Internet. When devices are highly mobile, they are likely to have very variable connectivity. For example, a device can have a wired cradle at home, a stable WLAN service at work, and only ad-hoc WLAN capabilities when on a bus. An important observation is that while on the bus, the device will be regarded as offline for anyone not a part of that specific ad-hoc network. Designing a search protocol on such unstable network infrastructures is a great challenge as most of the popular P2P search protocols demand a certain degree of stability in order to work properly. In this paper an extendible search protocol for unstable network infrastructures will be presented. SEARCHING IN P2P NETWORKS There are currently many different approaches for searching in Peer-to-Peer networks. Early pure P2P networks, such as Gnutella[2], would typically flood the network with queries. While flooding provides very robust search networks, it does not scale well. Searching can take a very long time, as potentially very large amounts of nodes will be queried before a hit can be found. Gnutella has improved this by introducing ultra-peers[3],[4]. These can act on behalf of a set of nodes, in effect indexing sub-trees of the network. The available bandwidth of nodes also has a certain influence on query routing. In order to speed up searching, hybrid search infrastructures were created. They include a set of indexing nodes who handle the searching. File transfers are then done using P2P techniques. Examples of such hybrid networks are Napster[5] and Kazaa[6]. While these hybrids work rather well, they introduce servers. Servers add a dependency to the Internet, they add running costs, and possibly also introduce legal risks.
2 Distributed Hash Tables (DHT) is another approach, in which the nodes are typically organized in a logical circle. A hash function is then used to map a key (such as a filename) to a subset of nodes in charge of that key. While this makes lookups of keys very quick, it is not necessarily well adapted to do searching. For example word will hash to a different key than words, making fuzzy searching a complex operation. As well there is some overhead in arranging the key-space between the member nodes. Examples of DHT based networks are Chord[7] and Overnet[8],[9]. Most of the P2P networks mentioned above add dependencies to either servers (typically on the Internet) or a structured group of nodes. These networks are typically unable to function in ad-hoc networks, as moving to a (new) ad-hoc network will effectively reset the entire group of peers. All neighbors must then be discovered from scratch. Flooding systems can however be adapted to work in ad-hoc networks, as long as the ad-hoc networks are rather small. Pure ad-hoc search infrastructures, such as Proem[10], are generally not well adapted for large scale overlay network operation. The Internet is a fairly stable infrastructure, and this stability should be exploited. Protocols designed to search for local services, such as Rendezvous[11] or UPnP[12], are typically based on a local broadcast. This makes them able to find local resources, but their reach is very limited. Semantic Query Routing is an emerging technique to increase the efficiency of P2P searches[13],[14]. Specifically the decision of which nodes to include in a query is based on the semantics of the query. Examples of implementations that uses this technique are Neurogrid[15], Alpine [16] and Limewire[17]. Neurogrid is dependent on a fairly static network configuration due to it s learning process. Alpine uses a protocol called DTCP that allows suspend/resume operations on a connection. It is thus possible for an Alpine node to move to another location and resume it s operation. However, this requires a certain stability. A moved node must be able to inform it s neighbors before the neighbors move themselves. If the nodes are personal, portable devices, it might very well happen that many of them move at the same time (say, office closing time). This can be solved in Alpine by introducing home-agents, or some other location where a node can be contacted (such as in Mobile IP[18]), but this adds a large degree of complexity to the system. THE SEERS SEARCH PROTOCOL In Seers[19] a search infrastructure that will seamlessly work in both ad-hoc and overlay (Internet) modes is created. Seers is built around a concept we call Meta-Documents. Metadocuments are self-contained resource descriptions, such as a URL with additional descriptive meta-data. A query is represented by a meta-document that describes a wanted resource. A reply is represented by a meta-document describing an existing resource. The meta-document can also be either active or passive. Active meta-documents will be sent to neighbor nodes, while passive meta-documents are stored locally until a query requests it. This provides both pull and push style searching and filtering. Meta-documents are represented in XML. Applications can extend the meta-documents to describe the resources they provide or request. For example, a video player requires different descriptive meta-data for a resource than a word processor. Both the tags used to represent the meta-data and the metadocument policies can be changed. Specifically, there are policies for matching, transmission and life cycle management of meta-documents. The matching policy defines how tags in the meta-document should be matched against others. The transmission policy describes how a meta-document should be transmitted. It can be limited by scope (host-only, local, global) or to groups of known nodes, or it can be public. It also contains parameters for the Semantic Query Routing (described later). The life cycle policy governs the storing and forwarding of meta-documents, such as validity limitations and cacheability. Thus a meta-document can for example be specified to expire at a certain time, or it can request not to be cached in the network (say for quickly changing resources). Seers is designed to provide service to applications. The metadocuments allow suppliers to specialize the meta-data used to describe their resources and the caching rules in the network. All applications can further specialize how meta-documents are ranked and searched through. Figure 1 is an example of a meta-document with only a few tags shown. In the next section the Seers search protocol is described. How it can provide a search infrastructure for variably connected Peer-to-Peer networks is then discussed. Then the first Seers prototype will be described and the preliminary results presented. A conclusion and future work will summarize the future work on Seers. Fig. 1. An extended Seers meta-document
3 The Seers search protocol matches a query and a reply meta-document by giving each reply a score using the given matching policy. The documents will then be ranked according to their score. In order to limit a sudden burst of replies to the query originator, all replies will be routed back, typically following the path of the query. according to the local node s observed interests. 2 The highest scoring neighbors are kept. Only addresses that have been active during a given period of time will be kept. Seers learn about other node s interests by passive observation of the meta-documents it routes. Local IP multicast is also used to update information of local neighbors. Neighbor information will then be updated with additional addresses as well as activity and connectivity points. Seers allows multiple addresses for a node, much in the same way that humans keep multiple phone numbers to each other. For example, we might call a friend at work, or if that fails, try the home phone, and after that the cell phone. If all fails, the friend will be regarded as (temporarily) unavailable. By keeping multiple addresses for nodes, Seers can snap into different configurations. As long as a neighbor is at some known place (say at home or at work), the node will be able to contact it. Fig. 2. Address selection for neighbor nodes In figure 2 the basic algorithm for address selection is shown. Each address of a neighbor can be in one of three different states, active, inactive or stale. While traffic is seen from a neighbor, it will stay in the active state. When a neighbor is in the inactive state, it can still be used, but active probing of the neighbor might be triggered. If the neighbor fails to show liveness, it will be set to the stale state. A stale address can still be used, but ranks lowest. An address will also receive points when it is seen in use. Communication directly from the node gives more points than routed messages. This allows the shortest known path to be used. If all addresses of a neighbor are in the stale state, the addresses will be cycled by using the least recently used address. If addresses are not stale, but otherwise equal, the last seen address will be used. Limiting the amount of neighbors is done by ranking them Fig. 3. The basic Semantic Query Routing function The Semantic Query Routing in Seers works by calculating a score for each known neighbor as shown in figure 3. Points are not only given based on the knowledge of the neighbor s interests. Very active, stable and well connected nodes can receive many points for their connectivity. This seamlessly opens for a kind of super-node, attracting queries from nodes when no neighbor is known to have relevant interests for a query. Lastly, the local user might have an opinion about certain nodes. This can be either due to some other node s excellence, or a ban of disliked nodes. The list of neighbors is then sorted, and the highest scoring nodes are selected. The selection is based on negative send points, which is a construction where it is more expensive to send to less certain nodes. This maps to the human feeling of embarrassment when calling a friend who is not likely able to answer your question. The send points, default points and minimum points are specified in the transmission policy of the query. In figure 4 an example of a search is shown. It is a setup with 3 nodes (L1-L3) in a local network. These are also connected to the Internet, represented by nodes I1-I6. There are also two pure ad-hoc nodes (A1 and A2). Node L1 can only reach A2 through A1. In this example, node L1 searches for metadocuments available at A2, I5 and I6. Some state is shown for three nodes (A1, L1 and I4). The Address is the best current address. All nodes that see (route) the meta-documents will update their semantic knowledge of the senders. Also node statistics, such as addresses, activity levels et cetera will be updated. The search starts by Node L1 creating a meta-document describing the wanted resource. The meta-document (the query) 2 Seers nodes will also monitor their own queries and replies, in order to determine it s own interests.
4 Fig. 4. An example of Seers with state before and after a search operation. Thicker lines show the search tree. The stapled lines show the new neighbor connections after the search. State changes are emphasized. is then sent on local multicast to the LAN. 3 L1 then sends the request to nodes A1 and I4. A1 forwards the request to A2, who sends a reply via A1 to L1. I4 will forward the query to I5, who will reply and forward it to I6. I6 will send a reply back to L1. The nodes I1-I3 are not included in the search as they are not seen as likely to contain the wanted resource. As seen in figure 4, L1 has included I5 and I6 as neighbors. Other nodes in the search (I4) path have also learned from the search. Also notice that L1 has seen A2, but at A1 s address. This is because L1 cannot reach A2 directly. CURRENT STATE The first prototype of Seers, code named Mêlée, implements the majority of the semantic query routing aspects of the protocol described above. The extendible message format is not yet implemented. Mêlée has limitations as to maximum points for each class (keyword points, activity points etc), in order to balance them. It has been run in a setup on two locations with 3 stationary nodes each, plus two mobile nodes, as shown in figure 5. All nodes are running Slackware[20] Linux (versions 8.1, 9.0 and 9.1). One mobile nodes varies between a local wireless connection at one location and pure ad-hoc mode (disconnected from the Internet). The other mobile node is connected to any of the locations through either Ethernet or WLAN, as well as operating in ad-hoc mode. When connected to Ethernet, it will keep the WLAN in ad-hoc mode, enabling it to bridge the ad-hoc network to the Internet. The stationary nodes are all connected to the Internet, one location with routeable IP addresses, the other location is behind NAT. All stationary nodes are permanently online. The data in the setup was mixed, with both music, video, web-links and documents 3 In this example nodes L1-L3 do not have any matching meta-documents. As the cost of a local multicast message is low while possibly providing the best replies (closest resources), it will normally be the first step in a Seers search. (html/pdf/postscript). Mêlée also includes a small http server in order to serve local files. Multiple test applications was made to test the service. A generic search application was made to search for any file, while a plugin for the XMMS multimedia player[21] was modified to support searching for music directly from XMMS. A smart bookmark was added to the Galeon web browser[22] in order to integrate searching for documents and web links. The early observations of the prototype indicates that it operates as expected. It is able to function in ad-hoc settings with no intervention, and it is able to contact known hosts if they are available, be it locally or through the Internet. The local neighbor updates are done via IPv6 link-local multicast, and allows all nodes on a link to know about each other with little overhead. A new prototype, code named LeChuck, with full support for application-extendible XML messages, policies and semantic query routing is currently being implemented. CONCLUSIONS AND FUTURE WORK The early observations of the first prototype indicate that it is possible to create a Peer-to-Peer network based on Semantic Query Routing that allows mobility and ad-hoc operation. For the upcoming prototype LeChuck a set of test applications will be implemented. We expect these applications to be of immense value for an environment in which both stationary, portable and PDA style devices are present. Specifically, the resource limited PDA style devices seem to be well helped by the ability to navigate and use both local and remote services. REFERENCES [1] Schilit, Adams, Want: Context-Aware Computing Applications. IEEE Workshop on Mobile Computing Systems and Applications, [2] Kan: Gnutella Peer-to-peer: Harnessing the benefits of distruptive technologies, ed. Oram, O Reilly & Associates: , 2001
5 Fig. 5. Test setup for the Mêlée prototype [3] Singla and Rohrs: Ultrapeers: Another step towards gnutella scalability. Whitepaper, [4] Gnutella protocol v0.4 protocol 0.4.pdf [5] Napster, [6] Kazaa, [7] Stoica, Morris, Karger, Kaashoek and Balakrishnan: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, ISBN [8] Overnet, [9] Maymounkov and Mazieres: Kademlia: A peer-to-peer information system based on the XOR metric. Proceedings of IPTPS02, Cambridge, USA, March [10] Kortuem, G: Proem: A Peer-to-Peer Computing Platform for Mobile Ad-hoc Networks. Advanced Topic Workshop Middleware for Mobile Computing November 16, 2001, Heidelberg, Germany [11] Rendezvous Technology Brief TB.pdf [12] UPnP forum: UPnP Device Architecture v1.0.1 Draft, [13] Joseph, S.: P2P MetaData Search Layers.. Second International Workshop on Agents and Peer-to-Peer Computing AP2PC [14] Krishna Ramanathan, Kalogeraki, Pruyne: Finding good peers in peerto-peer networks. Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM, Vol., Iss., 2002 Pages:24-31 [15] Joseph, S.: NeuroGrid: Semantically Routing Queries in Peer-to- Peer Networks. Proceedings of the International Workshop on Peer-to-Peer Computing, May 2002, Pisa, Italy [16] The Alpine Network: [17] Christopher Rohsr: Query Routing for the Gnutella Network. 2002, routing/keyword routing.htm [18] IETF: IP Mobility Support. RFC 2002, [19] The Socialized.Net, [20] Slackware Linux, [21] XMMS, [22] Galeon web browser,
Peer-to-Peer (P2P) Systems
Peer-to-Peer (P2P) Systems What Does Peer-to-Peer Mean? A generic name for systems in which peers communicate directly and not through a server Characteristics: decentralized self-organizing distributed
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 informationOverlay networks. To do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. Turtles all the way down. q q q
Overlay networks To do q q q Overlay networks P2P evolution DHTs in general, Chord and Kademlia Turtles all the way down Overlay networks virtual networks Different applications with a wide range of needs
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 informationAddressed Issue. P2P What are we looking at? What is Peer-to-Peer? What can databases do for P2P? What can databases do for P2P?
Peer-to-Peer Data Management - Part 1- Alex Coman acoman@cs.ualberta.ca Addressed Issue [1] Placement and retrieval of data [2] Server architectures for hybrid P2P [3] Improve search in pure P2P systems
More informationA 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 informationLecture 21 P2P. Napster. Centralized Index. Napster. Gnutella. Peer-to-Peer Model March 16, Overview:
PP Lecture 1 Peer-to-Peer Model March 16, 005 Overview: centralized database: Napster query flooding: Gnutella intelligent query flooding: KaZaA swarming: BitTorrent unstructured overlay routing: Freenet
More informationScalable overlay Networks
overlay Networks Dr. Samu Varjonen 1 Lectures MO 15.01. C122 Introduction. Exercises. Motivation. TH 18.01. DK117 Unstructured networks I MO 22.01. C122 Unstructured networks II TH 25.01. DK117 Bittorrent
More informationA New Adaptive, Semantically Clustered Peer-to-Peer Network Architecture
A New Adaptive, Semantically Clustered Peer-to-Peer Network Architecture 1 S. Das 2 A. Thakur 3 T. Bose and 4 N.Chaki 1 Department of Computer Sc. & Engg, University of Calcutta, India, soumava@acm.org
More informationPeer-to-Peer Systems. Chapter General Characteristics
Chapter 2 Peer-to-Peer Systems Abstract In this chapter, a basic overview is given of P2P systems, architectures, and search strategies in P2P systems. More specific concepts that are outlined include
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 informationOverlay networks. Today. l Overlays networks l P2P evolution l Pastry as a routing overlay example
Overlay networks Today l Overlays networks l P2P evolution l Pastry as a routing overlay eample Network virtualization and overlays " Different applications with a range of demands/needs network virtualization
More informationCollaborative Multi-Source Scheme for Multimedia Content Distribution
Collaborative Multi-Source Scheme for Multimedia Content Distribution Universidad Autónoma Metropolitana-Cuajimalpa, Departament of Information Technology, Mexico City, Mexico flopez@correo.cua.uam.mx
More informationPeer-to-Peer Internet Applications: A Review
Peer-to-Peer Internet Applications: A Review Davide Quaglia 01/14/10 Introduction Key points Lookup task Outline Centralized (Napster) Query flooding (Gnutella) Distributed Hash Table (Chord) Simulation
More informationPeer-to-Peer (P2P) Architectures
Peer-to-Peer (P2P) Architectures ECE/CS 658 Internet Engineering Dilum Bandara dilumb@engr.colostate.edu Outline Background Unstructured P2P Napster, Gnutella, & BitTorrent Structured P2P Chord & Kademlia
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 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 informationRouting Table Construction Method Solely Based on Query Flows for Structured Overlays
Routing Table Construction Method Solely Based on Query Flows for Structured Overlays Yasuhiro Ando, Hiroya Nagao, Takehiro Miyao and Kazuyuki Shudo Tokyo Institute of Technology Abstract In structured
More informationAdaptive Neighbor Selection for Service Discovery in Mobile Ad Hoc Networks*
Adaptive Neighbor Selection for Service Discovery in Mobile Ad Hoc Networks* Eunyoung Kang 1, Yongsoon Im 2, and Ungmo Kim 1 1 School of Computer Engineering, Sungkyunkwan University, 440-776, Suwon, Gyeonggi-do,
More informationImproving Information Retrieval Effectiveness in Peer-to-Peer Networks through Query Piggybacking
Improving Information Retrieval Effectiveness in Peer-to-Peer Networks through Query Piggybacking Emanuele Di Buccio, Ivano Masiero, and Massimo Melucci Department of Information Engineering, University
More informationDepartment of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing
Department of Computer Science Institute for System Architecture, Chair for Computer Networks File Sharing What is file sharing? File sharing is the practice of making files available for other users to
More informationPage 1. How Did it Start?" Model" Main Challenge" CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks"
How Did it Start?" CS162 Operating Systems and Systems Programming Lecture 24 Peer-to-Peer Networks" A killer application: Napster (1999) Free music over the Internet Key idea: share the storage and bandwidth
More informationTelecommunication Services Engineering Lab. Roch H. Glitho
1 Support Infrastructure Support infrastructure for application layer Why? Re-usability across application layer protocols Modularity (i.e. separation between application layer protocol specification /
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 informationBack-Up Chord: Chord Ring Recovery Protocol for P2P File Sharing over MANETs
Back-Up Chord: Chord Ring Recovery Protocol for P2P File Sharing over MANETs Hong-Jong Jeong, Dongkyun Kim, Jeomki Song, Byung-yeub Kim, and Jeong-Su Park Department of Computer Engineering, Kyungpook
More informationReliable Mobile Ad Hoc P2P Data Sharing
Reliable Mobile Ad Hoc P2P Data Sharing Mee Young Sung 1, Jong Hyuk Lee 1, Jong-Seung Park 1, Seung Sik Choi 1, and Sungtek Kahng 2 1 Department of Computer Science & Engineering, University of Incheon
More informationExploiting Semantic Clustering in the edonkey P2P Network
Exploiting Semantic Clustering in the edonkey P2P Network S. Handurukande, A.-M. Kermarrec, F. Le Fessant & L. Massoulié Distributed Programming Laboratory, EPFL, Switzerland INRIA, Rennes, France INRIA-Futurs
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 informationBitTorrent. Masood Khosroshahy. July Tech. Report. Copyright 2009 Masood Khosroshahy, All rights reserved.
BitTorrent Masood Khosroshahy July 2009 Tech. Report Copyright 2009 Masood Khosroshahy, All rights reserved. www.masoodkh.com Contents Contents 1 Basic Concepts 1 2 Mechanics 3 2.1 Protocols: Tracker and
More informationChapter 6 PEER-TO-PEER COMPUTING
Chapter 6 PEER-TO-PEER COMPUTING Distributed Computing Group Computer Networks Winter 23 / 24 Overview What is Peer-to-Peer? Dictionary Distributed Hashing Search Join & Leave Other systems Case study:
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 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 informationEARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems.
: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. 1 K.V.K.Chaitanya, 2 Smt. S.Vasundra, M,Tech., (Ph.D), 1 M.Tech (Computer Science), 2 Associate Professor, Department
More informationPeer-to-Peer Signalling. Agenda
Peer-to-Peer Signalling Marcin Matuszewski marcin@netlab.hut.fi S-38.115 Signalling Protocols Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction Peer-to-Peer (P2P) is a communications
More informationSimple Determination of Stabilization Bounds for Overlay Networks. are now smaller, faster, and near-omnipresent. Computer ownership has gone from one
Simple Determination of Stabilization Bounds for Overlay Networks A. Introduction The landscape of computing has changed dramatically in the past half-century. Computers are now smaller, faster, and near-omnipresent.
More informationPeer-to-Peer Architectures and Signaling. Agenda
Peer-to-Peer Architectures and Signaling Juuso Lehtinen Juuso@netlab.hut.fi Slides based on presentation by Marcin Matuszewski in 2005 Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction
More informationR/Kademlia: Recursive and Topology-aware Overlay Routing
R/Kademlia: Recursive and Topology-aware Overlay Routing Bernhard Heep ATNAC 2010, Auckland, New Zealand, 11/02/2010, KIT University of the State of Baden-Wuerttemberg and National Research Center of the
More informationA WebRTC DHT. Andres Ledesma (UCY) in cooperation with Mikael (Peerialism).
A WebRTC DHT Andres Ledesma (UCY) in cooperation with Mikael (Peerialism). Preface I Existing DHT overlays have been optimized using one criteria (network proximity, social links, content caching or others).
More informationDISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES
DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Outline System Architectural Design Issues Centralized Architectures Application
More informationA Hybrid Structured-Unstructured P2P Search Infrastructure
A Hybrid Structured-Unstructured P2P Search Infrastructure Abstract Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based
More informationCS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications
Introduction to Computer Networks Lecture30 Today s lecture Peer to peer applications Napster Gnutella KaZaA Chord What is P2P? Significant autonomy from central servers Exploits resources at the edges
More informationPresenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks
Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks Mehdi Jalili, Islamic Azad University, Shabestar Branch, Shabestar, Iran mehdijalili2000@gmail.com Mohammad Ali
More informationINF5071 Performance in distributed systems: Distribution Part III
INF5071 Performance in distributed systems: Distribution Part III 5 November 2010 Client-Server Traditional distributed computing Successful architecture, and will continue to be so (adding proxy servers)
More informationP2P Computing. Nobuo Kawaguchi. Graduate School of Engineering Nagoya University. In this lecture series. Wireless Location Technologies
P2P Computing Nobuo Kawaguchi Graduate School of Engineering Nagoya University 1 In this lecture series Wireless Location Technologies Location Information Processing P2P Computing(Today) Plug and Play
More informationPeer-to-Peer Applications Reading: 9.4
Peer-to-Peer Applications Reading: 9.4 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained from other sources,
More informationUltrapeer-Leaf Degree 10. Number of Ultrapeers. % nodes. Ultrapeer-Ultrapeer Degree Leaf-Ultrapeer Degree TTL
Measurement and Analysis of Ultrapeer-based P2P Search Networks Λ Boon Thau Loo Λ Joseph Hellerstein Λy Ryan Huebsch Λ Scott Shenker Λz Ion Stoica Λ Λ UC Berkeley y Intel Berkeley Research z International
More informationCharacterizing Gnutella Network Properties for Peer-to-Peer Network Simulation
Characterizing Gnutella Network Properties for Peer-to-Peer Network Simulation Selim Ciraci, Ibrahim Korpeoglu, and Özgür Ulusoy Department of Computer Engineering, Bilkent University, TR-06800 Ankara,
More informationKademlia: A peer-to peer information system based on XOR. based on XOR Metric,by P. Maymounkov and D. Mazieres
: A peer-to peer information system based on XOR Metric,by P. Maymounkov and D. Mazieres March 10, 2009 : A peer-to peer information system based on XOR Features From past p2p experiences, it has been
More informationStratos Idreos. A thesis submitted in fulfillment of the requirements for the degree of. Electronic and Computer Engineering
P2P-DIET: A QUERY AND NOTIFICATION SERVICE BASED ON MOBILE AGENTS FOR RAPID IMPLEMENTATION OF P2P APPLICATIONS by Stratos Idreos A thesis submitted in fulfillment of the requirements for the degree of
More informationRouting Protocols in Mobile Ad-Hoc Network
International Journal of Computer Science & Management Studies, Vol. 12, Issue 02, April 2012 Protocols in Mobile Ad-Hoc Network Sachin Minocha M. Tech Student, Vaish College of Engineering, Rohtak, Haryana
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 informationLecture 2: January 24
CMPSCI 677 Operating Systems Spring 2017 Lecture 2: January 24 Lecturer: Prashant Shenoy Scribe: Phuthipong Bovornkeeratiroj 2.1 Lecture 2 Distributed systems fall into one of the architectures teaching
More information12/5/16. Peer to Peer Systems. Peer-to-peer - definitions. Client-Server vs. Peer-to-peer. P2P use case file sharing. Topics
// Topics Peer to Peer Systems Introduction Client-server vs peer to peer Peer-to-peer networks Routing Overlays Structured vs unstructured Example PP Systems Skype login server Peer-to-peer - definitions
More informationFUtella Analysis and Implementation of a Content- Based Peer-to-Peer Network
8th Netties Conference Technische Universität Ilmenau September 30th to October 2nd 2002 T. Zahn / H. Ritter / J. Schiller / H. Schweppe FUtella Analysis and Implementation of a Content- Based Peer-to-Peer
More informationOverlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 20.1.2014 Contents P2P index revisited Unstructured networks Gnutella Bloom filters BitTorrent Freenet Summary of unstructured networks
More informationFlooded Queries (Gnutella) Centralized Lookup (Napster) Routed Queries (Freenet, Chord, etc.) Overview N 2 N 1 N 3 N 4 N 8 N 9 N N 7 N 6 N 9
Peer-to-Peer Networks -: Computer Networking L-: PP Typically each member stores/provides access to content Has quickly grown in popularity Bulk of traffic from/to CMU is Kazaa! Basically a replication
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 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 informationImproved Dominating Set Indices for Mobile Peer-to-Peer Networks
Improved Dominating Set Indices for Mobile Peer-to-Peer Networks Shanping Li, Wei Shi, Xin Lin, and Channa Nizamuddin College of Computer Science Zhejiang University Hangzhou, P.R.China 310027 shan@cs.zju.edu.cn,
More informationP2P. 1 Introduction. 2 Napster. Alex S. 2.1 Client/Server. 2.2 Problems
P2P Alex S. 1 Introduction The systems we will examine are known as Peer-To-Peer, or P2P systems, meaning that in the network, the primary mode of communication is between equally capable peers. Basically
More informationPeer-to-Peer Protocols and Systems. TA: David Murray Spring /19/2006
Peer-to-Peer Protocols and Systems TA: David Murray 15-441 Spring 2006 4/19/2006 P2P - Outline What is P2P? P2P System Types 1) File-sharing 2) File distribution 3) Streaming Uses & Challenges 2 Problem:
More informationSERVICE DISCOVERY IN MOBILE PEER-TO-PEER ENVIRONMENT
SERVICE DISCOVERY IN MOBILE PEER-TO-PEER ENVIRONMENT Arto Hämäläinen Lappeenranta University of Technology P.O. Box 20, 53851 Lappeenranta, Finland arto.hamalainen@lut.fi Jari Porras Lappeenranta University
More informationA Resource Exchange Architecture for Peer-to-Peer File Sharing Applications
The Computer Journal Vol. 48 No. 1 The British Computer Society 2005; all rights reserved DOI:10.1093/comjnl/bxh055 A Resource Exchange Architecture for -to- File Sharing Applications Chung-Ming Huang
More information4. Data Transmitting Agent based strategy for
120 Chapter 4 4. Data Transmitting Agent based strategy for Effective Cache Consistency 4.1 Architecture of Multicast-Data Dissemination Model Using Data Transmitting Agent The architecture of a mobile
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 informationOverlay and P2P Networks. Unstructured networks. PhD. Samu Varjonen
Overlay and P2P Networks Unstructured networks PhD. Samu Varjonen 25.1.2016 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find
More informationTinyTorrent: Implementing a Kademlia Based DHT for File Sharing
1 TinyTorrent: Implementing a Kademlia Based DHT for File Sharing A CS244B Project Report By Sierra Kaplan-Nelson, Jestin Ma, Jake Rachleff {sierrakn, jestinm, jakerach}@cs.stanford.edu Abstract We implemented
More informationEECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations
EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
More information: Scalable Lookup
6.824 2006: Scalable Lookup Prior focus has been on traditional distributed systems e.g. NFS, DSM/Hypervisor, Harp Machine room: well maintained, centrally located. Relatively stable population: can be
More informationPeer-to-peer systems
Prof. Dr. Claudia Müller-Birn Institute for Computer Science, Networked Information Systems Peer-to-peer systems Netzprogrammierung (lgorithmen und Programmierung V) Where are we on our topic map? Descriptive
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationOverlay networks. T o do. Overlay networks. P2P evolution DHTs in general, Chord and Kademlia. q q q. Turtles all the way down
Overlay networks T o do q q q Overlay networks P2P evolution DHTs in general, Chord and Kademlia Turtles all the way down Overlay networks virtual networks Different applications with a wide range of needs
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 informationOverlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 19.1.2015 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find
More informationArchitecture Proposal for an Internet Services Charging Platform
Internal Working Paper Architecture Proposal for an Internet Services Charging Platform John Cushnie Distributed Multimedia Research Group, Lancaster University, UK. E-mail: j.cushnie@lancaster.ac.uk Abstract.
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 informationInternet Protocol Stack! Principles of Network Applications! Some Network Apps" (and Their Protocols)! Application-Layer Protocols! Our goals:!
Internet Protocol Stack! Principles of Network Applications! application: supporting network applications!! HTTP,, FTP, etc.! transport: endhost-endhost data transfer!! TCP, UDP! network: routing of datagrams
More informationPeer-peer and Application-level Networking. CS 218 Fall 2003
Peer-peer and Application-level Networking CS 218 Fall 2003 Multicast Overlays P2P applications Napster, Gnutella, Robust Overlay Networks Distributed Hash Tables (DHT) Chord CAN Much of this material
More informationEE 122: Peer-to-Peer Networks
EE 122: Peer-to-Peer Networks Ion Stoica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer
More informationChapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
More informationIntroduction to P2P Computing
Introduction to P2P Computing Nicola Dragoni Embedded Systems Engineering DTU Compute 1. Introduction A. Peer-to-Peer vs. Client/Server B. Overlay Networks 2. Common Topologies 3. Data Location 4. Gnutella
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 informationA DHT-based Distributed Location Service for Internet Applications
A DHT-based Distributed Location Service for Internet Applications Simone Cirani and Luca Veltri Department of Information Engineering University of Parma Viale G. P. Usberti 181/A, 43100 Parma - Italy
More informationA COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
More informationSplitQuest: Controlled and Exhaustive Search in Peer-to-Peer Networks
SplitQuest: Controlled and Exhaustive Search in Peer-to-Peer Networks Pericles Lopes Ronaldo A. Ferreira pericles@facom.ufms.br raf@facom.ufms.br College of Computing, Federal University of Mato Grosso
More informationOMNIX: A topology-independent P2P middleware
OMNIX: A topology-independent P2P middleware Roman Kurmanowytsch, Engin Kirda, Clemens Kerer and Schahram Dustdar Technical University of Vienna, Distributed Systems Group Argentinierstr. 8/184-1, A-1040
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 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 informationFaster Content Access in KAD
Faster Content Access in KAD Moritz Steiner, Damiano Carra, and Ernst W. Biersack Eurécom, Sophia Antipolis, France {steiner carra erbi}@eurecom.fr Abstract Many different Distributed Hash Tables (DHTs)
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 informationExploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks
Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks Y. Charlie Hu, Saumitra M. Das, and Himabindu Pucha Purdue University West Lafayette, IN 47907 {ychu, smdas, hpucha}@purdue.edu Abstract
More informationScaling Problem Computer Networking. Lecture 23: Peer-Peer Systems. Fall P2P System. Why p2p?
Scaling Problem 15-441 Computer Networking Millions of clients server and network meltdown Lecture 23: Peer-Peer Systems Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 2 P2P System Why p2p?
More informationActive source routing for ad-hoc network: seamless integration of wireless environment
Active source routing for ad-hoc network: seamless integration of wireless environment 1. Introduction Active networking is the emerging technology that will provide new network environment where lots
More informationBOOTSTRAPPING LOCALITY-AWARE P2P NETWORKS
BOOTSTRAPPING LOCALITY-AWARE PP NETWORKS Curt Cramer, Kendy Kutzner, and Thomas Fuhrmann Institut für Telematik, Universität Karlsruhe (TH), Germany {curt.cramer kendy.kutzner thomas.fuhrmann}@ira.uka.de
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 informationOssification of the Internet
Ossification of the Internet The Internet evolved as an experimental packet-switched network Today, many aspects appear to be set in stone - Witness difficulty in getting IP multicast deployed - Major
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 informationSIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks
SIPCache: A Distributed SIP Location Service for Mobile Ad-Hoc Networks Simone Leggio Hugo Miranda Kimmo Raatikainen Luís Rodrigues University of Helsinki University of Lisbon August 16, 2006 Abstract
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 informationUPnP: Breaking out of the LAN
UPnP: Breaking out of the LAN Jim Grimmett and Eamonn O Neill Department of Computer Science, University of Bath Bath, United Kingdom Email: {jwg, eamonn}@cs.bath.ac.uk Abstract The use of devices embedded
More information