Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
1,390
5 Consensus and Reliable Broadcast
"... Consider a complete asynchronous network of n servers P = {P1,..., Pn}. Up to t servers may fail by silently crashing (and they do not recover). A server that never crashes is called correct. Every pair of servers is linked by a reliable point-to-point communication channel; this means that when a c ..."
Abstract
- Add to MetaCart
Consider a complete asynchronous network of n servers P = {P1,..., Pn}. Up to t servers may fail by silently crashing (and they do not recover). A server that never crashes is called correct. Every pair of servers is linked by a reliable point-to-point communication channel; this means that when a
Reliable Broadcast with Respect to Topology Knowledge
"... We study the Reliable Broadcast problem in incomplete networks against a Byzantine adver-sary. We examine the problem under the locally bounded adversary model of Koo (2004) and the general adversary model of Hirt and Maurer (1997) and explore the tradeoff between the level of topology knowledge and ..."
Abstract
- Add to MetaCart
We study the Reliable Broadcast problem in incomplete networks against a Byzantine adver-sary. We examine the problem under the locally bounded adversary model of Koo (2004) and the general adversary model of Hirt and Maurer (1997) and explore the tradeoff between the level of topology knowledge
Reliable Broadcast and Multicast in context of partitioning
"... We present two protocols, a distributed reliable broadcast and a distributed reliable multicast; these protocols are resistant to network partitions in asynchronous distributed systems. They are reliable in the sense that the receiver will eventually receive the message even if the receiver was part ..."
Abstract
- Add to MetaCart
We present two protocols, a distributed reliable broadcast and a distributed reliable multicast; these protocols are resistant to network partitions in asynchronous distributed systems. They are reliable in the sense that the receiver will eventually receive the message even if the receiver
Ruminations on Domain-Based Reliable Broadcast
"... A distributed system is no longer confined to a single administrative domain. Peer-to-peer applications and business-to-business e-commerce systems, for example, typically span multiple local-area and wide-area networks, raising issues of trust, security, and anonymity. This paper introduces a di ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
and proofs. We show how Reliable Broadcast can be implemented in our domain-based model, we analyze the cost of communicating across groups, and we establish lower-bounds on the number of cross-domain messages necessary to implement Reliable Broadcast.
With Finite Memory Consensus is Easier Than Reliable Broadcast
, 2008
"... We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than reliabl ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus and reliable broadcast. With finite process memory, we show that in some sense consensus is easier to solve than
Reliable Broadcast in ZigBee Networks
, 2005
"... Due to scarce resources, such as transmission power, storage space and communication bandwidth, current broadcast approaches for general ad hoc networks can not be applied to IEEE 802.15.4 based ad hoc networks (e.g., ZigBee networks). This paper proposes a forward node selection algorithm that sign ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
Due to scarce resources, such as transmission power, storage space and communication bandwidth, current broadcast approaches for general ad hoc networks can not be applied to IEEE 802.15.4 based ad hoc networks (e.g., ZigBee networks). This paper proposes a forward node selection algorithm
An Efficient Reliable Broadcasting Protocol for Ad Hoc Networks
- In Proc. of IASTED NPDPA’02
, 2002
"... Reliable broadcast is an important operation in mobile ad hoc networks (MANETs) (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion, to wh ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Reliable broadcast is an important operation in mobile ad hoc networks (MANETs) (e.g., giving orders, searching routes, and notifying important signals). However, using a naive flooding to achieve reliable broadcasting may be very costly, causing a lot of contention, collision, and congestion
Reliable Broadcasting in Double Loop Networks ∗
, 2004
"... Broadcast is the fundamental collective communication routine in which the same message is delivered from a single source to all the nodes in a network. The most efficient way to implement broadcast is through the construction of a broadcast tree. We introduce a revised definition of optimality for ..."
Abstract
- Add to MetaCart
Broadcast is the fundamental collective communication routine in which the same message is delivered from a single source to all the nodes in a network. The most efficient way to implement broadcast is through the construction of a broadcast tree. We introduce a revised definition of optimality
On reliable broadcast in a radio network
- in PODC ’05: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
, 2005
"... We study the problem of achieving global broadcast in a radio network where a node can multicast messages to all of its neighbors (that is, nodes within some given distance r), and up to t nodes in any single neighborhood may be corrupted. Previous work assumes that corrupted nodes can neither cause ..."
Abstract
- Add to MetaCart
We study the problem of achieving global broadcast in a radio network where a node can multicast messages to all of its neighbors (that is, nodes within some given distance r), and up to t nodes in any single neighborhood may be corrupted. Previous work assumes that corrupted nodes can neither
Results 11 - 20
of
1,390
