The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70%

of the Internet's band idth usage! "easurement studies sho that a typical do nload of a file can ta#e from minutes up to se$eral hours depending on the le$el of net or# congestion or the ser$ice capacity fluctuation! In this paper% e consider t o ma&or factors that ha$e significant impact

on a$erage do nload time% namely% the spatial heterogeneity of ser$ice capacities in different source peers and the temporal fluctuation in ser$ice capacity of a single source peer! 'e point out that the common approach of analy(ing the a$erage do nload time based on a$erage ser$ice capacity is fundamentally fla ed! 'e rigorously pro$e that both spatial heterogeneity and temporal correlations in ser$ice capacity increase the a$erage do nload time in P2P net or#s and then analy(e a simple% distributed algorithm to effecti$ely remo$e these negati$e factors% thus minimi(ing the a$erage do nload time! 'e sho through analysis and simulations

that it outperforms most of other algorithms currently used in practice under $arious net or# configurations

Project Overview

This pro&ect remo$es the problems faced by streaming media

ithout

pac#et loss! "any enterprises use streaming $ideo to con$ey ne s clips or corporate communications to their employees or clients! )o e$er% since the net or#s are based on pac#et-s itching technology multimedia to a challenges! hich is designed for data communication% achie$ing efficient distribution of streaming $ideo and ide heterogeneous user population poses many technical

*esides the standard $ideo-o$er-IP issues% enterprises ha$e additional re+uirements due to the need to control a shared infrastructure here business media comes first! In addition to challenges in terms of $ideo coding and net or#ing% one of the #ey re+uirements for enterprise streaming is clearly posed in terms of security! The $ideo distribution has to be efficient and to adapt to the clients re+uirements% hile at the same time offering a high degree of security!

1.1 SYNOPSIS:

The main aim of this pro&ect to remo$e the problems faced by the )igh file do nloading time %the ser$er sends a file to clients ith secure and ith less pac#et loss! file can be transfer ith secure and ith less pac#et loss! The main moti$ation of the ,iles -ystem is to remo$e the streaming media faced problems! -uch as net or# infrastructure that can not accommodate a secure and real time nature of streaming content% components can not adapt to $arying net or# conditions and no standardi(ed streaming formats! The securing and authenticating is an important field in the streaming media! The main moti$ation is to pro$ide the authenticated client only ha$e the rights to access the file % the ser$er adapts a stream e$en though the net or# conditions automatically changed % adapts a stream to a$ailable band idth and ithout pac#et loss it sends the $oluminous streams to client

1.2 SCOPE OF THE PROJECT:

The system is effecti$ely used in out sourcing ser$ice(*P.)% /et or# in 01/ connection! 2ata consists transmitted through net or#% of te3t% documents% image are hich increases the pac#et transmission that led to

increases the traffic! -o traffic is nothing but increasing the pac#et information that information should be analysis and displays it graphically! It is a net or# based pro&ect and it reduces the net or# traffic hich transfer the speed! 0et us ta#e an e3ample the /et or# is or# based on the client running

ser$er communication! 4lient means placing a re+uest (i!e!) client is a running application programs on a local site that re+uests ser$ice from a ser$ices to others program! /et or# consists of t o types of connections! They are Physical connection and 0ogical connection! 5! Physical connection6 'hene$er the computer are interconnect physically (i!e!) connection through cables% cards is called physical connection! 2! 0ogical connection6 7$en though the computer are interconnect% the user ha$e to log on to the computer% hich is called logical connection! In this logical connection% hene$er client ser$er communication ta#es place% traffic bet een client ser$er ill be increased!
1.3 PROJECT FEATURE :

application program on a remote site! -er$er means a program that can pro$ide

-ecured data transfer of media files!

 .nly 1uthenticated client can access the transferred media files! There is no data loss during transmission so at recei$ing end the media file can $ie ith ma3imum +uality!

It is possible to transfer this media file to more than one destination securely at the same time! )a$ing enough 4P8 po er and bus band idth to support the re+uired data rates!

SYSTEM ANA YSIS

2. SYSTEM STU!Y

