Search NASA⌕ Search

SEARCH · Search NASA

Results for “Peer-to-Peer”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

RatBot: anti-enumeration peer-to-peer botnets

Botnets have emerged as one of the most severe cyber threats in recent years. To obtain high resilience against a single point of failure, the new generation of botnets have adopted the peer-to-peer (P2P) structure. One critical question regarding these P2P botnets is: how big are they indeed? To address this question, researchers have proposed both actively crawling and passively monitoring methods to enumerate existing P2P botnets. In this work, we go further to explore the potential strategies that botnets may have to obfuscate their true sizes. Towards this end, this paper introduces RatBot, a P2P botnet that applies some statistical techniques to defeat existing P2P botnet enumeration methods. The key ideas of RatBot are two-fold: (1) there exist a fraction of bots that are indistinguishable from their fake identities, which are spoofing IP addresses they use to hide themselves; (2) we use a heavy-tailed distribution to generate the number of fake identities for each of these bots so that the sum of observed fake identities converges only slowly and thus has high variation. We use large-scale high-fidelity simulation to quantify the estimation errors under diverse settings, and the results show that a naive enumeration technique can overestimate the sizes of P2P botnets by one order of magnitude. We believe that our work reveals new challenges of accurately estimating the sizes of P2P botnets, and hope that it will raise the awareness of security practitioners with these challenges. We further suggest a few countermeasures that can potentially defeat RatBot's anti-enumeration scheme.

97 MATHEMATICS AND COMPUTING↗

Aggregation models on hypergraphs

Following a newly introduced approach by Rasetti and Merelli we investigate the possibility to extract topological information about the space where interacting systems are modelled. From the statistical datum of their observable quantities, like the correlation functions, we show how to reconstruct the activities of their constitutive parts which embed the topological information. The procedure is implemented on a class of polymer models on hypergraphs with hard-core interactions. We show that the model fulfils a set of iterative relations for the partition function that generalise those introduced by Heilmann and Lieb for the monomer–dimer case. After translating those relations into structural identities for the correlation functions we use them to test the precision and the robustness of the inverse problem. Finally the possible presence of a further interaction of peer-to-peer type is considered and a criterion to discover it is identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A comparison study on trading behavior and profit distribution in local energy transaction games

With the increasing integration of distributed energy resources, localized peer-to-peer energy transactions are receiving more attention since they could absorb more distributed renewables locally and stabilize the power grid. To better study the trading behavior and provide guidance for a viable local market design, different game-theoretical frameworks including cooperative and non-cooperative games are established and compared here. For the cooperative grand coalition, the maximum social welfare is guaranteed, the Shapley value and bargaining based approaches are implemented for further profit redistribution. It is shown that the asymmetrical bargaining power can be critical in the final payment clearing and it is equivalent to the Shapley value allocation if prosumers bargain based on their marginal contributions. Non-cooperative trading is formulated by using a Stackelberg bilevel model in which the upper level has the privilege in internal price setting. However, system optimum is not obtained due to competition, and the selfish leader could take away 89% of the collective benefit by price-gap based arbitraging. Aiming for a long-lasting trading market, a virtual benevolent leader and a uniform price structure in which purchase price equals selling price are tested. Experimental results indicate that maximum social welfare and a fairer profit allocation can be achieved with a uniform price structure, regardless of the selfish or benevolent attitude.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Peer-to-Peer Energy Systems for Connected Communities: A Review of Recent Advances and Emerging Challenges

After a century of relative stability of the electricity industry, extensive deployment of distributed energy resources and recent advances in computation and communication technologies have changed the nature of how we consume, trade, and apply energy. The power system is facing a transition from its traditional hierarchical structure to a more deregulated model by introducing new energy distribution models such as peer-to- peer (P2P) sharing for connected communities. The proven effectiveness of P2P sharing in benefiting both prosumers and the grid has been demonstrated in many studies and pilot projects. However, there is still no extensive implementation of such sharing models in today’s electricity markets. This paper aims to shed some light on this gap through a comprehensive overview of recent advances in the P2P energy system and an insightful discussion of the challenges that need to be addressed in order to establish P2P sharing as a viable energy management option in today’s electricity market. To this end, in this article, we provide some background on different aspects of P2P sharing. Then, we discuss advances in P2P sharing through a systematic domain-based classification. We also review different pilot projects on P2P sharing across the globe. Finally, we identify and discuss a number of challenges that need to be addressed for scaling up P2P sharing in the electricity market followed by concluding remarks at the end of the paper.

