Minimizing File Download Time in Stochastic peer-to-peer networks
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
electronics seminars
Active In SP
**

Posts: 694
Joined: Nov 2009
#1
22-12-2009, 02:46 PM



.pdf   Minimizing File Download Time in Stochastic peer-to-peer networks.pdf (Size: 313.99 KB / Downloads: 425)
Abstract”
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internetâ„¢s bandwidth usage. 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. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.
I. INTRODUCTION
Peer-to-peer (P2P) technology is heavily used for content distribution applications. The early model for content distribution is a centralized one, in which the service provider simply sets up a server and every user downloads files from it. In this type of network architecture (server-client), many users have to compete for limited resources in terms of bottleneck bandwidth or processing power of a single server. As a result, each user may receive very poor performance. From a single userâ„¢s perspective, the duration of a download session, or the download time for that individual user is the most often used performance metric. P2P technology tries to solve the issue of scalability by making the system distributed. Each computer (peer) in the network can act as both a server and a client at the same time. When a peer completes downloading some files from the network, it can become a server to service other peers in the network. It is obvious that as time goes on, the service capacity of the entire network will increase due to the increase in the number of servicing peers. With this increasing service capacity, theoretical studies have shown that the average download time for each user in the network is much shorter than that of a centralized network architecture in ideal cases [2], [3]. In other words, users of a P2P network should enjoy much faster downloads.
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Reply
seminar topics
Active In SP
**

Posts: 559
Joined: Mar 2010
#2
17-03-2010, 12:49 PM

MINIMIZING FILE DOWNLOAD TIME IN STOCHASTIC PEER-TO-PEER NETWORKS


ABSTRACT:


The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internetâ„¢s bandwidth usage. 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. Here we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.

Existing System:
The early model for content distribution is a centralized one, in which the service provider simply sets up a server and every user downloads files from it. In this type of network architecture (server-client), many users have to compete for limited resources in terms of bottleneck bandwidth or processing power of a single server. As a result, each user may receive very poor performance. From a single userâ„¢s perspective, the duration of a download session, or the download time for that individual user is the most often used performance metric. Peer to Peer technology makes the system distributed.
1. Some of the major challenges facing a P2P network in the real world include peer selection, data search and routing.
2. By reducing actual file transfer time, the download time for each user can be minimized.
3. Nowadays, the common approach for analyze average download time is based on Average Service capacity.

Limitations of Average Service capacity:

4. But it contain two major significant impact
a) Spatial Heterogeneity
b) Temporal Correlation


Spatial Heterogeneity and Temporal Correlation:
In a P2P network, just like any other network, the service capacities from different source peers are different. There are many reasons for this heterogeneity. On each peer side, physical connection speeds at different peers vary over a wide range Also, it is reasonable to assume that most peers in a typical P2P network are just personal computers, whose processing powers are also widely different. The limitation in the processing power can limit how fast a peer can service others and hence limits the service capacity.


There are many factors causing this fluctuation. First, the number of connection a source peer allows is changing over time, which creates a fluctuation in the service capacity for each user. Second, some user applications running on a source peer (usually a PC), such as online games, may throttle the CPU and impact the amount of capacity it can offer. Third, temporary congestion at any link in the network can also reduce the service capacity of all users utilizing that link.



PROPOSED SYSTEM:

1. Downloading time can be reduced by using Simple distributed Algorithm with no global Information by using stochastic process.
Here analyze the performance of
1. Parallel Downloading
2. Random Chunk Based Switching
3. Random Time Based Switching

2. Here the impact of stochastic variations of capacities on the average
Download time of each peer in the steady state is more rather than in the impact of sources“downloader™s dynamics in the transient period.

1. Effect of Parallel Downloading:

Parallel downloading improves the performance by reducing the file size over the worst source peer and also may increase the service capacity one receives from the network by utilizing unused capacities of other source peers. If a downloader utilizes one source peer at a time, switching around seems to be a good strategy to avoid the bad source peer.
If the file F is divided into K chunks of equal size, and simultaneous connections are used, the capacity for this download session becomes c1+c2+¦ck, where ci is the service capacity of ith connection. Intuitively, this parallel downloading seems to be optimal in all cases. But, it is worth noting that the download time for parallel downloading is given by max{t1,t2,¦tk} rather than F/(c1+c2+¦ck) , where ti is the download time of a chunk over ith connection. This is because the chunk that takes the longest time to complete determines the entire download session.
Thus, even in the network with one user, parallel downloading may not reduce the download time to the predicted value in all cases. Instead, the performance of parallel download depends upon the distribution of the underlying service capacities and could be much worse than the ideal case, indeed; it is shown in [15] that if we can make the chunk-size proportional to the service capacity of each source peer, parallel downloading can yield the optimal download time


