Piece hunting algorithm for video content management

The circulation of video content over P2P frameworks has turned into a prominent and practical-alternative as of late because of the expanding online accessibility of the content. Furthermore, the differing qualities of end-client terminals utilized for expending content requests the provisioning of content in diverse qualities. A piece hunting algorithm for video content needs to guarantee that the pieces are accepted in time and additionally that the best conceivable quality that might be processed by the end-client terminal and also downloaded in a specific networking conditions is given. In this paper, we portray our algorithm for piece hunting which is focused around probabilistic distribution. We utilize an idea of self-assertive stroller & develop an algorithm for the same under the name of arbitrary stroller. For the process of searching, we contend that arbitrary strolls accomplish very high improvement over the process of flooding on account of reissuing the same request in a periodic manner. The key specialized element of our methodology is a profound aftereffect of stochastic courses of action demonstrating that examples taken from sequential steps of an arbitrary stroll can attain quite same results as that of independent sampling.

[1]  D. Aldous.  On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing , 1987, Probability in the Engineering and Informational Sciences.

[2]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[3]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[4]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[5]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[6]  Jing Xie,et al.  Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information , 2009, 2009 IEEE International Conference on Communications.

[7]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[8]  János Komlós,et al.  Deterministic simulation in LOGSPACE , 1987, STOC.

[9]  Dimitrios Tsoumakos,et al.  Adaptive probabilistic search for peer-to-peer networks , 2003, Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003).

[10]  Edith Cohen,et al.  Associative search in peer to peer networks: Harnessing latent semantics , 2007, Comput. Networks.

[11]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[13]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.