Network Information Flow for Multicast Communication Networks

In this work, we have studied information network flow problem on a single source multisink multicast communication network. We have tried to extend the idea of switching gap given by Liang at. al by analyzing a generic butterfly network under suitable assumptions about link capacities. From the results, we could conclude that information rate due to Network coding is coming out to be same in all versions of the network. We found out that application of game theory for network switching is not generic and requires certain conditions on link capacities. Moreover the problem for single source multicast flow appears to be a NP hard problem. We recommend focus should now be given on working towards a graph theoretic solution for this problem with some simplifications. Such a solution will not only give maximum possible network information rate for a generic single source multisink multicast network but in the process it would also give the optimum switching strategy for the network.