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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Behavioral Analysis of a Proposed Reputation System for Peer-to-Peer Network

by Sunaina Bagga, Chetan Jain, Kaushik Adhikary
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 66 - Number 23
Year of Publication: 2013
Authors: Sunaina Bagga, Chetan Jain, Kaushik Adhikary
10.5120/11256-6131

Sunaina Bagga, Chetan Jain, Kaushik Adhikary . Behavioral Analysis of a Proposed Reputation System for Peer-to-Peer Network. International Journal of Computer Applications. 66, 23 ( March 2013), 23-25. DOI=10.5120/11256-6131

@article{ 10.5120/11256-6131,
author = { Sunaina Bagga, Chetan Jain, Kaushik Adhikary },
title = { Behavioral Analysis of a Proposed Reputation System for Peer-to-Peer Network },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 66 },
number = { 23 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 23-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume66/number23/11256-6131/ },
doi = { 10.5120/11256-6131 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:23:12.663708+05:30
%A Sunaina Bagga
%A Chetan Jain
%A Kaushik Adhikary
%T Behavioral Analysis of a Proposed Reputation System for Peer-to-Peer Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 66
%N 23
%P 23-25
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Peer-to-Peer (P2P) networking technologies have gained popularity as a mechanism for users to share files without the need for centralized servers. A P2P network provides a scalable and fault-tolerant mechanism to locate nodes anywhere on a network without maintaining a large amount of routing state. The increasing availability of high bandwidth Internet connections and low-cost, commodity computers in people's homes has stimulated the use of resource sharing peer- to-peer networks. These systems employ scalable mechanisms that allow anyone to offer content and services to other system users. This allows for a variety of applications beyond simple file sharing. Examples include multicast systems, anonymous communications systems, and web caches. In this paper we propose a reputation system for peer-to-peer network with free rider sensitivity.

References
  1. Chazapis, A. Tsoukalas, G. Verigakis, G. Kourtis, K. Sotiropoulos, A. Koziris, N. "Global-scale peer-to-peer file services with DFS" 978-1-4244-1560-1 IEEE2007, pp. 251-260
  2. Lua E. K. , Crowcroft J. , Pias M. , Sharma R. and Lim S. , "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes", Communications Surveys & Tutorials, IEEE, vol. 7, issue 2, pp. 72-93, 2005.
  3. Rowstron A. and Druschel P. , "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems", in Proceedings of IFIP/ACM Middleware, 2001.
  4. Schafer, J. Malinka, K. "Security in Peer-to-Peer Networks: Empiric Model of File Diffusion in BitTorrent" 978-1-4244-3839-6 IEEE 2009. pp. 9-13
  5. Balfe, S. , Lakhani, A. D. , Paterson, K. G "Trusted computing: providing security for peer-to-peer networks" 0-7695-2376-5 IEEE 2005 pp. 117 - 124
Index Terms

Computer Science
Information Sciences

Keywords

Peer-to-Peer network reputation system free rider

Powered by PhDFocusTM