Search

This paper introduces a new consensus protocol, so-called \emph{\stair}, for fast consensus in DAG-based trustless system. In \stair, we propose a new approach to creating local block DAG, namely \emph{x-DAG} (cross-DAG), on each node. \emph{\stair} protocol is based on our Proof-of-Stake StakeDag framework \cite{stakedag} that distinguishes participants into users and validators by their stake. Both users and validators can create and validate event blocks. Unlike StakeDag's DAG, x-DAG ensures that each new block has to have parent blocks from both Users and Validators to achieve more safety and liveness. Our protocol leverages a pool of validators to expose more validating power to new blocks for faster consensus in a leaderless asynchronous system. Further, our framework allows participants to join as observers / monitors, who can retrieve DAG for post-validation, but do not participate in onchain validation., Comment: arXiv admin note: substantial text overlap with arXiv:1907.03655

Low-frequency high voltage ac transmission scheme has recently been proposed as an alternative approach for bulk power transmission. This paper proposes a multi-period optimal power flow (OPF) for a multi-frequency HVac transmission system that interconnects both conventional 50/60-Hz and low-frequency grids using back-to-back converters with a centralized control scheme. The OPF objective is to minimize system losses by determining the optimal dispatch for generators, shunt capacitors, and converters. The OPF constraints include the operational constraints of all HVac grid and converter stations. The resulting mixed-integer nonlinear programing problem is solved using a proposed framework based on the predictor-corrector primal-dual interior-point method. The proposed OPF formulation and solution approach are verified using a multi-frequency HVac transmission system that is modified from the IEEE 57-bus system. The results with the optimal dispatch from the proposed method during a simulated day show a significant loss reduction and an improved voltage regulation compared to those when an arbitrary dispatch is chosen.

Trustless systems, such as those blockchain enpowered, provide trust in the system regardless of the trust of its participants, who may be honest or malicious. Proof-of-stake (PoS) protocols and DAG-based approaches have emerged as a better alternative than the proof of work (PoW) for consensus. This paper introduces a new model, so-called \emph{\stakedag}, which aims for PoS consensus in a DAG-based trustless system. We address a general model of trustless system in which participants are distinguished by their stake or trust: users and validators. Users are normal participants with a no assumed trust and validators are high profile participants with an established trust. We then propose a new family of stake-based consensus protocols $\mathfrak{S}$, operating on the DAG as in the Lachesis protocol~\cite{lachesis01}. Specifically, we propose a stake-based protocol $S_\phi$ that leverages participants' stake as validating weights to achieve more secure distributed systems with practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). We then present a general model of staking for asynchronous DAG-based distributed systems., Comment: arXiv admin note: text overlap with arXiv:1905.04867

This paper presents a new framework, namely \emph{\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_{\phi}$, which is based on the Lachesis protocol~\cite{lachesis01}. At the core of $L_{\phi}$ protocol, it introduces to use layering algorithm to achieve practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). Further, we present new online layering algorithms for the evolutionary DAGs across the nodes. Our new protocol achieves determistic scalable consensus in asynchronous pBFT by using assigned layers and asynchronous partially ordered sets with logical time ordering instead of blockchains. The partial ordering produced by $L_{\phi}$ is flexible but consistent across the distributed system of nodes. We then present the formal model of our layering-based consensus. The model is generalized that can be applied to abstract asynchronous DAG-based distributed systems., Comment: arXiv admin note: substantial text overlap with arXiv:1810.10360

We describe \emph{Fantom}, a framework for asynchronous distributed systems. \emph{Fantom} is based on the Lachesis Protocol~\cite{lachesis01}, which uses asynchronous event transmission for practical Byzantine fault tolerance (pBFT) to create a leaderless, scalable, asynchronous Directed Acyclic Graph (DAG). We further optimize the \emph{Lachesis Protocol} by introducing a permission-less network for dynamic participation. Root selection cost is further optimized by the introduction of an n-row flag table, as well as optimizing path selection by introducing domination relationships. We propose an alternative framework for distributed ledgers, based on asynchronous partially ordered sets with logical time ordering instead of blockchains. This paper builds upon the original proposed family of \emph{Lachesis-class} consensus protocols. We formalize our proofs into a model that can be applied to abstract asynchronous distributed system., Comment: arXiv admin note: substantial text overlap with arXiv:1810.02186

