scholarly journals Experiences in Developing a Micro-payment System for Peer-to-Peer Networks

2010 ◽  
Vol 5 (1) ◽  
pp. 23-42 ◽  
Author(s):  
Kaylash Chaudhary ◽  
Xiaoling Dai ◽  
John Grundy
Keyword(s):  
Free Rider ◽  
Peer To Peer ◽  
Payment System ◽  
P2p Networks ◽  
Payment Systems ◽  
Content Sharing ◽  
Free Rider Problem ◽  
Proposed Model ◽  
Peer To Peer Networks ◽  
Payment Credit

Micro-payment systems are an important part of peer-to-peer (P2P) networks and address the “free-rider” problem in most existing content sharing systems. To address this issue, the authors have developed a new micro-payment system for content sharing in P2P networks called P2P-Netpay. This is an offline, debit based protocol that provides a secure, flexible, usable and reliable credit service. This article compares micro-payment with non-micro-payment credit systems for file sharing applications and finds that this approach liberates the “free-rider” problem. The authors analyse the heuristic evaluation performed by a set of evaluators and present directions for research aiming to improve the overall satisfaction and efficiency of the proposed model.

P2P-NetPay

2012 ◽  
pp. 159-182
Author(s):  
Xiaoling Dai ◽  
Kaylash Chaudhary ◽  
John Grundy
Keyword(s):  
Free Rider ◽  
Peer To Peer ◽  
User Evaluation ◽  
P2p Networks ◽  
Payment Systems ◽  
End User ◽  
Content Sharing ◽  
Free Rider Problem ◽  
Peer To Peer Networks ◽  
Payment Credit

Micro-payment systems are becoming an important part of peer-to-peer (P2P) networks. The main reason for this is to address the “free-rider” problem in most existing content sharing systems. The authors of this chapter have developed a new micro-payment system for content sharing in P2P networks called P2P-Netpay. This is an offline, debit based protocol that provides a secure, flexible, usable, and reliable credit service in peer-to-peer networks ensuring equitable participation by all parties. The authors have carried out an assessment of micro-payment against non-micro-payment credit systems for file sharing applications. The chapter reports on the design of our experiment and results of an end user evaluation. The chapter then discusses the performance of the credit model, comparing it to a non-micro-payment credit model. Through evaluation of the proposed system and comparison with other existing systems, the authors find that the new approach eliminates the “free-rider” problem. The chapter analyses a heuristic evaluation performed by a set of evaluators and presents directions for research aiming to improve the overall satisfaction and efficiency of this model for peers.

scholarly journals Peer-to-Peer Networks for Content Sharing

2011 ◽  
pp. 28-65 ◽  
Author(s):  
Choon Hoong Ding ◽  
Sarana Nutanong ◽  
Rajkumar Buyya
Keyword(s):  
File Sharing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Networks ◽  
P2p Computing ◽  
P2p Systems ◽  
Content Sharing ◽  
Peer To Peer Networks ◽  
Network Topologies ◽  
Broad Overview

Peer-to-peer (P2P) systems are popularly used as “file swapping” networks to support distributed content sharing. A number of P2P networks for file sharing have been developed and deployed. Napster, Gnutella, and Fasttrack are three popular P2P systems. This chapter presents a broad overview of P2P computing and focuses on content sharing networks and technologies. It also emphasizes on the analysis of network topologies used in popular P2P systems. In addition, this chapter also identifies and describes architecture models and compares various characteristics of four P2P systems—Napster, Gnutella, Fasttrack, and OpenFT.

scholarly journals Detection of DDOS attacks in distributed peer to peer networks

2018 ◽  
Vol 7 (2.7) ◽  
pp. 1051
Author(s):  
Gera Jaideep ◽  
Bhanu Prakash Battula
Keyword(s):  
High Risk ◽  
Large Scale ◽  
Peer To Peer ◽  
P2p Network ◽  
Ddos Attacks ◽  
P2p Networks ◽  
Distributed Environment ◽  
Trace Back ◽  
Peer To Peer Networks ◽  
Direct Attack

