1. Peer-to-Peer Networks University of Jordan

2. Server/Client Model What?

3. Server/Client Model What? Centralised Server => sole information provider Clients => dumb terminals Clients are so dumb actually I can describe them in 3 letters: RRR => Request, Receive, and Relay

4. Server/Client Model Why?

5. Server/Client Model Why? Greater ease of maintenance Data storage is centralised Updates to that data are far easier to administer Many mature client-server technologies are already available It functions with multiple different clients of different capabilities through a formalized, agreed-upon interface.

6. Server/Client Model Why not? Bottleneck/overload issues Single point of failure (since it’s centralised)

7. Peer-to-Peer Model What?

8. Peer-to-Peer Model What? Distributed (decentralised) No notion of a 'client' or a 'server‘; nodes are known as peers Peers provide resources as well as request them P2P networks are ‘ad-hoc’

9. Peer-to-Peer Model More about Peers For a node to become effectively a peer in a P2P network, it has to share and allow direct access to its resources. The resources a peer might share can range from processing power, disk storage, data, to network bandwidth and whatnot. The network is known to be 'ad-hoc', as in, the addition or removal of a node in the network does not necessarily affect other nodes.

10. Peer-to-Peer Model P2P systems and their architecture

11. Peer-to-Peer Model Architecture of P2P Systems 1.Structured 2.Unstructured 1.Pure P2P Systems 2.Hybrid P2P Systems 3.Centralised P2P Systems

12. Peer-to-Peer Model Structured Systems In structured peer-to-peer networks, connections in the overlay are fixed. They typically use distributed hash table-based (DHT) indexing. Structured P2P networks employ a globally consistent protocol to ensure that any node can efficiently route a search to some peer that has the desired file, even if the file is extremely rare. Such a guarantee necessitates a more structured pattern of overlay links. By far the most common type of structured P2P network is the DHT, in which a variant of consistent hashing is used to assign ownership of each file to a particular peer. Remember Hash tables? [ key => value ] and in this case [ peer => shared files ]

13. Peer-to-Peer Model Unstructured Systems An unstructured peer-to-peer network is formed when the overlay links are established arbitrarily. Such networks can be easily constructed as a new peer that wants to join the network can copy existing links of another node and then form its own links over time.

14. Peer-to-Peer Model Unstructured Systems They… Do not provide any algorithm for organization or optimization of network connections. Use flooding for finding all the peers that share the queried data. Their search queries may not always be resolved Have very poor search efficiency Many of the popular P2P networks are unstructured!

15. Peer-to-Peer Model Unstructured Systems Pure P2P Systems

16. Peer-to-Peer Model Pure P2P Systems In pure peer-to-peer systems the entire network consists solely of equipotent peers. There is only one routing layer, as there are no preferred nodes with any special infrastructure function.

17. Peer-to-Peer Model Unstructured Systems Hybrid P2P Systems

18. Peer-to-Peer Model Hybrid P2P Systems Hybrid peer-to-peer systems allow such infrastructure nodes to exist, often called supernodes. Such systems distribute their clients into two groups: client nodes and overlay nodes. Typically, each client is able to act according to the momentary need of the network and can become part of the respective overlay network used to coordinate the P2P structure. This division between ‘normal’ and ‘better’ nodes is done in order to address the scaling problems on early pure P2P networks. Example: Gnutella (after v0.4).

19. Peer-to-Peer Model Unstructured Systems Centralised P2P Systems (wtf?)

20. Peer-to-Peer Model Centralised P2P Systems In centralized peer-to-peer systems, a central server is used for indexing functions and to bootstrap the entire system. Example: eDonkey

21. Peer-to-Peer Model Indexing and resource discovery How do you find files, even know they’re there?

