FUtella Analysis and Implementation of a Content- Based Peer-to-Peer Network
|
|
- Diane Jones
- 5 years ago
- Views:
Transcription
1 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 Network Abstract FUtella is a content-based peer-to-peer network. It extends the mere file-sharing capabilities of traditional peer-to-peer networks to serve as a dynamic network platform for general knowledge sharing especially suited for educational environments such as universities and research institutes. The idea of FUtella is to provide participants with a dynamic platform to exchange information. A typical scenario using FUtella could be the following: A student arrives on campus carrying her PDA or wireless laptop and needs material for deeper understanding of a teaching issue, for example pipelining in x86-cpus. The student, then, poses her question to the FUtella network. Instead of flooding the network in Gnutella-like style, FUtella's routing scheme propagates the question to other peers that are most likely to have an adequate answer, and eventually the student will receive one or more helpful answers. FUtella addresses problems common to all peer-to-peer networks, such as efficient query processing and routing, as well as the reduction of network traffic. FUtella is designed to be implementable and usable on all sorts of devices, ranging from small PDAs over wireless laptops to wired desktops. It, therefore, follows two major design goals: keeping the network traffic as low as possible, i.e. being as efficient as possible, while at the same time adding as little overhead as possible, i.e. staying light-weight enough to be implementable on devices with little storage capabilities and slow network connections. Introduction Peer-to-peer is a rapidly evolving field. Currently, a good number of peer-to-peer systems / architectures have been implemented or are being implemented: Napster [1], Gnutella [2,3], JXTA [4], or Freenet [6] to name just some of the most popular ones. However, those systems have been designed to address certain aspects of peer-to-peer computing while not focusing too closely on others: Napster: Often considered the first popular and widely used file-sharing peer-to-peer system, it is important to understand that it was not truly a pure peer-to-peer system. Instead, Napster was based on a hybrid client-server/peer-to-peer architecture. At its core, it had a central server that kept track of all the files that were being shared along with the addresses of peers that were providing the corresponding files. When a peer was looking for a certain file, it would query the central server that, then, provided the peer with the addresses of peers sharing that file. Only the actual file download was then done on a peer-to-peer basis. Gnutella: After the (legal) demise of Napster, Gnutella has become a very popular peer-to-peer system used for file sharing, as well. Unlike Napster, Gnutella is based on a pure peer-to-peer architecture without (theoretically) any static servers involved. Gnutella has a very simplistic protocol making it extremely easy to implement. Gnutella messages are byte-oriented (as opposed to XML based messages) and are therefore very compact.
2 However, its core protocol basically lacks any sophisticated routing logic (besides loop detection). When a peer is looking for a certain file, it sends a query to all the peers it is aware of. They will, then, forward the query to all the peers they are aware of, and so forth until, eventually, the file has been located (or TTL has expired). It is easy to see that this network flooding causes heavy net traffic and prevents Gnutella from being able to scale to a rising number of nodes [10]. JXTA: JXTA [4] is different from the other peer-to-peer systems in the sense that it is not a single purpose (file-sharing) system but rather a middleware. Developers can use it as a platform to build peer-to-peer applications on top it of without having to worry about low level peer-topeer computing. JXTA makes no assumptions about anything (such as TCP/IP, etc.) and therefore has a very generic design so that it can be used in all sorts of peer-to-peer scenarios. This comes at the expense of significant overhead in the form of a rather complex protocol stack and a three-tier service layer. Nonetheless, JXTA introduces a number of interesting concepts such as full / simple peers and peer groups. JXTA Search: JXTA Search [5] is a service in JXTA used for efficient query processing. In JXTA Search, all queries have to belong to a certain queryspace. Queries are only forwarded to those peers that have registered themselves with the JXTA Search network as being capable of responding to queries of a certain queryspace. Freenet: Freenet is a document-storage peer-to-peer system. Besides its strong encryption and security capabilities, Freenet has a very efficient document retrieval algorithm. It has been shown [8,9] that Freenet can locate a document with an average effort proportional to O(lg N) with N being the number of nodes on the net. However, Freenet does not support (meta) searching, updating or deleting. The search engine FASD [7] adds meta searching to Freenet but still does not address updating and deleting. FUtella combines approaches found in Gnutella, JXTA, JXTA Search and Freenet and extends them to provide a lightweight, adaptive and efficient peer-to-peer platform for general knowledge sharing. FUtella's architecture is based on the following concepts: - A node on the FUtella net can be either a full peer or a simple peer. Simple peers do not route other peers messages. - Peers sharing a common field of expertise (queryspace) will dynamically combine and form knowledge groups. - Knowledge groups register with the network to be considered for questions belonging to a certain queryspace. - Query routing will forward a query only to those knowledge groups registered for the queryspace the query belongs to, thus reducing the need of message broadcasts. - Discovery requests for finding knowledge groups (registrations) on the FUtella network are routed based on Freenet s efficient retrieval routing algorithm - Freenet's routing approach is extended to allow for the deletion of registrations. - For the actual transmission, FUtella chooses the compact Gnutella message format Querying the FUtella Network Searching for information is one of the most challenging tasks in peer-to-peer computing. Since there are no static servers in peer-to-peer networks, there are no well-known, predefined places to turn to when a peer is looking for some sort of information. The easiest solution is to resort to a brute-force broadcast of the query message. A peer looking for some piece of information would simply pass its query on to all the peers it knows of. They would then forward the message to all the peers they know of and so forth. This is exactly the way Gnutella works.
3 In order to prevent the network from being flooded, FUtella takes up an approach similar to JXTA Search [5]. When a peer is looking for some piece of information, it will not merely broadcast its query to every peer it knows of. Instead, a query has to belong to a specific queryspace. That queryspace can be viewed as an arbitrary description of the topic the query belongs to. A query is only forwarded to those knowledge groups whose fields of expertise match the query s queryspace as closely as possible, i.e. only those knowledge groups that have published a corresponding queryspace with the FUtella network. In FUtella, every peer maintains a cache of previously discovered knowledge groups that contains the queryspaces and heads of the knowledge groups. When a peer initiates a query, it assigns a queryspace to the query. Before it sends off the query, it searches its cache for those knowledge groups whose queryspaces match the queryspace of the query as closely as possible. After searching the cache, the peer will direct its query to the knowledge group that most closely matched the queryspace of the query. If no matching knowledge groups could be found in the cache or some of the cached knowledge groups no longer exist (i.e. there is no response when trying to connect to them), the peer will have to discover appropriate knowledge groups before sending off its query. Knowledge group discovery is explained later in this paper. Once the peer has determined an appropriate knowledge group, it establishes a connection with its head and sends its query/queries. The head will then propagate the query/queries within its group to find adequate query responses. The head sends the query responses from its group members back to the peer that has established the query connection. The query messages and response messages are modeled after the JXTA Search XML scheme. For a practical example, suppose a student were looking for the solution to question 1 of exercise 11 of her computer architecture class (this would, of course, be after the deadline for exercise 11 when the student wants to compare the proposed solution to the one she has handed in). The corresponding query message could look like this: <?xml version='1.0'?> <request id=1b520c85ac94ea52 xmlns= query-space='computer architecture:exercise 11'> <query> <solution> question 1 </solution> </query> </request> Knowledge Groups In FUtella, knowledge groups are virtual clusters of peers that share a common field of knowledge, i.e. peers that all can answer questions of the same queryspace. Every knowledge group has a head node that serves as central "contact point" for all peers that want to query the knowledge group. A knowledge group can be associated with more than one queryspace. There can be more than one knowledge groups in FUtella associated with the same queryspace. Creating a Knowledge Group Any full peer can decide to create a knowledge group. The peer creating the knowledge group will automatically be the head of the new group. In order to create a new knowledge group, the head has to register it with the FUtella network. The head publishes a registration message with the FUtella network. A practical example of a registration could look like this: <?xml version='1.0'?> <register xmlns= <query-server> <ip> </ip>
4 <port>4567</port> </query-server> <name>computer architecture knowledge group</name> <query-space>computer architecture</query-space> </register> Joining a Knowledge Group A peer that has discovered a knowledge group associated with a queryspace that the peer can also respond to, may choose to join that group. In order to join the knowledge group, the peer connects to the head of the group and sends a join request containing information about itself (e.g. IP address). After having sent such a join request, the peer waits for a join response from the knowledge group head indicating whether or not the knowledge group head accepted the peer. Knowledge Group Communication When a peer wants to send a query to a knowledge group, it connects to the knowledge group head and sends it its query. At that point, the head has to decide what to do with the query. If the head itself can provide an answer to the query, the head will simply generate the appropriate query response and send it back to the querying peer. If, however, the knowledge group head cannot answer the query itself, the head will have to propagate the query to its group members. A knowledge group head, therefore, maintains a member table containing all group members. When a head has selected a member to forward a query to, it sends the query to the group member. If the group member can answer the query, it will prepare a query response message and send it back to the head. If the group member has determined that it cannot answer the query, it is expected to send an empty response message to the head. The head will then choose the next member to forward the query to and so forth. The head forwards the responses to the querying peer. Knowledge Group Discovery Since all queries belong to some queryspace in FUtella, an efficient way of discovering knowledge groups associated with a specific queryspace is essential. FUtella's knowledge group discovery routing algorithm is modeled after Freenet's [6] document retrieval algorithm. Contrary to Gnutella, Freenet does not simply broadcast a retrieval query (to find a certain document). Instead, retrieval queries are routed to those nodes that are deemed most likely to contain the requested document. It has been shown that Freenet locates a requested document with an average effort proportional to O(lg N), N being the number of nodes on the net [8,9]. FUtella's knowledge group discovery routing algorithm works as follows. A peer willing to discover a new knowledge group first initiates a discovery message. The aim now is to find a peer on the FUtella network that has cached a registration of a knowledge group with matching queryspace. Therefore, the peer has to determine which peer would be the best to forward the discovery query to. For this purpose, every peer maintains a routing table. An entry in the table contains both the queryspace and the IP address of a peer (registration provider) that is known to contain a registration with matching queryspace in its registration cache. When peer A receives (or initiates) a discovery query, it searches its cache to see if it contains the registration of a knowledge group that matches the queryspace of the discovery query. If such a registration was found, a discovery response containing that registration is sent upstream to the peer B the discovery query was received from. Peer A will include its own address as the registration provider. The upstream peer B that received the discovery response will also forward that discovery response upstream to the peer C it had received the discovery query
5 from. This process continues until the discovery response arrives at the original peer that had initiated the discovery query. Every intermediate peer that receives the discovery response during that process will add the queryspace and the registration provider to its routing table. It will also add the registration to its cache thereby replicating the registration. Before forwarding a discovery response upstream, any intermediate peer can arbitrarily declare itself as the registration provider. On the other hand, if peer A receives (or initiates) a discovery query and its cache does not contain a matching registration, peer A has to decide where to forward the discovery query to. In order to do this, peer A searches its routing table for an entry with a queryspace that most closely matches the queryspace of the discovery query. Peer A will then forward the discovery query to that candidate. Upon reception of the discovery query, the candidate searches its cache for a matching registration and if none was found it, too, will choose the closest match from its routing table, and so forth. This process continues until a peer has a cached registration matching the discovery query or the TTL of the discovery request has expired. When peer A receives a discovery query, it checks whether it has received that discovery query before to prevent loop backs. If a loop-back is detected, the peer backtracks the query to the upstream peer B it had received the query from by sending back an empty discovery response. The upstream peer B, after receiving the empty discovery response, will then choose the second best match from its routing table and forward the discovery query to it. In general, when a peer receives an empty discovery response from the n th best match in its routing table, it will go on and choose the (n+1) -th best match to forward the discovery query to. Besides loop-back detection, a peer will also send back an empty discovery response if - the TTL of the discovery query has expired and its cache does NOT contain a matching registration. - it runs out of entries in its routing table to forward the discovery query to. C 10. Forward response(s) A 1. Discovery request "computer architecture" 6. Forward discovery response 7. Send query B 2. Forward discovery request 4. Forward discovery request to 2 nd best match 5. Discovery response containing cached registration 3. C has no cached registration for "computer architecture -> backtrack D 8. Forward query to member E 9. Query response M1 8.Forward query to member 9. Query response... Mi Knowledge group "computer architecture" Figure 1. Steps involved in discovering a knowledge group ("computer architecture") and querying it.
6 Similar to Freenet's retrieval algorithm, FUtella's discovery query routing algorithm has a number of positive side effects: 1. Popular registrations are propagated through the network as intermediate peers replicate and cache the registrations contained in the discovery responses they are routing. Thus, the effort of discovering those knowledge groups is subsequently reduced. 2. Since intermediate peers cache the registration they are routing, popular registrations move closer to the requester in terms of the network topology. 3. Since discovery responses contain a registration provider, routing a discovery response can broaden the horizon of an intermediate peer in case it did not know the address of the registration provider before. Inserting a New Registration into the FUtella Network Similar to Freenet, insertions in FUtella are handled analogously to discovery queries. When a knowledge group head wants to insert a new knowledge group registration into the network, the group head searches its routing table to find the best match for the queryspace of the new registration and sends the registration message to that peer. That peer will cache the registration and insert the queryspace with the group head as registration provider into its routing table. It will, then, find the best match (but obviously not the one that has just been inserted) in its routing table and forward the registration to it, and so forth. This process continues until the TTL of the registration message has expired. The insertion routing algorithm, too, has a number of positive side effects: 1. The caching of the registration that is performed by the intermediate peers replicates the registration on the FUtella network, thus eliminating a "single point of failure" (to provide the registration, that is) for that knowledge group. 2. It makes sure that peers expected to be able to provide a registration of a certain queryspace are, indeed, likely to receive it. 3. It helps the group head make its presence known to other (the intermediate) peers. Deleting a Registration from the FUtella Network Due to the dynamic nature of peer-to-peer networks, knowledge groups will form and disappear again at random. It is therefore necessary to extend FUtella's architecture to include the possibility of deleting knowledge group registrations. Note that deletion under Freenet is still considered an open problem and is currently simply not possible. Since knowledge group registrations can be replicated and cached by many peers over time, there is no way of exactly knowing all the peers that have cached a particular knowledge group registration. Thus, the only way for a peer to immediately make sure that a certain registration is completely expunged from the FUtella network would be to resort to flooding the network with a delete request. Obviously, this is not a feasible approach. FUtella, therefore, introduces a delayed deletion approach. The central idea is that when one peer discovers that a certain knowledge group no longer exists most likely because the head no longer responds it is not vitally important for all other peers to immediately delete the registration of that knowledge group from their caches, too. For instance, if peer A realizes that knowledge group Z no longer exists, peer B may very well "live" with an invalid registration of Z if it is not going to contact Z any time soon. Therefore, deletion under FUtella works as follows. When a peer discovers that a certain knowledge group no longer exists, it will initiate a delete request that is routed exactly the same way insertions are routed. All intermediate peers will also delete the matching registration from their caches. When an intermediate peer A has deleted a certain registration from its cache, it will use the registration's queryspace to find the best match in its routing table to forward the delete request to. Suppose peer B is that best match. Peer A will forward the delete request to peer B. Nonetheless, peer A will NOT erase the
7 entry containing peer B from its routing table. For one thing, peer B may have more than one cached registrations of a certain queryspace. Furthermore, peer B may still remain in peer A's routing table even if the deleted registration was the only one peer B had cached under the given queryspace. This is because the next time a new knowledge group of that queryspace is inserted, peer B should still be the prime candidate for peer A to forward the new registration to. It is left to the peers not on the routing path of the deletion request to discover on their own that the knowledge group no longer exists until the registration is eventually removed from the network. Conclusion It is important to understand that peer-to-peer networks on the application layer suffer from the same problems as classic networks on the network/routing layer: scalability, efficiency, overhead, stability etc. FUtella tackles those problems by combining specific approaches found in other peer-to-peer systems and extending them. FUtella treats knowledge group registrations much like documents so that Freenet's efficient retrieval routing scheme can be employed to discover them. Furthermore, FUtella extends Freenet's routing scheme to allow for the deletion of such registrations since knowledge groups can form and disappear at random. The effort of propagating actual queries is reduced to simple point-to-point communication as querying peers directly contact the corresponding knowledge groups. Therefore, FUtella provides a lightweight, adaptive and efficient peer-to-peer platform for general knowledge sharing. Future Work The system is currently being implemented and will be experimentally evaluated and compared to the approaches taken in Gnutella and Freenet, respectively. References: [1] Napster. [2] Gnutella. [3] Gnutella Protocol Specification v [4] JXTA. [5] JXTA Search. [6] Freenet. [7] KRONFOL, AMR Z. FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine. [8] IAN CLARKE, OSKAR SANDBERG, BRANDON WILEY, and THEODORE W. HONG, "Freenet: A Distributed Anonymous Information Storage and Retrieval System" in Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, LNCS 2009, ed. by Hannes Federrath. Springer: New York (2001). [9] IAN CLARKE, THEODORE W. HONG, SCOTT G. MILLER, OSKAR SANDBERG, and BRANDON WILEY, "Protecting Free Expression Online with Freenet," IEEE Internet Computing 6(1), (2002). [10] RITTER, JORDAN. Why Gnutella can't scale. No, really. Authors: Thomas Zahn Dr. Hartmut Ritter Prof. Dr. Jochen Schiller Prof. Dr. Heinz Schweppe Freie Universität Berlin
Early 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 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 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 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 informationAssignment 5. Georgia Koloniari
Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last
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 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 informationHierarchical Peer-to-Peer Networks
Hierarchical Peer-to-Peer Networks H. T. Kung Division of Engineering and Applied Sciences Harvard University Cambridge, MA 02138, USA Abstract -- In this paper, we describe a hierarchical architecture
More information6. Peer-to-peer (P2P) networks I.
6. Peer-to-peer (P2P) networks I. PA159: Net-Centric Computing I. Eva Hladká Faculty of Informatics Masaryk University Autumn 2010 Eva Hladká (FI MU) 6. P2P networks I. Autumn 2010 1 / 46 Lecture Overview
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 informationA Survey of Peer-to-Peer Content Distribution Technologies
A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004 Presenter: Seung-hwan Baek Ja-eun Choi Outline Overview
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 informationThwarting Traceback Attack on Freenet
Thwarting Traceback Attack on Freenet Guanyu Tian, Zhenhai Duan Florida State University {tian, duan}@cs.fsu.edu Todd Baumeister, Yingfei Dong University of Hawaii {baumeist, yingfei}@hawaii.edu Abstract
More informationDesigning Peer-to-Peer Systems for Business-to-Business Environments
Designing Peer-to-Peer Systems for Business-to-Business Environments Davide Carboni, Massimo Deriu, Cristian Lai and Antonio Pintus CRS4 (Center for Advanced Studies, Research and Development in Sardinia)
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 informationPeer- to- Peer and Social Networks. An overview of Gnutella
Peer- to- Peer and Social Networks An overview of Gnutella Overlay networks Overlay networks are logical networks defined on top of a physical network. The nodes (peers) are a subset of the real nodes
More informationNaming and Service Discovery in Peer-to-Peer Networks
Naming and Service Discovery in Peer-to-Peer Networks ECE1770 Expert Topic Eli Fidler Vinod Muthusamy February 13, 2003 Outline Traditional Distributed Naming Systems Distributed Naming Paradigms P2P Naming
More informationAdvanced Peer to Peer Discovery and Interaction Framework
Advanced Peer to Peer Discovery and Interaction Framework Peeyush Tugnawat J.D. Edwards and Company One, Technology Way, Denver, CO 80237 peeyush_tugnawat@jdedwards.com Mohamed E. Fayad Computer Engineering
More informationWSN Routing Protocols
WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before
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 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 informationSemantic Overlay Networks
Semantic Overlay Networks Arturo Crespo and Hector Garcia-Molina Write-up by Pavel Serdyukov Saarland University, Department of Computer Science Saarbrücken, December 2003 Content 1 Motivation... 3 2 Introduction
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 informationLECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
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 informationBackup and Recovery Scheme for Distributed e-learning System
Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the
More informationStudy and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
More informationMulti-Layer Clusters in Ad-hoc Networks - An Approach to Service Discovery
Multi-Layer Clusters in Ad-hoc Networks - An Approach to Service Discovery Michael Klein and Birgitta König-Ries Institute for Program Structures and Data Organization Universität Karlsruhe D-76128 Karlsruhe,
More informationA Search Theoretical Approach to P2P Networks: Analysis of Learning
A Search Theoretical Approach to P2P Networks: Analysis of Learning Nazif Cihan Taş Dept. of Computer Science University of Maryland College Park, MD 2742 Email: ctas@cs.umd.edu Bedri Kâmil Onur Taş Dept.
More informationLocation-aware In-Network Monitoring in Wireless Sensor Networks
Location-aware In-Network Monitoring in Wireless Sensor Networks Volker Turau and Christoph Weyer Department of Telematics, Technische Universität Hamburg-Harburg Schwarzenbergstraße 95, 21073 Hamburg,
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 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 informationAgent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Distributed and Agent Systems
Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma Distributed and Agent Systems Peer-to-Peer Systems & JXTA Prof. Agostino Poggi What is Peer-to-Peer
More informationSimulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report
Simulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report Computer Communications and Networking (SC 546) Professor D. Starobinksi Brian Mitchell U09-62-9095 James Nunan U38-03-0277
More informationIan Clarke Oskar Sandberg
Ian Clarke is the architect and coordinator of The Freenet Project, and the Chief Executive Officer of Cematics Ltd, a company he founded to realise commercial applications for the Freenet technology.
More informationPerformance Analysis of MANET Routing Protocols OLSR and AODV
VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz
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 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 informationA Jini Based Implementation for Best Leader Node Selection in MANETs
A Jini Based Implementation for Best Leader Node Selection in MANETs Monideepa Roy, Pushpendu Kar and Nandini Mukherjee Abstract MANETs provide a good alternative for handling the constraints of disconnectivity
More informationPeer-to-Peer XML. Presented By: Vasu Sathu 11/11/02
Peer-to-Peer XML Presented By: Vasu Sathu 11/11/02 1 Overview Introduction to P2P Applications of P2P Security Issues in P2P Future Aspects Conclusion 2 1 Introduction to P2P Definition: P2P is about unifying
More informationPUCPR. Internet Protocol. Edgard Jamhour E N G L I S H S E M E S T E R
PUCPR Internet Protocol Address Resolution and Routing Edgard Jamhour 2014 E N G L I S H S E M E S T E R 1. Address Resolution The IP address does not identify, indeed, a computer, but a network interface.
More informationRouting over Low Power and Lossy Networks
outing over Low Power and Lossy Networks Analysis and possible enhancements of the IETF PL routing protocol Enzo Mingozzi Associate Professor @ University of Pisa e.mingozzi@iet.unipi.it outing over LLNs
More informationIntroduction on Peer to Peer systems
Introduction on Peer to Peer systems Georges Da Costa dacosta@irit.fr dacosta@irit.fr 1/55 Goal of this Lecture What can P2P do, not only as a buzzword What it can't do Shows some examples & algorithms
More informationDebunking some myths about structured and unstructured overlays
Debunking some myths about structured and unstructured overlays Miguel Castro Manuel Costa Antony Rowstron Microsoft Research, 7 J J Thomson Avenue, Cambridge, UK Abstract We present a comparison of structured
More informationVariable Length and Dynamic Addressing for Mobile Ad Hoc Networks
Variable Length and Dynamic Addressing for Mobile Ad Hoc Networks Som Chandra Neema Venkata Nishanth Lolla {sneema,vlolla}@cs.ucr.edu Computer Science Department University of California, Riverside Abstract
More informationDistributed Systems. Characteristics of Distributed Systems. Lecture Notes 1 Basic Concepts. Operating Systems. Anand Tripathi
1 Lecture Notes 1 Basic Concepts Anand Tripathi CSci 8980 Operating Systems Anand Tripathi CSci 8980 1 Distributed Systems A set of computers (hosts or nodes) connected through a communication network.
More informationDistributed Systems. Characteristics of Distributed Systems. Characteristics of Distributed Systems. Goals in Distributed System Designs
1 Anand Tripathi CSci 8980 Operating Systems Lecture Notes 1 Basic Concepts Distributed Systems A set of computers (hosts or nodes) connected through a communication network. Nodes may have different speeds
More informationPeer-to-peer systems and overlay networks
Complex Adaptive Systems C.d.L. Informatica Università di Bologna Peer-to-peer systems and overlay networks Fabio Picconi Dipartimento di Scienze dell Informazione 1 Outline Introduction to P2P systems
More informationContent Search. Unstructured P2P
Content Search Unstructured P2P Prof. Jukka K. Nurminen Data Communications Software (DCS) Lab, Department of Computer Science and Engineering, Aalto University *Partly adapted from original slides provided
More informationA RESOURCE AWARE SOFTWARE ARCHITECTURE FEATURING DEVICE SYNCHRONIZATION AND FAULT TOLERANCE
A RESOURCE AWARE SOFTWARE ARCHITECTURE FEATURING DEVICE SYNCHRONIZATION AND FAULT TOLERANCE Chris Mattmann University of Southern California University Park Campus, Los Angeles, CA 90007 mattmann@usc.edu
More informationSystem models for distributed systems
System models for distributed systems INF5040/9040 autumn 2010 lecturer: Frank Eliassen INF5040 H2010, Frank Eliassen 1 System models Purpose illustrate/describe common properties and design choices for
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 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 informationPeer- Peer to -peer Systems
Peer-to-peer Systems Brian Nielsen bnielsen@cs.aau.dk Client-Server Centralized Bottleneck Functional specialization Single point of failure Central administration NFS Client NFS Client NFS Server NFS
More informationOverlay and P2P Networks. Unstructured networks: Freenet. Dr. Samu Varjonen
Overlay and P2P Networks Unstructured networks: Freenet Dr. Samu Varjonen 1.2.2015 Contents Last week Napster Skype Gnutella BitTorrent and analysis This week: Freenet Introduction to structured networks
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 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 informationCSE 124 Finding objects in distributed systems: Distributed hash tables and consistent hashing. March 8, 2016 Prof. George Porter
CSE 124 Finding objects in distributed systems: Distributed hash tables and consistent hashing March 8, 2016 rof. George orter Outline Today: eer-to-peer networking Distributed hash tables Consistent hashing
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 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 informationMotivation for peer-to-peer
Peer-to-peer systems INF 5040 autumn 2015 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Ø Inherent restrictions of the standard client/ server model
More informationGrowth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs.
Internetworking Multiple networks are a fact of life: Growth. Individual departments in a university buy LANs for their own machines and eventually want to interconnect with other campus LANs. Fault isolation,
More informationEntrance exam - Informatics
Entrance exam - Informatics Name and Surname fill in the field Application No. Test Sheet No. 15 Algorithms and data structures 1 Which of the listed data structures is most suitable (w.r.t. time and memory
More informationJXTA: A Self-Adaptive Framework for Building P2P Systems
JXTA: A Self-Adaptive Framework for Building P2P Systems Bemnet Tesfaye Merha and Benoit Landrieu {merha, landrieu}@stud.ntnu.no Technical Essay in TTM3 Design of Self-Adaptive Systems Norwegian University
More informationPeer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today
Network Science: Peer-to-Peer Systems Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Introduction Peer-to-peer (PP) systems have become
More informationB.H.GARDI COLLEGE OF ENGINEERING & TECHNOLOGY (MCA Dept.) Parallel Database Database Management System - 2
Introduction :- Today single CPU based architecture is not capable enough for the modern database that are required to handle more demanding and complex requirements of the users, for example, high performance,
More informationUnicasts, Multicasts and Broadcasts
Unicasts, Multicasts and Broadcasts Part 1: Frame-Based LAN Operation V1.0: Geoff Bennett Contents LANs as a Shared Medium A "Private" Conversation Multicast Addressing Performance Issues In this tutorial
More informationA Design of Cooperation Management System to Improve Reliability in Resource Sharing Computing Environment
A Design of Cooperation Management System to Improve Reliability in Resource Sharing Computing Environment Ji Su Park, Kwang Sik Chung 1, Jin Gon Shon Dept. of Computer Science, Korea National Open University
More informationA Service Replication Scheme for Service Oriented Computing in Pervasive Environment
A Service Replication Scheme for Service Oriented Computing in Pervasive Environment Sital Dash, Mridulina Nandi & Subhrabrata Choudhury National Institute of Technology, Durgapur E-mail : Sheetal.dash@gmail.com,
More informationArvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More informationAPPROVAL PAGE FOR GRADUATE THESIS OR PROJECT
APPROVAL PAGE FOR GRADUATE THESIS OR PROJECT SUBMITTED IN PARTIAL FULFILLMENT OF REQUIREMENTS FOR DEGEREE OF MASTER OF SCIENCE AT CALIFORNIA STATE UNIVERSITY, LOS ANGELES BY SNEHAL NIRAV PATEL Candidate
More informationA Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network
A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network Humayun Bakht Research Fellow, London School of Commerce, United Kingdom humayunbakht@yahoo.co.uk
More informationA Fault-Tolerant P2P-based Protocol for Logical Networks Interconnection
A Fault-Tolerant P2P-based Protocol for Logical Networks Interconnection Jaime Lloret 1, Juan R. Diaz 2, Fernando Boronat 3 and Jose M. Jiménez 4 Department of Communications, Polytechnic University of
More informationDistributed Systems Final Exam
15-440 Distributed Systems Final Exam Name: Andrew: ID December 12, 2011 Please write your name and Andrew ID above before starting this exam. This exam has 14 pages, including this title page. Please
More informationMarch 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE
for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized
More informationAd Hoc Routing Protocols and Issues
Ad Hoc Routing Protocols and Issues Stefano Basagni ECE Dept Northeastern University Boston, Jan 2003 Ad hoc (AD-HAHK or AD-HOKE)-Adjective a) Concerned with a particular end or purpose, and b) formed
More informationPAST: Persistent and Anonymous Storage in a Peer-to-Peer Networking Environment
PAST: Persistent and Anonymous Storage in a Peer-to-Peer Networking Environment Peter Druschel and Antony Rowstron Rice University, 6100 Main Street, MS 132, Houston, TX 77005-1892, USA Microsoft Research
More informationLecture 04 Introduction: IoT Networking - Part I
Introduction to Industry 4.0 and Industrial Internet of Things Prof. Sudip Misra Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture 04 Introduction: IoT Networking
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 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 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 informationA PROPOSAL OF USER AUTHENTICATION AND A CONTENT DISTRIBUTION MECHANISM USING P2P CONNECTION OVER A MOBILE AD HOC NETWORK
A PROPOSAL OF USER AUTHENTICATION AND A CONTENT DISTRIBUTION MECHANISM USING P2P CONNECTION OVER A MOBILE AD HOC NETWORK Masato Oguchi, Yoshiko Nakatsuka y, and Chiho Tomizawa z Department of Information
More informationRelative Performance Analysis of Reactive (on-demand-driven) Routing Protocols
Relative Performance Analysis of Reactive (on-demand-driven) Routing Protocols Mukesh Kumar Garg, Dr. Ela Kumar Abstract A Mobile Ad Hoc Network (MANET) is a group of wireless mobile computers (or nodes);
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 informationPeer-to-Peer Networks
Peer-to-Peer Networks 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Administrivia Quiz #1 is next week
More informationRedundancy-Aware Peer-to-Peer Protocol (RAPP)
Preliminary Project Proposal Redundancy-Aware Peer-to-Peer Protocol (RAPP) Bernhard Ömer 20th October 2000 Abstract This proposal is about developing a distributed peer-to-peer filesharing system which
More informationUsing Linearization for Global Consistency in SSR
Using Linearization for Global Consistency in SSR Kendy Kutzner 1 and Thomas Fuhrmann 2 1 University of Karlsruhe 2 Technical University of Munich Computer Science Department Computer Science Department
More informationArchitecture for multi-party synchronization of data sets in a distributed environment
Architecture for multi-party synchronization of data sets in a distributed environment Marcin Marczewski A dissertation submitted to the University of Dublin, in partial fulfillment of the requirements
More informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More informationSmall-World Overlay P2P Networks: Construction and Handling Dynamic Flash Crowd
Small-World Overlay P2P Networks: Construction and Handling Dynamic Flash Crowd Ken Y.K. Hui John C. S. Lui David K.Y. Yau Dept. of Computer Science & Engineering Computer Science Department The Chinese
More informationA SOLUTION FOR REPLICA CONSISTENCY MAINTENANCE IN UNSTRUCTURED PEER-TO-PEER NETWORKS
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 A SOLUTION FOR REPLICA CONSISTENCY MAINTENANCE IN UNSTRUCTURED PEER-TO-PEER NETWORKS Narjes Nikzad Khasmakhi 1, Shahram
More informationTable of Contents 1 MSDP Configuration 1-1
Table of Contents 1 MSDP Configuration 1-1 MSDP Overview 1-1 Introduction to MSDP 1-1 How MSDP Works 1-2 Protocols and Standards 1-7 MSDP Configuration Task List 1-7 Configuring Basic Functions of MSDP
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationAn Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks
An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract
More informationA Server-mediated Peer-to-peer System
A Server-mediated Peer-to-peer System Kwok, S. H. California State University, Long Beach Chan, K. Y. and Cheung, Y. M. Hong Kong University of Science and Technology A peer-to-peer (P2P) system is a popular
More informationInformation Retrieval in Peer to Peer Systems. Sharif University of Technology. Fall Dr Hassan Abolhassani. Author: Seyyed Mohsen Jamali
Information Retrieval in Peer to Peer Systems Sharif University of Technology Fall 2005 Dr Hassan Abolhassani Author: Seyyed Mohsen Jamali [Slide 2] Introduction Peer-to-Peer systems are application layer
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 informationMANET Architecture and address auto-configuration issue
MANET Architecture and address auto-configuration issue Namhi Kang Catholic University E-mail: kang@catholic.ac.kr Contents Background Information Overview Common MANET misperception Multilink subnet issue
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationUsing peer to peer. Marco Danelutto Dept. Computer Science University of Pisa
Using peer to peer Marco Danelutto Dept. Computer Science University of Pisa Master Degree (Laurea Magistrale) in Computer Science and Networking Academic Year 2009-2010 Rationale Two common paradigms
More information