This paper introduces a new family of consensus protocols, namely \emph{Lachesis-class} denoted by $\mathcal{L}$, for distributed networks with guaranteed Byzantine fault tolerance. Each Lachesis protocol $L$ in $\mathcal{L}$ has complete asynchrony, is leaderless, has no round robin, no proof-of-work, and has eventual consensus. The core concept of our technology is the \emph{OPERA chain}, generated by the Lachesis protocol. In the most general form, each node in Lachesis has a set of $k$ neighbours of most preference. When receiving transactions a node creates and shares an event block with all neighbours. Each event block is signed by the hashes of the creating node and its $k$ peers. The OPERA chain of the event blocks is a Directed Acyclic Graph (DAG); it guarantees practical Byzantine fault tolerance (pBFT). Our framework is then presented using Lamport timestamps and concurrent common knowledge. Further, we present an example of Lachesis consensus protocol $L_0$ of our framework. Our $L_0$ protocol can reach consensus upon 2/3 of all participants' agreement to an event block without any additional communication overhead. $L_0$ protocol relies on a cost function to identify $k$ peers and to generate the DAG-based OPERA chain. By creating a binary flag table that stores connection information and share information between blocks, Lachesis achieves consensus in fewer steps than pBFT protocol for consensus.

We demonstrate that the amplitude shifts in fast two-pulse collisions in perturbed linear physical systems with weak nonlinear dissipation exhibit universal soliton-like behavior. The behavior is demonstrated for linear optical waveguides with weak cubic loss and for systems described by linear diffusion-advection models with weak quadratic loss. We show that in both systems, the expressions for the collision-induced amplitude shifts due to the nonlinear loss have the same form as the expression obtained for a fast collision between two solitons of the nonlinear Schr\"odinger equation in the presence of weak cubic loss. Furthermore, we show that the expressions for the amplitude shifts are universal in the sense that they are independent of the exact details of the initial pulse shapes. We demonstrate the universal soliton-like behavior of the collision-induced amplitude shifts by carrying out numerical simulations with the two perturbed coupled linear evolution models with three different initial conditions corresponding to pulses with exponentially decreasing tails, pulses with power-law decreasing tails, and pulses that are initially nonsmooth and that develop significant tails during the collision. In all six cases we observe very good agreement between the analytic predictions for the amplitude shifts and the results of the numerical simulations., Comment: 36 pages, 12 figures. arXiv admin note: text overlap with arXiv:1702.05583

We study the effects of the generic weak nonlinear loss on fast two-pulse interactions in linear waveguides. The colliding pulses are described by a system of coupled Schr\"odinger equations with a purely nonlinear coupling in the presence of the weak $(2m+1)-$order of nonlinear loss, for any $m \geq 1$. We derive the analytic expression for the collision-induced amplitude shift in a fast two-pulse interaction. The analytic calculations are based on a generalization of the perturbation technique for calculating the effects of weak perturbations on fast collisions between solitons of the nonlinear Schr\"odinger equation. The theoretical predictions are confirmed by the numerical simulations with the full propagation model of coupled Schr\"odinger equations., Comment: 15 pages, 3 figures

We develop the theoretical procedures for shifting the frequency of a single soliton and of a sequence of solitons of the nonlinear Schr\"odinger equation. The procedures are based on simple transformations of the soliton pattern in the Fourier domain and on the shape-preserving property of solitons. These theoretical frequency shifting procedures are verified by numerical simulations with the nonlinear Schr\"odinger equation using the split-step Fourier method. In order to demonstrate the use of the frequency shifting procedures, two important applications are presented: (1) stabilization of the propagation of solitons in waveguides with frequency dependent linear gain-loss; (2) induction of repeated soliton collisions in waveguides with weak cubic loss. The results of numerical simulations with the nonlinear Schr\"odinger model are in very good agreement with the theoretical predictions., Comment: 27 pages, 12 figures

Common quality metrics of graph drawing have been about the readability criteria, such as small number of edge crossings, small drawing area and small total edge length. Bold graph drawing considers more realistic drawings consisting of vertices as disks of some radius and edges as rectangles of some width. However, the relationship that links these readability criteria with the rendering criteria in node-link diagrams has still not been well-established. This paper introduces a model, so-called INKA (Ink-Active), that encapsulates mathematically the relationship between all common drawing factors. Consequently, we investigate our INKA model on several common drawing algorithms and real-world graphs.

The incredible growth of sensors and microcontroller units makes the task of real-time event monitoring in the Internet of Things (IoT) based applications easier and more practical. In order to effectively support the event management in IoT-based applications, we propose a framework that is based on the publish-subscribe model for detecting events from IoT sensor nodes and sending notifications to subscribers (end-users) via Internet, SMS, and Calling. With the exception of the advantages inherited from the publish-subscribe model, the further advantages of the proposed framework are the ease of use in terms of user configuration without any need of technical skills, the aid of security mechanisms to prevent network intrusion, and the minimum hardware resource requirement. Additionally, the proposed framework is applicable and adaptable to various platforms since it has been developed by using Boost C++ Libraries and CMake. To evaluate the proposed framework, we develop a prototype of a real-time event monitoring system that is also presented in this paper., Comment: 11th South East Asian Technical University Consortium (SEATUC) Symposium, Ho Chi Minh City, 2017