Peer to Peer (P2P) network in the real world is a class of systems that are made up of thousands of nodes in distributed environments. The nodes are decentralized in nature. P2P networks are widely used for sharing resources and information with ease. Gnutella is one of the well known examples for such network. Since these networks spread across the globe with large scale deployment of nodes, adversaries use them as a vehicle to launch DDoS attacks. P2P networks are exploited to make attacks over hosts that provide critical services to large number of clients across the globe. As the attacker does not make a direct attack it is hard to detect such attacks and considered to be high risk threat to Internet based applications. Many techniques came into existence to defeat such attacks. Still, it is an open problem to be addressed as the flooding-based DDoS is difficult to handle as huge number of nodes are compromised to make attack and source address spoofing is employed. In this paper, we proposed a framework to identify and secure P2P communications from a DDoS attacks in distributed environment. Time-to-Live value and distance between source and victim are considered in the proposed framework. A special agent is used to handle information about nodes, their capacity, and bandwidth for efficient trace back. A Simulation study has been made using NS2 and the experimental results reveal the significance of the proposed framework in defending P2P network and target hosts from high risk DDoS attacks.  

scholarly journals IDA-Pay: a secure and efficient micro-payment system based on Peer-to-Peer NFC technology for Android mobile devices

2012 ◽  
Vol 8 (4) ◽  
pp. 117 ◽  
Author(s):  
Luca Mainetti ◽  
Luigi Patrono ◽  
Roberto Vergallo
Keyword(s):  
Mobile Devices ◽  
Near Field ◽  
Operating Mode ◽  
Peer To Peer ◽  
Payment System ◽  
Third Party ◽  
Payment Systems ◽  
Shopping Experience ◽  
And Performance ◽  
System Effectiveness

The evolution of modern mobile devices towards novel Radio Frequency (RF) capabilities, such as Near Field Communication, leads to a potential for delivering innovative mobile services, which is still partially unexplored. Mobile proximity payment systems are going to enhance the daily shopping experience, but the access to payment security resources of a mobile device (e.g. the “Secure Element”) by third party applications is still blocked by smartphone and Operating System manufacturers. In this paper, the IDA-Pay system is presented, an innovative and secure NFC micro-payment system based on Peer-to-Peer NFC operating mode for Android mobile phones. It allows to deliver mobile-to-POS micro-payment services, bypassing the need for special hardware. A validation scenario and a system evaluation are also reported to demonstrate the system effectiveness and performance.

P2P Networks with IP Based Communication

2012 ◽  
Vol 3 (4) ◽  
pp. 51-61
Author(s):  
Anupriya Koneru ◽  
MHM Krishna Prasad
Keyword(s):  
Distributed Computing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Networks ◽  
Security Issues ◽  
Peer To Peer Networks ◽  
Exchange Information ◽  
Group Members

P2P communities can be seen as truly Distributed Computing applications in which group members communicate with one another to exchange information. The authors consider security issues in Peer to Peer Networks. For secure exchange of data between the group members the authors present a cryptography protocol and an Identity mechanism which can able to check even the Trust of the Peers based on the available reputation information. The authors are encapsulating the reputations of both the provider and the requester. So the requester cannot (gainfully) maliciously abort the transaction in the middle. In other words, the requester cannot take the service from the provider and then logoff without giving a recommendation to the provider.

An Efficient Search Scheme in Unstructured Peer-to-Peer Networks

2011 ◽  
Vol 211-212 ◽  
pp. 295-299 ◽  
Author(s):  
Ya Dong Gong ◽  
He Ping Deng ◽  
Zhan Ran Gu ◽  
Ji Ye Hu ◽  
Yong Xiang Wen
Keyword(s):  
Success Rate ◽  
System Performance ◽  
Peer To Peer ◽  
Query Answering ◽  
Peer Networks ◽  
Search Efficiency ◽  
P2p Networks ◽  
Peer To Peer Networks ◽  
High Bandwidth ◽  
Simulation Results

In peer-to-peer (P2P) networks, nodes are quite different from each other in many aspects, such as sharing resources, online time and bandwidth. Some approaches have been introduced to take advantage of the query forwarding and answering heterogeneity such that the high bandwidth and query answering capability of nodes can be fully utilized to improve the system performance. In this paper, we suggest using the online time heterogeneity to improve the search efficiency of P2P networks. In our proposed Differentiated Index (Diff-Index) algorithm, the nodes with long online time will have higher priority to be queried. Because the online time is quite different among nodes, much search traffic can be saved by querying only a small portion of a network. The query success rate can be kept high because the nodes sharing a great amount of resources tend to have long online time. Our simulation results show that the Diff-Index algorithm can save 66 percent of search traffic.

Sign in / Sign up

Export Citation Format

Share Document