# Reference request on dynamic flows combined with network coding

I have read some papers about network coding and dynamic flows (flows over time).

I think I have made comprehensive searches on google, google scholar and IEEE Xplore. IMHO, the reasons for the difficulty in finding such references are that this topic is new and that there are not many people doing research on this topic.

As Kaveh's comment below, I am going to explain the problem with more detail. The original network coding theory addresses the maximum flow problem under the circumstances that every node in the network can combine the information it receives, which is the counterpart of the maximum flow problem in the network with coding ability.

The quickest flow (flows over time) addresses the problem how soon a/some commodity/commodities can be transship to some certain nodes, and this model is applicable in, for example, evacuation. Some reference for the flows over time are Quickest flows over time and Multicommodity flows over time.

The problem I am interested in is how to combine the coding ability, as in the network coding theory, to the quickest flow model. Once the network has coding ability, there maybe some promotion in the counterpart of the quickest flow.

• Maximum flow problem addresses the route of the maximum bandwidth in a network, yet dynamic flows (flows over time) address the route of the quickest arrival. Because the transition of a commodity is not instantaneous in the model of dynamic flows, which is the reason why it is called "dynamic", the value of maximum flow is a function over time $t$ when considering dynamic flows. cs.dartmouth.edu/~lkf/papers/FS2.pdf might be a good reference for dynamic flows. The motivation to combine dynamic flow with network coding is to optimize the delay not only the bandwidth. @kodlu – robit Mar 23 '16 at 7:10