Scribd
Upload
831 views

Minimizing File Download Time in Peer-To-Peer Networks

MINIMIZING FILE DOWNLOAD TIME IN PEER-TO-PEER NETWORKS, Dual Mode mobile network access using utility functions, peer to peer, speed download

Uploaded by

Balaji Rao N
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
831 views

Minimizing File Download Time in Peer-To-Peer Networks

MINIMIZING FILE DOWNLOAD TIME IN PEER-TO-PEER NETWORKS, Dual Mode mobile network access using utility functions, peer to peer, speed download

Uploaded by

Balaji Rao N
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

MINIMIZING FILE DOWNLOAD

TIME IN PEER-TO-PEER
NETWORKS
OBJECTIVES
P2P networks provide resources, including
bandwidth, storage space, and computing
power. This is not true of a client-server
architecture with a fixed set of servers, in
which adding more clients could mean slower
data transfer for all users.
The distributed nature of P2P networks also
increases robustness in case of failures by
replicating data over multiple peers
SYNOPSIS
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.
SYNOPSIS
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
Project Overview
 This project removes the problems faced by
streaming media without packet loss. Many
enterprises use streaming video to convey
news clips or corporate communications to
their employees or clients. However, since the
networks are based on packet-switching
technology which is designed for data
communication, achieving efficient distribution
of streaming video and multimedia to a wide
heterogeneous user population poses many
technical challenges.
Project Overview
 Besides the standard video-over-IP issues,
enterprises have additional requirements due
to the need to control a shared infrastructure
where business media comes first. In addition
to challenges in terms of video coding and
networking, one of the key requirements for
enterprise streaming is clearly posed in terms
of security. The video distribution has to be
efficient and to adapt to the clients
requirements, while at the same time offering
a high degree of security.
SCOPE OF THE PROJECT:

 The system is effectively used in out sourcing service (BPO), Network in


LAN connection. Data consists of text, documents, image are transmitted
through network, which increases the packet transmission that led to
increases the traffic. So traffic is nothing but increasing the packet
information that information should be analysis and displays it
graphically. It is a network based project and it reduces the network
traffic which transfer the speed.
PROJECT FEATURE
Secured data transfer of media files.
 
There is no data loss during transmission so at
receiving end the media file can view with maximum
quality.

It is possible to transfer the media file to more than


one destination securely at the same time.
 
Having enough CPU power and bus bandwidth to
support the required data rates.
Existing System
CLIENT - SERVER FILE SHARING
 
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.
DRAWBACKS OF EXISTING SYSTEM

Scalability problem arises when multi requests arises


at a single time.

Servers need heavy processing power

Downloading takes hours when clients increases

Requires heavy storage in case of multimedia content


PROPOSED SYSTEM

 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 inter-connected nodes with each node
contributing storage, content and bandwidth to the
rest of the community
PROPOSED SYSTEM

 Centralized server system.

This system controls traffic amongst the users.

 The servers store directories of shared files of User

 The Server-Client system is quick and efficient because the


central directory is constantly being updated and all users
had to be registered to use the program.
HARDWARE REQUIREMENTS
 Hard disk : 40 GB
 RAM : 512mb
 Processor : Pentium IV
 Monitor : 17’’Color Monitor
 
SOFTWARE REQUIREMENTS
 Front-End : VS .NET 2005
 Coding Language : VB.NET
 Operating System: Windows XP.
CONCLUSION
In this Project we have focused on the average time of each
user in a P2P network. With the divesting usage of network
resources by P2P application in the current Internet it is highly
desirable to improve efficiency by reducing each users download
time. In contrast to the commonly held practice focusing on the
notion of average capacity.

we have shown that both the spatial heterogeneity and the


temporal coverage download time of the users in the network. Even
when the average download time of the users in the network. even
when the average capacity of the network remains the same we have
compared several byte based schemes are not so effective in reducing
the two negative factors that increase the average download time
from negative factors based schemes .
Thank You

You might also like