Peer-to-Peer Systems

Peer-to-Peer systems have become, in a short period of time, one of the fastest growing and most popular applications. The decentralized and distributed nature of p2p systems leads to living aside the client-server model. In p2p model each node takes both the roles of client and server. As a client, it can query and download its wanted data files from other nodes and as a server, it can provide data files to other nodes. Two main objectives in p2p systems are data location and search for interesting data. In order to present these topics, we survey various structured and unstructured p2p systems. We also study content-based p2p systems that are systems with clusters of nodes, according to the content of their data files. We point replication strategies and techniques and we show how range queries are performed.

วารสารเทคโนโลยีสุรนารี Suranaree Journal of Social Science, 2010

Peer-to-peer(P2P)networkssuchasGnutellaandBittorrenthaverevolutionizedInternet-based applications.Apeer-to-peernetworkoffershigh-availability,high-reliability,andfaulttolerance.Theuse ofapeer-to-peernetworkcanbeappliedtomanykindsofapplications.Itisnotonlylimitedtofile sharingapplications.Manyprojectshaveadoptedpeer-to-peernetworksfortheirapplications,suchas SETI@home,aCPUsharingapplication,Oceanstore,astoragesharingapplication,andOverCite,a distributedversionoftheCiteseerdigitallibrary.Anunderstandingofpeer-to-peertechnologywillallow ustoadapttheexistingclient/servermodelapplicationsintoapeer-to-peermodelwhichmaygiveusan alternativesolutionthatisbetterthantheexistingone.

P2P (peer-to-peer) systems gain more interest from both the user and research communities, building a search system on top of P2P networks is becoming an attractive and promising alternative. The paper introduces the concept of P2P network architecture and structure of current P2P systems. The background, scope, objectives, and methodology adopted for carrying out the research work is also presented in this paper. This paper also evaluates the extensive research done in the field of p2p networks. A survey is very important part of every research. So here this paper shows the application based survey on peer to peer systems.

2002

Legal Notices The information in this document is subject to change without notice. ELTRUN makes no warranty of any kind with regard to this document, including, but not limited to, the implied warranties of merchantability and fitness for its particular purpose. ELTRUN shall not be held liable for errors contained herein or direct, indirect, special, incidental or consequential damages in connection with the furnishing, performance, or use of this material. In the recent years, the evolution of a new wave of innovative network architectures labeled " peer-to-peer (p2p) " has been witnessed. Such architectures and systems are characterized by direct access between peer computers, rather than through a centralized server. The recently formed Peer-to-Peer Working Group, a consortium including industry leaders aiming at the advancement of infrastructures and best-known practices for peer-to-peer computing, defines p2p as the " sharing of computer resources by direct exch...

2013

a peer-to-peer computer network refers to any network that does not have fixed clients and servers, but a number of peer nodes that function as both clients and servers to the other nodes on the network. This model of network arrangement is contrasted with the client-server model. Any node is able to initiate or complete any supported transaction. Peer nodes may differ in local configuration, processing speed, network bandwidth, and storage quantity. Through this survey we present brief description of each P2P network protocols along with their advantages and disadvantages. Also we look into some security issues related to structured P2P networks and suggest some

2002

Peer-to-peer (P2P) overlay networks have recently become one of the hottest topics in OS research. These networks bring with them the promise of harnessing idle storage and network resources from client machines that voluntarily join the system; self-configuration and automatic load balancing; censorship resistance; and extremely good scalability due to the use of symmetric algorithms. However, the use of unreliable client machines leads to two defects of these systems that precludes their use in a number of applications: storage is inherently unreliable, and lookup algorithms have long latencies. In this paper we propose a design of a robust peer-to-peer storage service, composed not of client nodes, but server nodes that are dedicated to running the peer-to-peer application. We argue that our system overcomes the defects of peer-to-peer systems while retaining their nice properties with the exception of utilizing spare resources of client machines. Our system is capable of surviving arbitrary failures of its nodes (Byzantine faults) and we expect it to perform and scale well, even in a wide-area network.

