Главная

Guanfeng Liang

  1. Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs.

    Пнд, 01/23/2012 - 15:01 — SomNambul
    Authors: Guanfeng Liang, Nitin Vaidya, Lewis Tseng
    Subjects: and Cluster Computing, Distributed, Parallel
    Abstract

    In this paper, we explore the problem of iterative approximate Byzantine
    consensus in arbitrary directed graphs. In particular, we prove a necessary and
    sufficient condition for the existence of iterative byzantine consensus
    algorithms. Additionally, we use our sufficient condition to examine whether
    such algorithms exist for some specific graphs.

  2. Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links.

    Пнд, 04/04/2011 - 15:01 — SomNambul
    Authors: Guanfeng Liang, Nitin Vaidya
    Subjects: and Cluster Computing, Distributed, Parallel
    Abstract

    We consider the problem of maximizing the throughput of Byzantine consensus,
    when communication links have finite capacity. Byzantine consensus is a
    classical problem in distributed computing. In existing literature, the
    communication links are implicitly assumed to have infinite capacity. The
    problem changes significantly when the capacity of links is finite. We define
    the throughput and capacity of consensus, and identify upper bound of
    achievable consensus throughput.

  3. Deterministic Consensus Algorithm with Linear Per-Bit Complexity.

    Пт, 08/27/2010 - 15:02 — SomNambul
    Authors: Guanfeng Liang, Nitin Vaidya
    Subjects: and Cluster Computing, Distributed, Parallel
    Abstract

    In this report, building on the deterministic multi-valued one-to-many
    Byzantine agreement (broadcast) algorithm in our recent technical report [2],
    we introduce a deterministic multi-valued all-to-all Byzantine agreement
    algorithm (consensus), with linear complexity per bit agreed upon. The
    discussion in this note is not self-contained, and relies heavily on the
    material in [2] - please refer to [2] for the necessary background.

  4. Short Note on Complexity of Multi-Value Byzantine Agreement.

    Чт, 07/29/2010 - 15:01 — SomNambul
    Authors: Guanfeng Liang, Nitin Vaidya
    Subjects: and Cluster Computing, Distributed, Parallel
    Abstract

    Randomized algorithm that achieves multi-valued Byzantine agreement with high
    probability, and achieves optimal complexity.

  5. When Watchdog Meets Coding.

    Ср, 10/07/2009 - 12:26 — SomNambul
    Authors: Guanfeng Liang, Nitin Vaidya
    Subjects: Cryptography and Security
    Abstract

    In this work we study the problem of misbehavior detection in wireless
    networks. A commonly adopted approach is to utilize the broadcasting nature of
    the wireless medium and have nodes monitor their neighborhood. We call such
    nodes the Watchdogs. In this paper, we first show that even if a watchdog can
    overhear all packet transmissions of a flow, any linear operation of the
    overheard packets can not eliminate miss-detection and is inefficient in terms
    of bandwidth. We propose a light-weigh misbehavior detection scheme which
    integrates the idea of watchdogs and error detection coding.

  6. When Watchdog Meets Coding.

    Ср, 10/07/2009 - 12:26 — SomNambul
    Authors: Guanfeng Liang, Nitin Vaidya
    Subjects: Cryptography and Security
    Abstract

    In this work we study the problem of misbehavior detection in wireless
    networks. A commonly adopted approach is to utilize the broadcasting nature of
    the wireless medium and have nodes monitor their neighborhood. We call such
    nodes the Watchdogs. In this paper, we first show that even if a watchdog can
    overhear all packet transmissions of a flow, any linear operation of the
    overheard packets can not eliminate miss-detection and is inefficient in terms
    of bandwidth. We propose a light-weigh misbehavior detection scheme which
    integrates the idea of watchdogs and error detection coding.

Math-arch

RSS-материал