This talk describes methods for calculating rate regions for multiple source multicast network coding and distributed storage systems based on pairing polyhedral projection with network constrained non-isomorphic representable matroid enumeration. Several idealized methods analytically capable of generating the regions are compared, and key complexity considerations, including the exploitation of symmetries and of network structure constraints, are identified. Finally, an efficient algorithm for generating inner and outer bounds for the capacity regions based on these complexity considerations is proposed and described.