On network coding for acyclic networks with delays
Data(s) |
01/12/2011
|
---|---|
Resumo |
Problems related to network coding for acyclic, instantaneous networks (where the edges of the acyclic graph representing the network are assumed to have zero-delay) have been extensively dealt with in the recent past. The most prominent of these problems include (a) the existence of network codes that achieve maximum rate of transmission, (b) efficient network code constructions, and (c) field size issues. In practice, however, networks have transmission delays. In network coding theory, such networks with transmission delays are generally abstracted by assuming that their edges have integer delays. Using enough memory at the nodes of an acyclic network with integer delays can effectively simulate instantaneous behavior, which is probably why only acyclic instantaneous networks have been primarily focused on thus far. However, nulling the effect of the network delays are not always uniformly advantageous, as we will show in this work. Essentially, we elaborate on issues ((a), (b) and (c) above) related to network coding for acyclic networks with integer delays, and show that using the delay network as is (without adding memory) turns out to be advantageous, disadvantageous or immaterial, depending on the topology of the network and the problem considered i.e., (a), (b) or (c). |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/42860/1/On_network_coding.pdf Prasad, K and Rajan, Sundar B (2011) On network coding for acyclic networks with delays. In: 2011 IEEE Information Theory Workshop (ITW), 16-20 Oct. 2011, Paraty, Brazil. |
Publicador |
IEEE |
Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6089517 http://eprints.iisc.ernet.in/42860/ |
Palavras-Chave | #Electrical Communication Engineering |
Tipo |
Conference Paper NonPeerReviewed |