Sie sind auf Seite 1von 18

CHUNK SCHEDULING STRATEGIES IN P2P NETWORKS

By

Internal Guide ASWINI

K.DURGA PRASAD(08591A1244) B.SHIVA CHARAN (08591A1212)

CONTENTS
Introduction Existing System Proposed System System Requirements Modules UML Diagrams

INTRODUCTION
Straight line routing in large homogeneous multi-hop wireless networks. Routing is the act of moving information across an internetwork from a source to a destination Simple stochastic model that can be used to compare different downloading strategies to random peer selection.
3

EXISTING SYSTEM
Existing routing schemes take the decisions based on the load imposed on every network link. When a link, becomes congested, some of the routes are modified. The source cannot choose the optimal path. Memory burden is on all nodes.

PROPOSED SYSTEM
Each peer obtains an entire file before this possession it is like a store-and-forward system the file is divided into a number of chunks. straight-line routing threshold value to get the optimal path.

REQUIREMENTS
Software Requirements:
Language Technologies Database IDE : C#.NET : Microsoft.NET Technologies with ASP.NET : Microsoft SQL server 2005 : Visual Studio 2008

Operating System : Microsoft Windows XP or Later Version

Hardware Requirements:
Processor RAM Hard Disk : Intel Pentium or more : 512 MB (Minimum) : 80 GB

MODULES
Client Server Router

Client
In computing, a client is a system that accesses a (remote) service on another computer by some kind of network. Client selects a path to save a file, which is sent by the Server in order to find the impact of straight line routing.

Server
A kind of daemon which performs a service for the requester, which often runs on a computer other than the one which the server runs. We can transfer the files and clients can receive the files at specified location.

Router
Multiple relay nodes between source and destinations in a wireless multi-hop networks can be termed as routers. Shortest-path routing is often used for its simplicity and scalability, and this is closely approximated by straight line routing for large multi-hop wireless networks.

Client : Client

Port

File

1 Initializing Port :

1 Open Port :

1 Save File :

client

Server : Server

Port

File

Router : Router

1 Initializing Port :

1 Open Port :

1 Selecting File :

1 Sending File :

server

Router : Router 1 Forwarding Packet :

Packet Client : Client

1 Checking Destination Reached or not :

1 Send Data : 1 Initializing Port : 1 Opening Port : 1 Recieve Data :

router

ReceiveData NIC <<include>>

<<include>>

OpenNetworkPort

InitializeNetworkPort

client

S a v e F i l<e < i n c l u d e > >

U se r

S e l e c tF i le L o c a ti o n

client

U se r

S e n d F ile

< < in c lu d e > >

< < in clu d e > > < < in clu d e > >

O p e n N e t w o r kP o rt

I n i t i a l i z e N e t w o r kP o rt

S e l e c tF i l e

server

< < in c lu d e > > F o rw a rd P a c k e t < < in c lu d e > > < < in c lu d e > > N IC F in tN e xtR o u te r R e c e ive P a c k e t S e n d P a cke t < < in c lu d e > > < < in c lu d e > > < < in c lu d e > >

O p e n N e tw o rk P o rt

In itia lize P o rt

router

Server

Router

Client

Activity diagram

Das könnte Ihnen auch gefallen