Tushar, Wayes↗

AntBot: Anti-pollution peer-to-peer botnets

Botnets, which are responsible for many email sparnming and DDoS (Distributed Denial of Service) attacks in the current Internet, have emerged as one of most severe cyber-threats in recent years. To evade detection and improve resistance against countermeasures, botnets have evolved from the first generation that relies on IRC chat channels to deliver commands to the current generation that uses highly resilient P2P (Peer-to-Peer) protocols to spread their C&C (Command and Control) information. It is, however, revealed that P2P botnets, although relieved from the single point of failure that IRC botnets suffer, can be easily disrupted using pollution-based mitigation schemes [15]. In this paper, we play the devil's advocate and propose a new type of hypothetical botnets called AntBot, which aim to propagate their C&C information to individual bots even though there exists an adversary that persistently pollutes keys used by seized bots to search the command information. The key idea of AntBot is a tree-like structure that bots use to deliver the command so that captured bots reveal only limited information. To evaluate effectiveness of AntBot against pollution-based mitigation in a virtual environment, we develop a distributed P2P botnet simulator. Using extensive experiments, we demonstrate that AntBot operates resiliently against pollution-based mitigation. We further present a few potential defense schemes that could effectively disrupt AntBot operations.

97 MATHEMATICS AND COMPUTING↗

Roles of retailers in the peer-to-peer electricity market: A single retailer perspective

Despite extensive research in the past five years and several successfully completed and on-going pilot projects, regulators are still reluctant to implement peer-to-peer trading at a large-scale in today’s electricity market. The reason could partly be attributed to the perceived disadvantage of current market participants like retailers due to their exclusion from market participation - a fundamental property of decentralized peer-to-peer trading. As a consequence, recently, there has been growing pressure from energy service providers in favor of retailers’ participation in peer-to-peer trading. However, the role of retailers in the peer-to peer market is yet to be established as no existing study has challenged this fundamental circumspection of decentralized trading. In this context, this perspective takes the first step to discuss the feasibility of retailers’ involvement in the peer-to-peer market. In doing so, we identify key characteristics of retail-based and peer-to-peer electricity markets and discuss our viewpoint on how to incorporate a single retailer in a peer-to-peer market without compromising the fundamental decision-making characteristics of both markets. Finally, we give an example of a hypothetical business model to demonstrate how a retailer can be a part of a peer-to-peer market with a promise of collective benefits for the participants.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Predicting content consumption from content-to-content relationships

As the majority of Internet traffic today is attributed to content-centric applications, there has been ever-increasing demand for highly scalable and efficient content delivery. An accurate prediction on future content consumption is essential for such demand. To address such an issue, this paper introduces a new computational approach, Content Network (CN) that can capture the relations among contents, and its potential applications. We conduct a measurement study to investigate how contents are inter-related from the viewpoint of content spreading on one of the popular BitTorrent portals: The Pirate Bay. Based on the large-scale dataset that contains 18 K torrents and 9 M users, we construct the CN and investigate its structural properties. Our key finding is that contents in the same community in the CN (i) belong to the same content category with 94% probability, (ii) are uploaded by the same content publisher with 76% probability, and (iii) have the similar titles with 51% probability, which implies that contents in the same community collectively contain common (shared) interests of users. Our trace-driven study demonstrates that the proposed CN model is useful in (i) content recommendation for increasing sales and (ii) content caching for networking efficiency. We believe our work can provide an important insight for content stakeholders, e.g., content providers for efficient publishing strategies, network engineers for networking efficiency, or content marketers for accurate recommendation.

97 MATHEMATICS AND COMPUTING↗

A comprehensive academic and industrial survey of blockchain technology for the energy sector using fuzzy Einstein decision-making