22. Peer-to-Peer Model Indexing and resource discovery Older peer-to-peer networks duplicate resources across each node in the network configured to carry that type of information. This allows local searching, but requires much traffic. Modern networks use central coordinating servers and directed search requests. Central servers are typically used for listing potential peers, coordinating their activities, and searching. Decentralised searching was first done by flooding search requests out across peers. More efficient directed search strategies, including supernodes and distributed hash tables (DHT), are now used.

23. Peer-to-Peer Model Why?

24. Peer-to-Peer Model Why? In P2P networks, all clients provide resources, which may include bandwidth, storage space, and computing power. Scaleability: As nodes arrive and demand on the system increases, the total capacity of the system also increases. In contrast, in a typical client-server architecture, clients share only their demands with the system, but not their resources. In this case, as more clients join the system, less resources are available to serve each client. Robustness: The distributed nature of P2P networks also increases robustness, and in pure p2p systems by enabling peers to find the data without relying on a centralized index server. In the latter case, there is no single point of failure in the system.

25. Peer-to-Peer Model Why not?

26. Peer-to-Peer Model Why not? As with most network systems, insecure and unsigned codes may allow remote access to files on a victim's computer or even compromise the entire network. In the past this has happened for example to the FastTrack network when anti P2P companies managed to introduce faked chunks into downloads and downloaded files (mostly MP3 files) were unusable afterwards or even contained malicious code. Consequently, the P2P networks of today have seen an enormous increase of their security and file verification mechanisms. Modern hashing, chunk verification and different encryption methods have made most networks resistant to almost any type of attack, even when major parts of the respective network have been replaced by faked or nonfunctional hosts. Internet service providers (ISPs) have been known to throttle P2P file-sharing traffic due to the high-bandwidth usage. Compared to Web browsing, e-mail or many other uses of the internet, where data is only transferred in short intervals and relative small quantities, P2P file-sharing often consists of relatively heavy bandwidth usage due to ongoing file transfers and swarm/network coordination packets. A possible solution to this is called P2P caching, where an ISP stores the part of files most accessed by P2P clients in order to save access to the Internet.

27. P2P software applications

28. P2P software applications include these six key characteristics: the user interface runs outsides of a Web browser computers in the system can act as both clients and servers the software is easy to use and well- integrated

29. P2P software applications include these six key characteristics: the user interface runs outsides of a Web browser computers in the system can act as both clients and servers the software is easy to use and well- integrated

30. the application includes tools to support users wanting to create content or add functionality the application makes connections with other users the application does something new or exciting

31. Top 7 Free P2P File Sharing Programs - Free P2P Software Shareaza BitTorrent Ares BearShare Kazaa eMule LimeWire

32. Popular P2P Systems Napster Gnutella Kazaa

33. Napster A way to share music files with others Users upload their list of files to Napster server You send queries to Napster server for files of interest. o Keyword search (artist, song, album, bitrate, etc.) Napster server replies with IP address of users with matching files You connect directly to user A to download file

35. Central Napster server Can ensure correct results Bottleneck for scalability Single point of failure Susceptible to denial of service o Malicious users o Lawsuits, legislation

36. Gnutella Share any type of files (not just music) Decentralized search unlike Napster You ask your neighbours for files of interest Neighbours ask their neighbours, and so on o TTL field quenches messages after a number of hops Users with matching files reply to you

38. Decentralized o No single point of failure o Not as susceptible to denial of service o Cannot ensure correct results Flooding queries Search is now distributed but still not scalable

39. Kazaa (Fasttrack network) Hybrid of centralized Napster and decentralized Gnutella o Super-peers act as local search hubs o Each super-peer is similar to a Napster server for a small portion of the network Super-peers are automatically chosen by the system based on their capacities (storage, bandwidth, etc.) and availability (connection time)

40. Users upload their list of files to a super-peer Super-peers periodically exchange file lists You send queries to a super-peer for files of interest

41. Legal and Copyright Issues of P2P File Sharing

42. Copyright Identity theft Sharing illegal files

43. Question Is P2P (filesharing) legal? Answer Yes--but not with copyrighted material...