CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Efficient Content Discovery in P2P-Multimedia System

by V. Kavitha Chandrakanthan, R. Raj Priyadarshini
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 56 - Number 5
Year of Publication: 2012
Authors: V. Kavitha Chandrakanthan, R. Raj Priyadarshini
10.5120/8886-2887

V. Kavitha Chandrakanthan, R. Raj Priyadarshini . Efficient Content Discovery in P2P-Multimedia System. International Journal of Computer Applications. 56, 5 ( October 2012), 14-17. DOI=10.5120/8886-2887

@article{ 10.5120/8886-2887,
author = { V. Kavitha Chandrakanthan, R. Raj Priyadarshini },
title = { Efficient Content Discovery in P2P-Multimedia System },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 56 },
number = { 5 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 14-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume56/number5/8886-2887/ },
doi = { 10.5120/8886-2887 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:58:03.958245+05:30
%A V. Kavitha Chandrakanthan
%A R. Raj Priyadarshini
%T Efficient Content Discovery in P2P-Multimedia System
%J International Journal of Computer Applications
%@ 0975-8887
%V 56
%N 5
%P 14-17
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we are interested to provide fast content discovery in P2P multimedia systems. To constructs AVL tree for best efficient search peer in P2P multimedia system. Gossip protocol to exchange information to its neighbouring peers and which chunks to be downloaded from which peer. An issue in peer management manages the scheduling algorithm from which peer. The analysis is made on hybrid content discovery in P2P multimedia system and how the chunk should be distributed over the peer and also how the request chunk picking from the peers in structured networks to be focused and issues are stated. The comparative study is based on the existing features to be undertaken with structure and unstructured networks for fast and efficient content discovery in P2P Multimedia system.

References
  1. H. V. Jagadish, B. C. Ooi, and Q. H. Vu, "BATON: A balanced tree structure for peer-to-peer networks," in Proc. 31st Int. Conf. Very Large Data Bases (VLDB '05), 2005, pp. 661–672.
  2. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan,"Chord: A scalable peer-to-peer lookup service for internet applications," SIGCOMM Comput. Commun. Rev. , vol. 31, no. 4, pp. 149–160, 2001.
  3. Y. Huang, T. Z. Fu, D. -M. Chiu, J. C. Lui, and C. Huang, "Challenges, design and analysis of a large-scale P2P-VoD system," in Proc. ACM SIGCOMM 2008 Conf. Data Communication (SIGCOMM '08), New York, 2008, pp. 375–388.
  4. X. Yang, M. Gjoka, P. Chhabra, and P. Rodriguez, "Kangaroo: video seeking in P2P systems," in Proc. 8th Int. workshop Peer-To-Peer systems(IPTPS`09),2009
  5. Zhou Zhiqiang, Noriaki Yoshiura, "Detection of the Music or Video Files in BitTorrent", Theory and Practice of Computation Proceedings in Information and Communications Technology, Vol 5, pp 202-213, 2012.
  6. J. J. D. Mol, J. A. Pouwelse, M. Meulpolder, D. H. J. Epema, and H. J. Sips, "Give-To-Get: Free-riding-resilient video-on-demand in P2P systems".
  7. Y. He and Y. Liu, "VOVO: VCR-oriented Video-on-Demand in largescale peer-to-peer networks," IEEE Trans. Parallel Distrib. Syst. , vol. 20, pp. 528–539, Apr. 2009.
  8. Y. Guo, S. Yu, H. Liu, S. Mathur, and K. Ramaswamy, "Supporting VCR operation in a mesh-based P2P VoD system," in Consumer Communications and Networking Conference, 2008. CCNC 2008. 5th IEEE, Jan. 2008, pp. 452–457.
  9. Gongwei Fu, Hailong Sun, "Complexity Analysis of Random Search with AVL Tree" April 17, 2006.
  10. J. J. D. Mol, J. A. Pouwelse, M. Meulpolder, D. H. J. Epema, and H. J. Sips "Give-to-Get: An Algorithm for P2P Video-on-Demand" Delft University of Technology, The Netherlands.
  11. N. Magharei and R. Rejaie, "PRIME: Peer-to-Peer ReceiverdrIven MEshed-Based Streaming System," Proc. IEEE INFOCOM,2007.
  12. Knuth, J. H. Morris, and V. Pratt, "Fast Pattern Matching in Strings," SIAM J. Computing, vol. 6, pp. 323-350, 1977.
  13. K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, "The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points," Proc. ACM SIGCOMM,2004.
  14. M. Conti and S. Giordano, "Multihop ad hoc networking: the theory," Communications Magazine, IEEE, vol. 45, pp. 78–86, April 2007.
Index Terms

Computer Science
Information Sciences

Keywords

P2P Multimedia Gossip protocol Content discovery

Powered by PhDFocusTM