Results 1  10
of
212
SnapStabilizing Linear Message Forwarding
 in "12th International Symposium Stabilization, Safety, and Security of Distributed Systems (SSS
"... ar ..."
SnapStabilizing Message Forwarding algorithm on tree topologies ⋆
, 2011
"... Abstract. In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the num ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper, we propose a snapstabilizing algorithm for the message forwarding problem that uses the same complexity on the number of buffers as [1] and works on tree topologies.
Two snapstabilizing pointtopoint communication protocols in messageswitched networks
, 905
"... A snapstabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snapstabilizing protocol to solve the message forwarding problem in a messageswitched network. In this problem, we must manage resources of the system to deliver ..."
Abstract
 Add to MetaCart
A snapstabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snapstabilizing protocol to solve the message forwarding problem in a messageswitched network. In this problem, we must manage resources of the system
Linear Forwarders
, 2007
"... A linear forwarder is a process that receives one message on a channel and sends it on a different channel. We use linear forwarders to provide a distributed implementation of Milner’s asynchronous pi calculus. Such a distributed implementation is known to be difficult due to input capability, where ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
A linear forwarder is a process that receives one message on a channel and sends it on a different channel. We use linear forwarders to provide a distributed implementation of Milner’s asynchronous pi calculus. Such a distributed implementation is known to be difficult due to input capability
The flow deviation method: an approach to storeandforward communication network design
 NETWORKS
, 1973
"... Two problems relevant to the design of a storeandforward communication network ( the message routing problem and the channeZ capacity assignment problem) are formulated and are recognized t o be essentiaZ Zy non Zinear, uncoMnA;tcained muZticomodity (m. c. 1 fZm problems. A " F Z m Deviati ..."
Abstract

Cited by 109 (2 self)
 Add to MetaCart
Two problems relevant to the design of a storeandforward communication network ( the message routing problem and the channeZ capacity assignment problem) are formulated and are recognized t o be essentiaZ Zy non Zinear, uncoMnA;tcained muZticomodity (m. c. 1 fZm problems. A " F Z m
Abstract Linear Forwarders
"... A linear forwarder is a process that receives one message on a channel and sends it on a different channel. We use linear forwarders to provide a distributed implementation of Milner’s asynchronous pi calculus. Such a distributed implementation is known to be difficult due to input capability, where ..."
Abstract
 Add to MetaCart
A linear forwarder is a process that receives one message on a channel and sends it on a different channel. We use linear forwarders to provide a distributed implementation of Milner’s asynchronous pi calculus. Such a distributed implementation is known to be difficult due to input capability
Algebraic gossip: A network coding approach to optimal multiple rumor mongering
 IEEE Transactions on Information Theory
, 2004
"... We study the problem of simultaneously disseminating multiple messages in a large network in a decentralized and distributed manner. We consider a network with n nodes and k (k = O(n)) messages spread throughout the network to start with, but not all nodes have all the messages. Our communication mo ..."
Abstract

Cited by 134 (12 self)
 Add to MetaCart
be transmitted. The goal is to disseminate rapidly all the messages among all the nodes. We study the time required for this dissemination to occur with high probability, and also in expectation. We present a protocol based on random linear coding (RLC) that disseminates all the messages among all the nodes in O
Successive ComputeandForward
"... Abstract—In prior work, we proposed the computeandforward framework for sending linear combinations of messages to relays. In this note, we extend the notion of successive interference cancellation to the computeandforward setting. We find that once a relay has decoded a linear combination, it ca ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
Abstract—In prior work, we proposed the computeandforward framework for sending linear combinations of messages to relays. In this note, we extend the notion of successive interference cancellation to the computeandforward setting. We find that once a relay has decoded a linear combination
LowComplexity LFSR Synchronization by ForwardOnly Message Passing
 SUBMITTED TO IEEE TRANS. ON INFORMATION THEORY
, 2003
"... Gershenfeld and Grinstein showed that a modulated linearfeedback shiftregister (LFSR) sequence can be synchronized by feeding the modulated sequence into an analog version of the LFSR. In this paper, a similar algorithm for synchronizing a LFSR sequence disturbed by additive white Gaussian noise is ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
is derived as forwardonly message passing through the corresponding factor graph.
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
to guess which hybrid game the simulator has been playing. To conclude, the simulator forwards γ as its own answer in the DecisionLinear game. By the simulation setup the advantage of the simulator will be exactly that of the adversary. Lemma 3 (anonymity, part 2). Under the (t, )Decision linear
Results 1  10
of
212