2004

The Herald project at Microsoft Research has built working implementations of several scalable peer-to-peer algorithms as part of our work on a scalable, fault-tolerant event notification system. Our goal has been to construct and validate implementations that will work on real networks at scale – not just to simulate such systems and reason about what might be buildable – but

2009 IEEE Symposium on Computers and Communications, 2009

The development of peer to peer overlay networks applications has attracted an immense interest from the research community in recent years. Several challenging issues have to be resolved in order to provide accessible, efficient and scalable inter-peer communication. Achieving resilience so as to reduce the disconnection probability, is among the most demanding issues to provide a robust and omnipresent service to peer to peer applications. This paper attempts to address this issue, by proposing a graph-theoretic model using the well-known star interconnection network with sub-logarithmic degree characteristics, which not only facilitate scalability problem, but also achieves maximum connectivity compared to the other existing graph-based methods. The simulation results confirm that the proposed solution attains a higher degree of resiliency compared to other existing topologies.

Oram, A. Peer-to-peer: …, 2001

The term peer-to-peer rudely shoved its way to front and center stage of the computing field around the middle of the year 2000. Just as the early 20th-century advocates of psychoanalysis saw sex everywhere, industry analysts and marketing managers are starting to call everything they like in computers and telecommunications "peer-to-peer." At the same time, technologists report that fear and mistrust still hang around this concept, sometimes making it hard for them to get a fair hearing from venture capitalists and policy makers. Yes, a new energy is erupting in the computing field, and a new cuisine is brewing. Leaving sexiness aside, this preface tries to show that the term peer-to-peer is a useful way to understand a number of current trends that are exemplified by projects and research in this book. Seemingly small technological innovations in peer-to-peer can radically alter the day-today use of computer systems, as well as the way ordinary people interact using computer systems. But to really understand what makes peer-to-peer tick, where it is viable, and what it can do for you, you have to proceed to the later chapters of the book. Each is written by technology leaders who are working 'round the clock to create the new technologies that form the subject of this book. By following their thoughts and research, you can learn the state of the field today and where it might go in the future. Some context and a definition I mentioned at the beginning of this preface that the idea of peer-to-peer was the new eyebrow-raiser for the summer of 2000. At that point in history, it looked like the Internet had fallen into predictable patterns. Retail outlets had turned the Web into the newest mail order channel, while entertainment firms used it to rally fans of pop culture. Portals and search engines presented a small slice of Internet offerings in the desperate struggle to win eyes for banner ads. The average user, stuck behind a firewall at work or burdened with usage restrictions on a home connection, settled down to sending email and passive viewing. In a word, boredom. Nothing much for creative souls to look forward to. An Olympic sports ceremony that would go on forever. At that moment the computer field was awakened by a number of shocks. The technologies were not precisely new, but people realized for the first time that they were having a wide social impact: Napster This famous and immensely popular music exchange system caused quite a ruckus, first over its demands on campus bandwidth, and later for its famous legal problems. The technology is similar to earlier systems that got less attention, and even today is rather limited (since it was designed for pop songs, though similar systems have been developed for other types of data). But Napster had a revolutionary impact because of a basic design choice: after the initial search for material, clients connect to each other and exchange data directly from one system's disk to the other. SETI@home This project attracted the fascination of millions of people long before the Napster phenomenon, and it brought to public attention the promising technique of distributing a computation across numerous personal computers. This technique, which exploited the enormous amounts of idle time going to waste on PCs, had been used before in projects to crack encryption challenges, but after SETI@home began, a number of companies started up with the goal of making the technique commercially viable. Freenet Several years before the peer-to-peer mania, University of Edinburgh researcher Ian Clarke started to create an elegantly simple and symmetric file exchange system that has proven to be among the purest of current models for peer-to-peer systems. Client and server are the same thing in this system; there is absolutely no centralization.