Sciweavers

15 search results - page 1 / 3
» Capacity of byzantine agreement with finite link capacity
Sort
View
INFOCOM
2011
IEEE
12 years 8 months ago
Capacity of byzantine agreement with finite link capacity
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
Guanfeng Liang, Nitin H. Vaidya
PODC
2010
ACM
13 years 7 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya
COMSNETS
2012
176views more  COMSNETS 2012»
12 years 23 days ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya
PODC
2012
ACM
11 years 7 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
INFOCOM
2007
IEEE
13 years 11 months ago
Resilient Network Coding in the Presence of Byzantine Adversaries
Abstract— Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a mali...
Sidharth Jaggi, Michael Langberg, Sachin Katti, Tr...