Efficient Exchange of Metadata Information in Geo-Distributed Fog Systems

Metadata information is crucial for efficient geo-distributed fog computing systems. Many existing solutions for metadata exchange overlook geo-awareness or lack adequate failure tolerance, which are vital in such systems. To address this, we propose HFCS, a novel hybrid communication system that combines hierarchical and peer-to-peer elements, along with edge pools. HFCS utilizes a gossip protocol for dynamic metadata exchange. In simulation, we investigate the impact of node density and edge pool size on HFCS performance. We observe a significant performance improvement for clustered node distributions, aligning well with real-world scenarios. Additionally, we compare HFCS with a hierarchical system and a peer-to-peer broadcast approach. HFCS outperforms both in task fulfillment at the cost of an average 16\% detected failures due to its peer-to-peer structures

Consensus-based approach to peer-to-peer electricity markets with product differentiation

With the sustained deployment of distributed generation capacities and the more proactive role of consumers, power systems and their operation are drifting away from a conventional top-down hierarchical structure. Electricity market structures, however, have not yet embraced that evolution. Respecting the high-dimensional, distributed and dynamic nature of modern power systems would translate to designing peer-to-peer markets or, at least, to using such an underlying decentralized structure to enable a bottom-up approach to future electricity markets. A peer-to-peer market structure based on a Multi-Bilateral Economic Dispatch (MBED) formulation is introduced, allowing for multi-bilateral trading with product differentiation, for instance based on consumer preferences. A Relaxed Consensus+Innovation (RCI) approach is described to solve the MBED in fully decentralized manner. A set of realistic case studies and their analysis allow us showing that such peer-to-peer market structures can effectively yield market outcomes that are different from centralized market structures and optimal in terms of respecting consumers preferences while maximizing social welfare. Additionally, the RCI solving approach allows for a fully decentralized market clearing which converges with a negligible optimality gap, with a limited amount of information being shared.Comment: Accepted for publication in IEEE Transactions on Power System

Structured P2P Technologies for Distributed Command and Control

The utility of Peer-to-Peer (P2P) systems extends far beyond traditional file sharing. This paper provides an overview of how P2P systems are capable of providing robust command and control for Distributed Multi-Agent Systems (DMASs). Specifically, this article presents the evolution of P2P architectures to date by discussing supporting technologies and applicability of each generation of P2P systems. It provides a detailed survey of fundamental design approaches found in modern large-scale P2P systems highlighting design considerations for building and deploying scalable P2P applications. The survey includes unstructured P2P systems, content retrieval systems, communications structured P2P systems, flat structured P2P systems and finally Hierarchical Peer-to-Peer (HP2P) overlays. It concludes with a presentation of design tradeoffs and opportunities for future research into P2P overlay systems

A Peer-to-Peer Agent Auction

In this work we examine a peer-to-peer agent continuous double auction. We compare agents trading using peer-to-peer communications with agents using the same trading strategy in an auction that makes use of a centralized auctioneer to disseminate information. We present simulation data for these two auctions running with 2,500 to 160,000 agents. We find that the peer-to-peer auction is able to display price convergence behavior similar to that of the centralized auction. Further, the data shows that the peer-to-peer system has a constant cost in the number of message rounds needed to find the market equilibrium price as the number of traders is increased, in contrast to the linear cost incurred by the central auctioneer. Considering the above message costs, the peer-to-peer system outperformed the simple central auction by at least 100 times in our simulations. We further calculate that for a distributed hierarchical set of auctioneers, for which the message rounds cost of finding equilibrium are reduced to logarithmic in the number of traders, the peer-to-peer system will still produce better performance for systems with more than 5,000 traders

RC-Chord: Resource Clustering in a Large-Scale Hierarchical Peer-to-Peer System

Conducting data fusion and Command and Control (C2) in large-scale systems requires more than the presently available Peer-to-Peer (P2P) technologies provide. Resource Clustered Chord (RC-Chord) is an extension to the Chord protocol that incorporates elements of a hierarchical peer-to-peer architecture to facilitate coalition formation algorithms in large-scale systems. Each cluster in this hierarchy represents a particular resource available for allocation, and RC-Chord provides the capabilities to locate agents of a particular resource. This approach improves upon other strategies by including support for abundant resources, or those resources that most or all agents in the system possess. This scenario exists in large-scale coalition formation problems, and applies directly to the United States Air Force\u27s CyberCraft project. Simulations demonstrate that RC-Chord scales to systems of one million or more agents, and can be adapted to serve as a deployment environment for CyberCraft

TrusNet: Peer-to-Peer Cryptographic Authentication

Originally, the Internet was meant as a general purpose communication protocol, transferring primarily text documents between interested parties. Over time, documents expanded to include pictures, videos and even web pages. Increasingly, the Internet is being used to transfer a new kind of data which it was never designed for. In most ways, this new data type fits in naturally to the Internet, taking advantage of the near limit-less expanse of the protocol. Hardware protocols, unlike previous data types, provide a unique set security problem. Much like financial data, hardware protocols extended across the Internet must be protected with authentication. Currently, systems which do authenticate do so through a central server, utilizing a similar authentication model to the HTTPS protocol. This hierarchical model is often at odds with the needs of hardware protocols, particularly in ad-hoc networks where peer-to-peer communication is prioritized over a hierarchical model. Our project attempts to implement a peer-to-peer cryptographic authentication protocol to be used to protect hardware protocols extending over the Internet. The TrusNet project uses public-key cryptography to authenticate nodes on a distributed network, with each node locally managing a record of the public keys of nodes which it has encountered. These keys are used to secure data transmission between nodes and to authenticate the identities of nodes. TrusNet is designed to be used on multiple different types of network interfaces, but currently only has explicit hooks for Internet Protocol connections. As of June 2016, TrusNet has successfully achieved a basic authentication and communication protocol on Windows 7, OSX, Linux 14 and the Intel Edison. TrusNet uses RC-4 as its stream cipher and RSA as its public-key algorithm, although both of these are easily configurable. Along with the library, TrusNet also enables the building of a unit testing suite, a simple UI application designed to visualize the basics of the system and a build with hooks into the I/O pins of the Intel Edison allowing for a basic demonstration of the system