2. Random Chunk Based Switching:

In the random chunk-based switching scheme, the file of interest is divided into many small chunks just as in the 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 connects to it to retrieve a new chunk. In this way, 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. The download time for one chunk is independent of that of the previous chunk. Intuitively, switching source peers based on chunk can reduce the correlation in service capacity between chunks and hence reduce the average download time. However, there is another factor that has negative impact on the average download time, the spatial heterogeneity.

3. Random Time Based Switching:

In this section, we analyze a very simple, distributed algorithm and show that it effectively removes correlations in the capacity fluctuation and the heterogeneity in space, thus greatly reducing the average download time. As the algorithm will be implemented at each downloading peer in a distributed fashion, without loss of generality, we only focus on a single downloader throughout this section.

In this setup, we can consider the following two schemes: (I) permanent connection, and (ii) random periodic switching. For the first case, the source selection function 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. For the random periodic switching, the downloader randomly chooses a source peer at each time slot, independently of everything else.


Hardware Requirements
¢ SYSTEM : Pentium IV 2.4 GHz
¢ HARD DISK : 40 GB
¢ FLOPPY DRIVE : 1.44 MB
¢ MONITOR : 15 VGA colour
¢ MOUSE : Logitech.
¢ RAM : 256 MB
¢ KEYBOARD : 110 keys enhanced.

Software Requirements
¢ Operating system :- Windows XP Professional
¢ Front End :- Microsoft Visual Studio .Net 2005
¢ Coding Language :- ASP.NET 2.0, C# 2.0
¢ Database :- SQL SERVER 2000
read more
portal.acmcitation.cfm?id=1373990.1373991
www4.ncsu.edu/~dyeun/doc/paper-ciss06-chiu.pdf
cse.cuhk.edu.hk/~cslui/PUBLICATION/mama2008.pdf
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Reply
project report helper
Active In SP
**

Posts: 2,270
Joined: Sep 2010
#3
13-10-2010, 10:53 AM



.pdf   29. Minimizing File Download Time in Stochastic Peer-to-Peer Networks.pdf (Size: 760.51 KB / Downloads: 130)
Minimizing File Download Time in Stochastic peer-to-peer networks

Yuh-Ming Chiu and Do Young Eun

Abstract—

The peer-to-peer (P2P) file-sharing applications are
becoming increasingly popular and account for more than 70%
of the Internet’s bandwidth usage. 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. In this paper, we consider two major
factors that have significant impact on average download time,
namely, the spatial heterogeneity of service capacities in different
source peers and the temporal fluctuation in service capacity of
a single source peer. We point out that the common approach of
analyzing the average download time based on average service
capacity is fundamentally flawed. We rigorously prove that both
spatial heterogeneity and temporal correlations in service capacity
increase the average download time in P2P networks and then
analyze a simple, distributed algorithm to effectively remove these
negative factors, thus minimizing the average download time. We
show through analysis and simulations that it outperforms most of
other algorithms currently used in practice under various network
configurations

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks--7928
Reply
MALLA.SREE
Active In SP
**

Posts: 1
Joined: Aug 2011
#4
05-08-2011, 11:43 AM

i want doc for literature of review for project and implimentation "Minimizing File Download Time in Stochastic Peer-to-Peer Networks"
Reply
seminar addict
Super Moderator
******

Posts: 6,592
Joined: Jul 2011
#5
06-08-2011, 10:30 AM

To get more information about the topic "Minimizing File Download Time in Stochastic peer-to-peer networks " please refer the link below

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks?pid=53607#pid53607
Reply
psuresh
Active In SP
**

Posts: 1
Joined: Dec 2011
#6
08-12-2011, 09:06 PM

i want to project and implimentation code
Reply
seminar addict
Super Moderator
******

Posts: 6,592
Joined: Jul 2011
#7
09-12-2011, 09:48 AM


to get information about the topic"Minimizing File Download Time in Stochastic peer-to-peer networks" refer the link bellow

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks
Reply
seminar paper
Active In SP
**

