PROJECT TITLE :

On Network Coding for Funnel Networks

ABSTRACT:

Network coding for non-multicast issues has been the subject of many recent studies. In this letter, we contemplate networks in that the entire capacity of the incoming links to every intermediate node isn't but the overall capability of its outgoing links. We tend to call these networks funnel networks and prove that any feasible non-multicast drawback on funnel networks is solvable by routing (hence, by linear network coding, too). The desirability of network coding in funnel networks may be justified by the opposite advantages that coding offers. However, we have a tendency to see that in funnel networks, the traditional random approach to linear coding fails with high probability. Hence, we tend to provide a replacement random linear network coding answer for these non-multicast issues.