Peer-to-Peer Models for Resource Discovery in Large-Scale Grids: A Scalable Architecture

2007 ◽  
pp. 66-78 ◽  
Author(s):  
Domenico Talia ◽  
Paolo Trunfio ◽  
Jingdi Zeng
Keyword(s):  
Large Scale ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Scalable Architecture ◽  
Peer Models

Peer-to-Peer Search Techniques for Service-Oriented Computing

2010 ◽  
pp. 44-63
Author(s):  
Lu Liu ◽  
Duncan Russell ◽  
Jie Xu
Keyword(s):  
Service Discovery ◽  
Large Scale ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Great Success ◽  
P2p Networks ◽  
Search Techniques ◽  
P2p Systems ◽  
Service Oriented ◽  
And Performance

Peer-to-peer (P2P) networks attract attentions worldwide with their great success in file sharing networks (e.g., Napster, Gnutella, BitTorrent, and Kazaa). In the last decade, numerous studies have been devoted to the problem of resource discovery in P2P networks. Recent research on structured and unstructured P2P systems provides a series of useful solutions to improve the scalability and performance of service discovery in large-scale service-based systems. In this chapter, the authors systematically review recent research studies on P2P search techniques and explore the potential roles and influence of P2P networking in dependable service-based military systems.

A Peer-to-Peer Framework for Resource Discovery in Large-Scale Grids

2007 ◽  
pp. 123-137 ◽  
Author(s):  
Domenico Talia ◽  
Paolo Trunfio ◽  
Jingdi Zeng ◽  
Mikael Högqvist
Keyword(s):  
Large Scale ◽  
Resource Discovery ◽  
Peer To Peer

scholarly journals SNAP-STABILIZING PREFIX TREE FOR PEER-TO-PEER SYSTEMS

2010 ◽  
Vol 20 (01) ◽  
pp. 15-30 ◽  
Author(s):  
EDDY CARON ◽  
FRÉDÉRIC DESPREZ ◽  
FRANCK PETIT ◽  
CÉDRIC TEDESCHI
Keyword(s):  
Large Scale ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Computational Grids ◽  
Distributed Data ◽  
Range Queries ◽  
Initial State ◽  
Worst Case ◽  
Common Prefix ◽  
Peer To Peer Systems

Several factors still hinder the deployment of computational grids over large scale platforms. Among them, the resource discovery is one crucial issue. New approaches, based on peer-to-peer technologies, tackle this issue. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Despite their lack of robustness in dynamic settings, trie-structured approaches outperform other peer-to-peer fashioned technologies by efficiently supporting range queries. Within recent trie-based approaches, the fault-tolerance is handled by preventive mechanisms, intensively using replication. However, replication can be very costly in terms of computing and storage resources and does not ensure the recovery of the system after arbitrary failures. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. It ensures a system to converge to its intended behavior, regardless of its initial state, in a finite time. A snap-stabilizing algorithm guarantees that it always behaves according to its specification, once the protocol is launched. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h + h′) rounds, where h and h′ are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n2) actions. However, simulations allow to state that this worst case is far from being reached and to confirm the average complexities, showing the practical efficiency of this protocol.

scholarly journals A DHT-Based Discovery Service for the Internet of Things

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Federica Paganelli ◽  
David Parlanti
Keyword(s):  
Internet Of Things ◽  
Large Scale ◽  
Future Internet ◽  
Peer To Peer ◽  
The Internet ◽  
Dangerous Goods ◽  
Discovery Service ◽  
Single Attribute ◽  
Smart Things ◽  
The Internet Of Things

Current trends towards the Future Internet are envisaging the conception of novel services endowed with context-aware and autonomic capabilities to improve end users’ quality of life. The Internet of Things paradigm is expected to contribute towards this ambitious vision by proposing models and mechanisms enabling the creation of networks of “smart things” on a large scale. It is widely recognized that efficient mechanisms for discovering available resources and capabilities are required to realize such vision. The contribution of this work consists in a novel discovery service for the Internet of Things. The proposed solution adopts a peer-to-peer approach for guaranteeing scalability, robustness, and easy maintenance of the overall system. While most existing peer-to-peer discovery services proposed for the IoT support solely exact match queries on a single attribute (i.e., the object identifier), our solution can handle multiattribute and range queries. We defined a layered approach by distinguishing three main aspects: multiattribute indexing, range query support, peer-to-peer routing. We chose to adopt an over-DHT indexing scheme to guarantee ease of design and implementation principles. We report on the implementation of a Proof of Concept in a dangerous goods monitoring scenario, and, finally, we discuss test results for structural properties and query performance evaluation.

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.  

BestPeer++: A Peer-to-Peer Based Large-Scale Data Processing Platform

2014 ◽  
Vol 26 (6) ◽  
pp. 1316-1331 ◽  
Author(s):  
Gang Chen ◽  
Tianlei Hu ◽  
Dawei Jiang ◽  
Peng Lu ◽  
Kian-Lee Tan ◽  
...  
Keyword(s):  
Data Processing ◽  
Large Scale ◽  
Peer To Peer ◽  
Large Scale Data ◽  
Large Scale Data Processing ◽  
Processing Platform ◽  
Scale Data

scholarly journals Unobtrusive monitoring: Statistical dissemination latency estimation in Bitcoin’s peer-to-peer network

PLoS ONE ◽  
2020 ◽  
Vol 15 (12) ◽  
pp. e0243475
Author(s):  
David Mödinger ◽  
Jan-Hendrik Lorenz ◽  
Rens W. van der Heijden ◽  
Franz J. Hauck
Keyword(s):  
Bayesian Model ◽  
Large Scale ◽  
Risk Estimation ◽  
Peer To Peer ◽  
Third Party ◽  
Network Resources ◽  
Connection Number ◽  
Peer Network ◽  
Time Required ◽  
Peer To Peer Network

The cryptocurrency system Bitcoin uses a peer-to-peer network to distribute new transactions to all participants. For risk estimation and usability aspects of Bitcoin applications, it is necessary to know the time required to disseminate a transaction within the network. Unfortunately, this time is not immediately obvious and hard to acquire. Measuring the dissemination latency requires many connections into the Bitcoin network, wasting network resources. Some third parties operate that way and publish large scale measurements. Relying on these measurements introduces a dependency and requires additional trust. This work describes how to unobtrusively acquire reliable estimates of the dissemination latencies for transactions without involving a third party. The dissemination latency is modelled with a lognormal distribution, and we estimate their parameters using a Bayesian model that can be updated dynamically. Our approach provides reliable estimates even when using only eight connections, the minimum connection number used by the default Bitcoin client. We provide an implementation of our approach as well as datasets for modelling and evaluation. Our approach, while slightly underestimating the latency distribution, is largely congruent with observed dissemination latencies.

Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments

2013 ◽  
Vol 45 (4) ◽  
pp. 1-40 ◽  
Author(s):  
Daniel Lazaro ◽  
Joan Manuel Marques ◽  
Josep Jorba ◽  
Xavier Vilajosana
Keyword(s):  
Distributed Computing ◽  
Resource Discovery ◽  
Peer To Peer
Sign in / Sign up

Export Citation Format

Share Document