2. Geethanjali College Of Engineering and Technology Cheeryal( V), Keesara ( M), Ranga Reddy District. I I Internal Guide Mrs.CH.V.Anupama Assistant Professor Department of Computer Science and Engineering Project Team Members B. Neelima 09R11A0569 k.Mounika 09R11A0589 R.Padmavathy 09R11A05A1

3.  Peer-To-Peer (P2P) technology is heavily used for content distribution applications.  P2P technology tries to solve the issue of scalability by making the system distributed.  Each peer in the network can act both a server and a client at the same time.  The average download time for each user in the network is much shorter than that of a centralized network.

4.  Content distribution is a centralized one, where the content is distributed from the centralized server to all clients requesting the document.  Clients send request to the centralized server for downloading the file.  Server accepts the request and sends the file as response to the request.  In most client-server setups, the server is a dedicated computer whose entire purpose is to distribute files

5.  Peer-to-peer content distribution provides more resilience and higher availability through wide-scale replication of content at large numbers of peers.  A P2P content distribution community is a collection of intermittently- connected nodes with each node contributing storage, content and bandwidth to the rest of the community  The peer-to-peer file sharing networks had a centralized server system. This system controls traffic among the users.

6.  Software Requirements JDK 1.6 Java Swing  Hardware Requirements ROCESSOR : Minimum PENTIUM IV 2.6 GHz RAM : Minimum512 MB RAM HARD DISK : Minimum 80 GB

7.  Parallel Downloading  Random chunk Based Switching  Random Periodic Switching

8.  Parallel downloading is one of the most noticeable way to reduce the download time  If the file is divided into k chunks of equal size and k simultaneous connections are used.  The chunk that tokes the longest time to complete determines the entire download session.

9.  Parallel download can yield the optimal download time in the distributed network.  each individual peer is the network is allocated a time for the download based on the service capacity and at the same time.

10.  In Random chunk based switching scheme, the file of interest is divided into many small chunks just as in parallel download scheme.  A user downloads chunks sequentially one at a time. Whenever a user completes a chunk from its current source peer, the user randomly selects a new source peer and connect it to retrieve a new chunk.  If the downloader is currently stuck with a bad source peer, it will stay there for only the amount of time required for finishing one chunk

11.  The download time for one chunk is independent of that of the previous chunk.  Switching source peer based on chunk can reduce the correlation in service capacity between chunks and hence reduce the average download time.

12.  Random periodic switching effectively removes correlations in the capacity fluctuation and the heterogeneity in space, thus greatly reducing the average download time  Here in this we consider two schemes 1) permanent connection. 2) random periodic switching.

13.  Permanent connection: the source does not change in time. When the searching phase is over and a list of available source peers is given, the downloader will choose one of them randomly with equal probability  Random Periodic Switching : the downloader randomly chooses a source peer at each time slot, independently. Here in this case after downloading a part of the content the peer becomes a source and allows the other peer to download.

14. UML Diagrams

16.  Use case diagram

17.  Sequence diagram

18. Output Screens

26.  Download time in stochastic peer to peer network is highly desirable to improve the network efficiency by reducing each user’s download time.  The peer-to-peer file sharing networks had a centralized server system provides more resilience and higher availability through wide-scales replication of content at large numbers of peers

27.  Modeling and analysis of peer-to-peer networks by D. Qiu and R. Srikanth.  Optimal peer selection for p2p downloading and streaming. In proceedings of IEEE Infocom.  An analytical framework for modeling peer to peer networks by k. k. Ramachandran and B. Sikdar.  A measurement study of peer-to-peer file sharing system by S. Saroiu, K. P. Gummadi, and S. D. Gribble

28. Thank you