Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/8660Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bafna, P. | - |
| dc.contributor.author | Annappa, B. | - |
| dc.date.accessioned | 2020-03-30T10:22:32Z | - |
| dc.date.available | 2020-03-30T10:22:32Z | - |
| dc.date.issued | 2011 | - |
| dc.identifier.citation | Communications in Computer and Information Science, 2011, Vol.197 CCIS, , pp.100-106 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8660 | - |
| dc.description.abstract | In Peer-to-Peer Video on Demand System like Video Cassette Recording (VCR) various operations (i.e. forward, backward, resume) are found to be used very frequently. The uncertainty of frequent VCR operations makes it difficult to provide services like play as download. To address this problem, there exist algorithms like random prefetching, distributed prefetching, etc. But each such algorithm has its own advantage and disadvantages. So to overcome the problem of prefetching we propose optimize prefetching for Peer-to-Peer(P2P) Video on Demand systems.The simulation result proves that the proposed prefetching algorithm significantly reduces the seeking delay as compared with the random prefetching scheme. � 2011 Springer-Verlag. | en_US |
| dc.title | Optimization of prefetching in peer-to-peer video on demand systems | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.