Abstract

The Peer-to-Peer (P2P) computing is one of the rapidly growing technology, because day by day people needs and expectations are extending beyond boundaries. This P2P technology is started from file sharing, video streaming and P2P computing. Basically in this P2P computing, those who are in on-line all will act likes as a server or client. If they are having data segments then it will act as server otherwise clients. Generally the data segments are preserving at the peers in different levels such as hard cache and soft cache. Based on the popularity the video contents can be downloaded. Normally the most popular data segments are placed on the cache which is downloaded either from video server of from neighboring peers. There are so many of cache replacement algorithms have been introduced to replace the old data segments with newly arrived data segments. While arriving new data segments the old data segments removed from the queue i.e. cache, so the availability of the data content is presented very low. To overcome this problem multilevel cache is protecting the old segments in order to increase the speed. Generally P2P system the request will go at the neighbouring peer that particular neighbouring peer having is less connectivity then the client can receive the data segments slowly. Therefore overcoming this category of connectivity problem, we recommended bandwidth based cluster. After client registration, the video server build cluster based on bandwidth size. Once the request from client / server received immediately the video server finds highest bandwidth and LFU peer in their cluster and then service is redirected.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call