The global energy sector is undergoing a significant transformation driven by decarbonization and digitalization, leading to the emergence of Distributed Ledger Technology (DLT) — particularly blockchain — as a promising tool for enhancing transparency, security, and efficiency in modern power systems. This study aims to provide a comprehensive academic and industrial survey of blockchain applications in the energy sector and develop a robust decision-making framework to identify and prioritize the most promising real-world use cases based on multidisciplinary criteria. A three-stage methodology was adopted: (i) a literature and market review encompassing over 300 academic publications and commercial blockchain initiatives in energy, (ii) an in-depth evaluation of the evolution and viability of blockchain initiatives in energy with the help of expert surveys, and (iii) a novel decision-making model using a q-rung orthopair fuzzy Multi-Attributive Border Approximation (q-ROF-MABAC) method under the Einstein operator. The results were compared with existing decision models to validate consistency and robustness. Nine key blockchain use case categories were identified and ranked based on technical, economic, and governance dimensions. The results demonstrated that integrating expert insights into a fuzzy logic framework helps filter out overhyped claims in the literature and prioritize realistic and high-impact applications such as green certificates, grid services, and peer-to-peer energy trading. The model’s rankings remained stable across varying weight configurations, confirming the robustness of the methodology. This study provides an evidence-based decision-support tool for researchers, industry stakeholders, and policymakers to better understand, evaluate, and adopt blockchain technologies in the energy sector.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Day-ahead continuous double auction-based peer-to-peer energy trading platform incorporating trading losses and network utilisation fee

Integration of distributed energy resources, such as photovoltaic solar (PV), introduces new opportunities to establish local energy market frameworks to improve renewable energy utilisation in residential sectors. Such peer-to-peer (P2P) energy trading refers to a local market structure where customers (and prosumers) interact to share excess PV generation to enhance the individual and community social welfare. In this work, a day-ahead continuous double auction (CDA)-based P2P market structure considering network losses and network utilisation fees was designed. Day-ahead PV energy is modelled using fractional integral polynomials and the output is forecasted using an autoregressive integrated moving average model for each market interval. Based on the customer load and excess PV energy, the CDA market is cleared using a bid/ask matching mechanism. The performance of the P2P market was evaluated by computing different welfare metrics while analysing the effect of network constraints. The results show that the designed CDA-based P2P market structure increases the social welfare of all participants by an average of 17.75% compared to the baseline for the presented cases. Moreover, the impact of the forecasting error between the day-ahead and real-time market was also quantified.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Analysis of peer-to-peer locking of magnetrons

The condition for mutual, or peer-to-peer, locking of two magnetrons is derived. This condition reduces to Adler's classical phase-locking condition in the limit where one magnetron becomes the 'master' and the other becomes the 'slave.' The formulation is extended to the peer-to-peer locking of N magnetrons, under the assumption that the electromagnetic coupling among the N magnetrons is modeled by an N-port network.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast, multi-channel real-time processing of signals with microsecond latency using graphics processing units

Fast, digital signal processing (DSP) has many applications. Typical hardware options for performing DSP are field-programmable gate arrays (FPGAs), application-specific integrated DSP chips, or general purpose personal computer systems. This paper presents a novel DSP platform that has been developed for feedback control on the HBT-EP tokamak device. The system runs all signal processing exclusively on a Graphics Processing Unit (GPU) to achieve real-time performance with latencies below 8 μs. Signals are transferred into and out of the GPU using PCI Express peer-to-peer direct-memory-access transfers without involvement of the central processing unit or host memory. Tests were performed on the feedback control system of the HBT-EP tokamak using forty 16-bit floating point inputs and outputs each and a sampling rate of up to 250 kHz. Signals were digitized by a D-TACQ ACQ196 module, processing done on an NVIDIA GTX 580 GPU programmed in CUDA, and analog output was generated by D-TACQ AO32CPCI modules.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Towards FAIR Workflows for Federated Experimental Sciences

A de-centralized, peer-to-peer AI metadata framework is demonstrated which can enable end-to-end metadata & lineage tracking for distributed Machine Learning pipelines spanning edge, High Performance Computing, and cloud environments. With a specific example of end-to-end microscopy algorithm and datasets, the proposed method shows how to enable reproducibility, audit trail, provenance of metadata artifacts. The emerging needs of automation in experimental sciences, ML-centric workflows, and FAIR metadata management across federated compute environments is addressed.

machine learning↗