Posts: 6,455
Joined: Feb 2012
#8
15-03-2012, 12:32 PM

hi
you can see these pages to get the details on MINIMIZING FILE DOWNLOAD TIME IN STOCHASTIC PEER-TO-PEER NETWORKS


topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks--14925
Reply
djking
Active In SP
**

Posts: 1
Joined: Apr 2011
#9
21-03-2012, 06:57 PM

i need the project and implimentation source code too (minimizing file download time in stochastic peer-to-peer networks)
Reply
lahari.thatipudi@gmail.com
Active In SP
**

Posts: 2
Joined: Mar 2012
#10
22-03-2012, 10:24 PM

urgent!!!!!!!
want documentation for
Minimizing file download time in stochastic peer-to-peer network

2maro submision
Reply
seminar paper
Active In SP
**

Posts: 6,455
Joined: Feb 2012
#11
23-03-2012, 09:41 AM

hi
you can see these pages to get the details on MINIMIZING FILE DOWNLOAD TIME IN STOCHASTIC PEER-TO-PEER NETWORKS


topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks--14925
Reply
seminar paper
Active In SP
**

Posts: 6,455
Joined: Feb 2012
#12
27-03-2012, 01:21 PM

Minimizing File Download Time in Stochastic peer-to-peer networks


.doc   Abstract.doc (Size: 32 KB / Downloads: 23)

The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet’s bandwidth usage. 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. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer.


Existing system:

PEER-TO-PEER (P2P) technology is heavily used for content distribution applications. The early model for content distribution is a centralized one, in which the service provider simply sets up a server and every user downloads files from it. In this type of network architecture (server-client), many users have to compete for limited resources in terms of bottleneck bandwidth or processing power of a single server.


Proposed system:

In this paper, we first characterize the relationship between the heterogeneity in service capacity and the average download time for each user, and show that the degree of diversity in service capacities has negative impact on the average download time. After we formally define the download time over a stochastic capacity process, we prove that the correlations in the capacity make the average download time much larger than the commonly accepted value , where is the average capacity of the source peer.



Random chunk Based Downloading

File is divided into many chunks and user downloads chunks sequentially one at time. 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. Switching source peers based on chunk can reduce average download time.

Random Periodic Switching

File is divided into many chunks and user downloads chunks sequentially one at a time. The client randomly chooses the source peer at each time slot and download the chunks from each peer in the given time slots.


Reply
naveenrockstar
Active In SP
**

Posts: 1
Joined: Mar 2013
#13
14-03-2013, 10:18 PM

i need sourcecode for this please
AND uml diagrams
Reply
study tips
Super Moderator
******

Posts: 10,180
Joined: Feb 2013
#14
15-03-2013, 09:37 AM

To get full information or details of Minimizing File Download Time in Stochastic peer-to-peer networks please have a look on the pages

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-networks-source-code-download

topicideashow-to-minimizing-file-download-time-in-stochastic-peer-to-peer-network?page=2

if you again feel trouble on Minimizing File Download Time in Stochastic peer-to-peer networks please reply in that page and ask specific fields in Minimizing File Download Time in Stochastic peer-to-peer networks
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Cut Detection in Wireless Sensor Networks pdf project girl 2 1,272 16-07-2015, 09:21 PM
Last Post: Guest
  Load Rebalancing for Distributed File Systems in Clouds seminar tips 3 1,805 13-04-2015, 05:21 PM
Last Post: shilpavpius
  microwind software free download jaseelati 0 284 23-02-2015, 12:47 PM
Last Post: jaseelati
  crime file management system er diagram jaseelati 0 441 17-01-2015, 04:35 PM
Last Post: jaseelati
  computational intelligence in wireless sensor networks ppt jaseelati 0 368 10-01-2015, 03:10 PM
Last Post: jaseelati
  credit card fraud detection using hidden markov model project download jaseelati 0 295 10-01-2015, 01:34 PM
Last Post: jaseelati
  crime file management system ppt jaseelati 0 229 27-12-2014, 01:17 PM
Last Post: jaseelati
  3d password pdf free download jaseelati 0 326 20-12-2014, 03:10 PM
Last Post: jaseelati
  underwater wireless communication ppt download jaseelati 0 366 13-12-2014, 02:24 PM
Last Post: jaseelati
  MANETS: MOBILE ADHOC NETWORKS seminar projects crazy 2 1,993 11-06-2014, 09:44 AM
Last Post: seminar project topic