Minimizing file download time in stochastic peer to peer network
I am suggesting this topic for seminar because not a seminar topic but also its an project topic.
The minimizing file download time in peer to peer network is successfully executing we can serve more than one people at a time .
that is mean Now server can serve one people at a time .
Then after implementing this concept we can serve more than 10 client a a time.
Its same tike bitorrent.The server and client act both server and client.
The main objective of the system is used to minimize the file download time in a stochastic peer to peer network.
The peer to peer technology is heavilty used for content distribution applications.The early model for content distribution is centralized one.in which the service provider simply sets up a server and every user download files from it.In type of network architecture ,many users have to complete for limited resources in terms of bottleneck bandwidth or procesing power of a single server.As a result ,each user may recieve very poor performance.From a single user's perspective ,The duration of a downloadsession or the download time for that individual users is the most often used performance metric.P2P technology tries to solve of scalability by making the system distributed.Each computer(peer) in the network can act both server and client at the time.Whe nuber of clients are trying to access a fle the peers will give response to clients based on load balancing in the peer Its obivious that as time goes on the sevice capacity of the entire network will increase due to the increse 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 shoter than that of a centralized network architecture in ideal cases in other words ,users of a p2p network should enjoy much faster downloads.
You can try to implement... its not only a seminar topic but also a project topic
if you know more details about this topic .You can share with readers and increase your knowledge
0 comments:
Post a Comment