On network coding for acyclic networks with delays

Details On network coding for acyclic networks with delays On network coding for acyclic networks with delays

2011-02-09

arxiv.org/abs/1102.1782v2

Computer Science

Information Theory

Scientific paper

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). In the process, we also show that for a single source multicast problem in acyclic networks (instantaneous and with delays), the network coding operations at each node can simply be limited to storing old symbols and coding them over a binary field. Therefore, operations over elements of larger fields are unnecessary in the network, the trade-off being that enough memory exists at the nodes and at the sinks, and that the sinks have more processing power.

Affiliated with

Also associated with

No associations

Rating

On network coding for acyclic networks with delays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On network coding for acyclic networks with delays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On network coding for acyclic networks with delays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-649917