Sciweavers

2655 search results - page 68 / 531
» LT Network Codes
Sort
View
DSN
2007
IEEE
15 years 3 months ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
Jay J. Wylie, Ram Swaminathan
TIT
2011
149views more  TIT 2011»
14 years 6 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
NETWORKS
2008
14 years 12 months ago
Grooming for two-period optical networks
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
ICDCS
2006
IEEE
15 years 6 months ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 12 hour ago
Probabilistic performance of state estimation across a lossy network
We consider a discrete time state estimation problem over a packet-based network. In each discrete time step, a measurement packet is sent across a lossy network to an estimator u...
Michael Epstein, Ling Shi, Abhishek Tiwari, Richar...