Avg file download time ppt


Published on

ppt for minimizing average file download time in stochastic peer-to-peer networks

Published in: Education, Technology
1 Like
  • Be the first to comment

No Downloads
Total views
On SlideShare
From Embeds
Number of Embeds
Embeds 0
No embeds

No notes for slide
  • iagram
  • Avg file download time ppt

    1. 2. MINIMIZING FILE DOWNLOAD TIME IN PEER-TO-PEER NETWORKS Presentation By: Sekhar Poluka(08J41A0534) Mani Arugonda(08J41A0527) Nitesh Kundanagiri(08J41A0536) Under the Guidance Of Navakanth.I Asst.professor(CSE)
    2. 3. Scope <ul><li>Reduce the Traffic speed . </li></ul><ul><li>Increase the Transfer speed . </li></ul>
    3. 4. <ul><li>To reduce the average file download time in Peer-To-Peer networks by using simple and distributed algorithms. </li></ul>Objective
    4. 5. Introduction <ul><li>The peer-to-peer file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet’s bandwidth usage. </li></ul><ul><li>Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion Or the service capacity fluctuation . </li></ul><ul><li>We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations. </li></ul>
    5. 6. Existing System? <ul><li>It simply sets up a server and every user downloads files from it. </li></ul><ul><li>Many users have to compete for limited resources . </li></ul>
    6. 7. <ul><li>Different capabilities are expressed in terms of bottleneck bandwidth or processing power of a single server. </li></ul>
    7. 8. Disadvantages of Existing System? <ul><li>In terms of single user’s perspective the duration of the download session is more. </li></ul><ul><li>Spatial heterogeneity limits the processing power provided by a peer and hence limits the service capacity . </li></ul><ul><li>Temporal correlation is the temporary congestion at any link in the network can also reduce the service capacity of all users utilizing that link. </li></ul>
    8. 9. Peer To Peer Network <ul><li>Peer-to-peer computing is a distributed application architecture between peers. </li></ul><ul><li>All the Peers are equally Treated. </li></ul><ul><li>It doesn’t need central coordination by servers or stable hosts. </li></ul><ul><li>Peers are both suppliers and consumers of resources. </li></ul>
    9. 10. Benefits of Peer to Peer Network <ul><li>These are very Cheap to implement. </li></ul><ul><li>Only cost is the Networking Hardware . </li></ul><ul><li>These are very Easy to implement. </li></ul><ul><li>All most all the operating system’s will support this feature, like Microsoft Windows, Apple Mac OS and Unix Operating System’s. </li></ul>
    10. 11. Proposed System? <ul><li>In this download time can be reduced by using Simple distributed Algorithm . </li></ul><ul><li>In this every individual system is treated as a client and server . </li></ul>
    11. 12. <ul><li>In this we analyze the performance of </li></ul><ul><li>Parallel Downloading </li></ul><ul><li>Random Chunk Based Switching </li></ul><ul><li>Random Time Based Switching </li></ul>
    12. 13. Parallel Downloading <ul><li>Parallel downloading improves the performance by reducing the file size over the worst source peer. </li></ul><ul><li>If the file F is divided into K chunks of equal size and simultaneous connections are used then the capacity for this download session becomes c1+c2+………+ck . </li></ul><ul><li>If the chunk size is proportional to the service capacity of each source peer, parallel downloading can yield the optimal download time . </li></ul>
    13. 14. Random Chunk Based Switching <ul><li>In Random Chunk Based Switching, the file is divided into many small chunks as in Parallel downloading. </li></ul><ul><li>In this the user downloads chunks sequentially one at a time. </li></ul><ul><li>In this if the user completes one chunk he selects another source peer and retrieve a new chunk. </li></ul><ul><li>If the downloader is stuck with a bad source peer it waits until the download time. </li></ul><ul><li>In this way we can reduce the correlation and reduce the average download time . </li></ul>
    14. 15. Random Time Based Switching <ul><li>In this we analyze very simple distributed algorithm and we will show that it effectively removes correlations in the capacity fluctuation and the heterogeneity in space . </li></ul><ul><li>By this we can greatly reduce the average download time. </li></ul><ul><li>It is implemented at each downloading peer in a distributed fashion , without loss of generality. </li></ul>
    15. 16. Advantages of Proposed System <ul><li>Parallel downloading improves the performance by reducing the file size over the “worst” source peer. </li></ul><ul><li>It effectively removes correlations in the capacity fluctuation and the heterogeneity in space , thus reducing the average download time. </li></ul>
    16. 17. Requirements <ul><li>Hardware Requirements: </li></ul><ul><li>PROCESSOR : Pentium IV 2.4 GHz </li></ul><ul><li>HARD DISK : 40 GB </li></ul><ul><li>MONITOR : 15” VGA colour </li></ul><ul><li>RAM : 512 MB </li></ul><ul><li>  </li></ul>
    17. 18. Software Requirements: <ul><li>Operating system : Windows 2000 or higher </li></ul><ul><li>Software Platform : .NET Framework </li></ul><ul><li>Coding Language : C# </li></ul><ul><li>Database : SQL SERVER 2005 </li></ul>
    18. 19. Module Description <ul><li>Modules are classified into three, as follows: </li></ul><ul><li>File Fragmentation. </li></ul><ul><li>Fetching a File. </li></ul><ul><li>File Download. </li></ul>
    19. 20. Module 1: File Fragmentation <ul><li>File is divided into k chunks of equal size and k simultaneous connections are used.   </li></ul><ul><li>Client downloads a file from k peers at a time. Each peer sends a chunk to the client. </li></ul>
    20. 21. Module2: Fetching a File <ul><li>File is divided into many chunks and user downloads chunks sequentially one at time. </li></ul><ul><li>The client randomly chooses the source peer at each time slot and download the chunks from each peer in the given time slots. </li></ul>
    21. 22. Module 3: File Download <ul><li>File is divided into many chunks and user downloads chunks sequentially one at time. </li></ul><ul><li>Whenever a user completes a chunk from its current source peer, the user randomly selects a new source peer and connects to it to retrieve a new chunk.   </li></ul><ul><li>Switching source peers based on chunk can reduce average download time. </li></ul>
    22. 23. System Implementation Home Page
    23. 24. Login Page
    24. 25. Splitting a File
    25. 26. Ready to Download Fragmented File’s
    26. 27. New User Registration Form
    27. 28. UML Diagrams Class Diagram
    28. 29. Sequence Diagram
    29. 30. Collaboration Diagram
    30. 31. Use Case Diagram
    31. 32. Activity Diagram
    32. 33. Test Cases File Fragmentation and fetch File Download Test Inputs Expected output Recd. Output Description Chunkfile Filename Chunk file and distribute Chunk file and distribute Test Passed. File got split and distributed.           Test Inputs Expected output Recd. Output Description Download file Filename Fetch chunked files and merge in to a new file Fetch chunked files and merge in to a new file Test Passed. File downloaded successfully.          
    33. 34. Conclusion <ul><li>In this project, we have focused on the average download time of each user in a P2P network. </li></ul><ul><li>Devastating usage of network resources by P2P applications in the current Internet, it is highly desirable to improve the network efficiency by reducing each user’s download time. </li></ul><ul><li>All P2P algorithms regarding the download time should focus directly on “Time” rather than on “Bytes” .  </li></ul>
    34. 35. Future Enhancement
    35. 36. Thank You
    36. 37. QUERIES ?