Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of network security algorithms and system infrastructures, we will propose a dynamic broadcast routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols...

We describe two families of asynchronous atomic broadcast protocols that provide good delivery and stability times, use a small number of messages to accomplish a broadcast, distribute the load of ordering messages evenly among group members, use efficient flow-control techniques, and provide gracefully degraded performance in the presence of communication failures. The pinwheel protocols are d...

We define and describe a model for coordination of distributed processes or components based on associative broadcast. Associative broadcast encapsulates processes with an associative interface. The associative interface includes a profile, which specifies the current state of the component. Each message is sent with a conditional expression (selector), which evaluates to true for specific inst...

In broadcast environments, the limited bandwidth of the upstream communication channel from the mobile clients to the server bars the application of conventional concurrency control protocols. In this paper, we propose a new variant of the optimistic concurrency control (OCC) protocol that is suitable for broadcast environments. At the server, forward validation of a transaction is done against...

This paper proposes a stack of three Byzantine-resistant protocols aimed to be used in practical distributed systems: multi-valued consensus, vector consensus and atomic broadcast. These protocols are designed as successive transformations from one to another. The first protocol, multi-valued consensus, is implemented on top of a randomized binary consensus and a reliable broadcast protocol. Th...

In the recent past composability has emerged as a key requirement for various distributed protocols. It is not enough for a protocol to be robust when it runs in isolation or in a “stand-alone” setting but it should be robust even in an environment where several copies of the same protocol or other protocol(s) are running simultaneously. In this work, we investigate the composability for protoc...

A connected dominating set (CDS) has been proposed as a virtual backbone for routing in wireless ad hoc networks. Ad hoc networks offer new routing paradigms. Therefore, the routing operation needs a broadcast algorithm. Broadcasting in an ad hoc network is still an open issue. The main focus here will be on optimizing the energy and the bandwidth utilization for packet diffusion. In this paper...

Atomic Broadcast is a fundamental problem of distributed systems: it states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A Consensus-based solution to Atomic Broadcast problem has been designed by Chandra and Toueg for asynchronous di...

Formal reasoning on Peer-to-Peer (P2P) systems is an intimidating task. This paper focuses on broadcast algorithms for Content Addressable Network (CAN). Since these algorithms run on top of complex P2P systems, finding the right level of abstraction in order to prove their functional correctness is difficult. This paper presents a mechanized model for both CAN and broadcast protocols over thos...

Many protocols exist to support the maintenance of consistency of data in fault-tolerant distributed systems ; these protocols are quite expensive and thus have not been widely adopted. The Totem protocol supports consistent concurrent operations by placing a total order on broadcast messages. This total order is achieved by including a sequence number in a token circulated around a logical rin...