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.

Potential Security Issues in a Peer-to-Peer Network from a Database Perspective

2011 ◽  
pp. 131-144
Author(s):  
Sridhar Asvathanarayanan
Keyword(s):  
Denial Of Service ◽  
Database Security ◽  
Vital Role ◽  
Peer To Peer ◽  
Peer Networks ◽  
Distributed Denial Of Service ◽  
Security Issues ◽  
Peer Network ◽  
Peer To Peer Networks ◽  
Peer To Peer Network

Computing strategies have constantly undergone changes, from being completely centralized to client-servers and now to peer-to-peer networks. Databases on peer-to-peer networks offer significant advantages in terms of providing autonomy to data owners, to store and manage the data that they work with and, at the same time, allow access to others. The issue of database security becomes a lot more complicated and the vulnerabilities associated with databases are far more pronounced when considering databases on a peer-to-peer network. Issues associated with database security in a peer-to-peer environment could be due to file sharing, distributed denial of service, and so forth, and trust plays a vital role in ensuring security. The components of trust in terms of authentication, authorization, and encryption offer methods to ensure security.

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.

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.

Potential Security Issues in a Peer-to-Peer Network from a Database Perspective

2008 ◽  
pp. 1070-1079
Author(s):  
Sridhar Asvathanarayanan
Keyword(s):  
Denial Of Service ◽  
Database Security ◽  
Vital Role ◽  
Peer To Peer ◽  
Peer Networks ◽  
Distributed Denial Of Service ◽  
Security Issues ◽  
Peer Network ◽  
Peer To Peer Networks ◽  
Peer To Peer Network

Computing strategies have constantly undergone changes, from being completely centralized to client-servers and now to peer-to-peer networks. Databases on peer-to-peer networks offer significant advantages in terms of providing autonomy to data owners, to store and manage the data that they work with and, at the same time, allow access to others. The issue of database security becomes a lot more complicated and the vulnerabilities associated with databases are far more pronounced when considering databases on a peer-to-peer network. Issues associated with database security in a peer-to-peer environment could be due to file sharing, distributed denial of service, and so forth, and trust plays a vital role in ensuring security. The components of trust in terms of authentication, authorization, and encryption offer methods to ensure security.

Leveraging Heterogeneity Make Resource Location Efficient in Peer-to-Peer Networks

2011 ◽  
Vol 295-297 ◽  
pp. 1945-1950
Author(s):  
Ya Dong Gong ◽  
Yong Xiang Wen ◽  
He Ping Deng ◽  
Zhan Ran Gu
Keyword(s):  
Resource Sharing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Network ◽  
P2p Networks ◽  
Resource Location ◽  
Original Intent ◽  
P2p Systems ◽  
Inherent Characteristic ◽  
Peer To Peer Networks

Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, the heterogeneity is an inherent characteristic of P2P systems. In this paper, according to the previous researches in P2P resource sharing networks, we first conclude and classify the heterogeneity in P2P networks, and then analyze each type of P2P systems that utilize heterogeneity in P2P network. The above analysis and conclusion will become a good guidance to design new resource locating algorithm which takes advantage of heterogeneity in P2P networks.

scholarly journals Discordant Voting Protocols for Cyclically Linked Agents

10.37236/8578 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
András Pongrácz
Keyword(s):  
Asymptotic Behavior ◽  
Distributed Computing ◽  
Peer To Peer ◽  
Peer Networks ◽  
Peer To Peer Networks ◽  
Cycle Graph

Voting protocols, such as the push and the pull protocol, model the behavior of people during an election. These processes have been studied in distributed computing in peer-to-peer networks, and to describe how viruses or rumors spread in a community. We determine the asymptotic behavior of the runtime of discordant linear protocols on the cycle graph and the probability for each consensus to win. 

Optimising P2P Networks by Adaptive Overlay Construction

2011 ◽  
pp. 882-894
Author(s):  
James Salter ◽  
Nick Antonopoulos
Keyword(s):  
Network Size ◽  
Peer To Peer ◽  
Peer Networks ◽  
Distributed Hash Tables ◽  
P2p Networks ◽  
Hash Tables ◽  
Peer To Peer Networks ◽  
Routing State ◽  
Node Capacity ◽  
Chord Protocol

Distributed Hash Tables (DHTs) have been used in Peer-to-Peer networks to provide query lookups in typically O(log n) messages whilst requiring maintenance of only small amounts of routing state. We propose ROME, a layer which runs on top of the Chord DHT to provide control over network size through monitoring of node workload and propose the use of processes to control the addition or removal of nodes from the network. We show that this technique can reduce further the hop counts in networks where available node capacity exceeds workload, without the need to modify any processes of the underlying Chord protocol.

Sign in / Sign up

Export Citation Format

Share Document