Achievable Flows on Orthogonal Information Networks
We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access interference at every node. The second network is the Gaussian broadcast network with no interference. The nodes in this network broadcast, but the signals from the different transmitter nodes do not interfere at any receiver node. Such models can be motivated by communication schemes which use non overlapping time/frequency slots and which selectively ignore the effect of interference. Inner bounds to the capacity region for both classes of networks are obtained using modified max-flow theorems.