2.1E"ISTIN# SYSTEM: C IENT $ SER%ER FI E SHARIN# 4ontent distribution is a centrali(ed one% here the content is

distributed from the centrali(ed ser$er to all clients re+uesting the document! 4lients send re+uest to the centrali(ed ser$er for do nloading the file! -er$er accepts the re+uest and sends the file as response to the re+uest!In most client-ser$er setups% the ser$er is a dedicated computer purpose is to distribute files! !RA&'AC(S OF E"ISTIN# SYSTEM -calability problem arises hen multi re+uests arises at a single time! -er$ers need hea$y processing po er 2o nloading ta#es hours hen clients increases 9e+uires hea$y storage in case of multimedia content hose entire

PROPOSE! SYSTEM Peer-to-peer content distribution pro$ides more resilience and higher a$ailability through ide-scale replication of content at large numbers of peers! 1 P2P content distribution community is a collection of

intermittently-connected nodes

ith each node contributing storage% content

and band idth to the rest of the community The peer-to-peer file sharing net or#s had a centrali(ed ser$er system! This system controls traffic amongst the users! The ser$ers store directories of the shared files of the users and are updated ser$er of hat they hen a user logs on! In the centrali(ed peer-to-peer model% a user ould send a search to the centrali(ed ere loo#ing for! The ser$er then sends bac# a list of peers that ha$e the data and facilitates the connection and do nload! The -er$er-4lient system is +uic# and efficient because the central directory is constantly being updated and all users had to be registered to use the program! !

2.2 O'JECTI%ES :

P2P net or#s pro$ide resources% including band idth% storage space% and computing po er! This is not true of a client-ser$er architecture ith a fi3ed set of ser$ers% in hich adding more clients could mean slo er data transfer for all users!

The distributed nature of P2P net or#s also increases robustness in case of failures by replicating data o$er multiple peers

3.1 HAR!&ARE SPECIFICATION:

Processor -peed 91" )ard 2is# ;eneral

6 6 6 6 6

Pentium-I: 5!5;)( <52"* =0;* >ey*oard% "onitor % "ouse

3.2 SOFT&ARE SPECIFICATION:

.perating -ystem 6 'indo s ?P -oft are Protocol 6 @1:1 ( @2> 5!<!0) 6 82P

MO!U E !ESCRIPTION: 5!Parallel 2o nloading 2! 9andom chun# *ased - itching

A! 9andom Periodic - itching

P)r)**e* !ow+*o),i+-

,ile is di$ided into # chun#s of e+ual si(e and # simultaneous connections are used ! 4lient do nloads a file from # peers at a time! 7ach peer sends a chun# to the client! R)+,o. c/0+1 ')2e, !ow+*o),i+,ile is di$ided into many chun#s and user do nloads chun#s se+uentially one at time! 'hene$er a user completes a chun# from its current source peer% the user randomly selects a ne connects to it to retrei$e a ne chun# can reduce a$erage do nload time! R)+,o. Perio,ic Switc/i+,ile is di$ided into many chun#s and user do nloads chun#s se+uentially one at time! The client randomly chooses the source peer at each time slot and do nload the chun#s from each peer in the gi$en time slots! ! source peer and chun#! - itching source peers based on

3.2 !ATA F O& !IA#RAM:

PEER 3

SEND FILE PACKETS TO CLIENT

IF TIME SLOTS EXCEEDS

IF PACKETS SEND

3.3 PROCESS !IA#RAM: USE CASE !IA#RAM:

Login

C"ient Re$ue%t Authenticated

Ser#er

Peer1

Peer

!eer3

Pac#et merged

CO

A'ORATION !IA#RAM:

1 ' )oth the (i"e% are decr*!ted

C"ient

Peer1 Peer

pac#et
!ac&et Re%!on%e (i"e Re$ue%t (or (i"e%

pac#et
Ser#er

PeerA

ACTI%ITY !IA#RAM

Login

4lient 9e+uest i( In#a"id 9e+uest file I( +a"id Ser#er Error ,e%%age Peer1

Peer

Peer3 "erged pac#et

9ecei$ed files