Related papers: Network Coding for Delay Tolerant Networks with By…

This paper has been withdrawn by the author.

This paper has been withdrawn by the authors.

This paper has been withdrawn.

This paper has been withdrawn by the author.

This paper has been withdrawn by the author

In a recent paper, Jaggi et al. (INFOCOM 2007), presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults. We revisit their adversarial models and augment them with three,…

This paper has been withdrawn by the authors.

This paper was withdrawn by the authors.

This article has been withdrawn.

This paper has been retracted.

This paper has been withdrawn by the authors due to the fact that the webs considered in the paper are ``Veronese-like webs'' which are different from Veronese webs.

This paper has been withdrawn by the authors as they feel it inappropriate to publish this paper for the time being.

This paper has been withdrawn by the author as a major revision is made and a new version is uploaded at arXiv:0812.3120

This paper has been withdrawn by the authors

In this paper, we propose a zeroth-order resilient distributed online algorithm for networks under Byzantine edge attacks. We assume that both the edges attacked by Byzantine adversaries and the objective function are time-varying.…

This paper has been withdrawn by the authors.

This paper has been withdrawn by the author to comply with the journal policy to which it has been submitted.

This paper has been withdrawn by the author

We propose a novel relaxation of the classic asynchronous network model, called the random asynchronous model, which removes adversarial message scheduling while preserving unbounded message delays and Byzantine faults. Instead of an…

This paper has been withdrawn by the authors, due a oversimplified decoherence model. It will be substituted by a new work.