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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Implementation of Distributed Variable Chunk based Switching in Peer to Peer Network

by Shambhuraj Deshmukh, Sagar Mane, G. A. Patil
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 121 - Number 15
Year of Publication: 2015
Authors: Shambhuraj Deshmukh, Sagar Mane, G. A. Patil
10.5120/21620-4907

Shambhuraj Deshmukh, Sagar Mane, G. A. Patil . Implementation of Distributed Variable Chunk based Switching in Peer to Peer Network. International Journal of Computer Applications. 121, 15 ( July 2015), 43-50. DOI=10.5120/21620-4907

@article{ 10.5120/21620-4907,
author = { Shambhuraj Deshmukh, Sagar Mane, G. A. Patil },
title = { Implementation of Distributed Variable Chunk based Switching in Peer to Peer Network },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 121 },
number = { 15 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 43-50 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume121/number15/21620-4907/ },
doi = { 10.5120/21620-4907 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:08:34.189565+05:30
%A Shambhuraj Deshmukh
%A Sagar Mane
%A G. A. Patil
%T Implementation of Distributed Variable Chunk based Switching in Peer to Peer Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 121
%N 15
%P 43-50
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Peer-to-peer (P2P) computing has been one of the emerging technologies, particularly contributing in distributed file sharing. Experimental studies show that for a file download, network congestion or service capacity fluctuation takes minutes to several hours. For a P2P n/w one of the fundamental performance metrics is the average download time. The common approach to analyse the average download time is average service capacity. Heterogeneity and fluctuation have significant impact on service capacity and hence averages the download time. Random Chunk Based Switching is one of the file downloading scheme where, the file to be downloaded is divided into many chunks but the shortcomes of this scheme are mentioned below. User sequentially downloads one chunk at a time. If user gets stuck in a low service capacity peer, downloading a fixed amount of bytes from that peer may take a long time. Chunk size remains fixed and it does not change with time. We have designed and implemented a new scheme Distributed Variable Chunk Based Switching where chunk size changes with time. The downloader will be downloading the file from different peers. If bandwidth available is increased then downloading can complete before specified time. If bandwidth available is decreased then downloader will search another peer with good bandwidth and get it replaced. Our new scheme removes heterogeneity and fluctuation. It also provides a distributed approach to a sequential Random Chunk Based Switching.

References
  1. "Distributed Variable Chunk Based Switching in Peer to Peer network", by Shambhuraj Deshmukh and Amit Chougule in IEEE International Conference on Information and Computer Networks (ICICN 2011), January 26-28, 2011, Guiyang, China.
  2. "Minimizing File Download Time in Stochastic Peer-to-Peer Networks", by Yuh- Ming Chiu and Do Young Eun IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 2, APRIL 2008.
  3. "Dynamically Distributed Parallel Permanent Periodic Switching- D2PS for Minimizing File Download Time in Peer-to- Peer Networks", by M. Shymala devi, S. Pushpalatha in IEEE International Advance Computing Conference (IACC 2009), March 2009.
  4. D. Qiu and R. Srikant, "Modelling and Performance Analysis of Bit-torrent-like Peer-to-Peer Networks," in Proceedings of ACM Sigcomm, Aug. 2004.
  5. "Service Capacity of Peer to Peer Networks", by X. Yang and G. deVeciana in Proc. IEEE INFOCOM, Mar. 2004, pp. 2242–2252.
  6. "Measurement, Modeling, and Analysis of a Peer-to-Peer File Sharing Workload," by K. P. Gummadi, R. J. Dunn, and S. Saroiu in Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.
  7. Jxta Programmers Guide_v2. 5
  8. JXTA by Brendon J. Wilson
  9. Java Programming Language by James Gosling
  10. M. Adler, R. Kumar, K. Ross, D. Rubenstein, D. Turner, and D. D. Yao, "Optimal peer selection in a free-market peer-resource economy," in Proc. Workshop on Economics of Peer-to-Peer Systems (P2PEcon), Cambridge, MA, Jun. 2004.
  11. M. Adler, R. Kumar, K. Ross, D. Rubenstein, T. Suel, and D. D. Yao, "Optimal peer selection for P2P downloading and streaming," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 1538–1549.
  12. D. S. Bernstein, Z. Feng, and B. N. Levine, "Adaptive peer selection," in Proc. Int. Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, Feb. 2003.
  13. S. G. M. Koo, K. Kannan, and C. S. G. Lee, "A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks," in Proc. IEEE Int. Conf. Computer Communications and Networks (ICCCN 2004), Rosemont, IL, Oct. 2004, pp. 469–474.
  14. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content Addressable Network," Univ. California, Berkeley, Tech. Rep. TR-00-010, 2000.
  15. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for Internet applications," in Proc. ACM SIGCOMM, 2001.
  16. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE J. Sel. Areas Commun. , vol. 22, no. 1, pp. 41–53,Jan. 2004.
  17. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost, "Informed content delivery across adaptive overlay networks," in Proc. ACM SIGCOMM, 2002.
  18. C. Gkantsidis and P. R. Rodriguez, "Network coding for large scale content distribution," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 2235–2245.
  19. "Peer-to-peer content distribution: Using client PC resources to store and distribute content in the enterprise" Intel Corp. , Tech. Rep. , Sep. 2003 [Online]. Available:http://www. intel. com/it/digital-enterprise/peer-peer-content- distribution. pdf
  20. K. K. Ramachandran and B. Sikdar, "An analytic framework for modeling peer to peer networks," in Proc. IEEE INFOCOM,Mar. 2005, pp. 215–269.
Index Terms

Computer Science
Information Sciences

Keywords

Service Capacity P2P JXTA.

Powered by PhDFocusTM