Erasure broadcast networks play a particularly important role in the study of wireless packet networks where transmitted packets are protected by some kind of channel code and where receivers may occasionally fail to decode a packet but are aware of such failures. This chapter studies bounds on the multicast capacity region of networks of independent erasure broadcast channels, in particular, the cut-set outer bound, which coincides with the multicast capacity region with side information, and the noisy network coding inner bound with independent erasure quantization across all broadcast channels. Contrary to general networks of independent broadcast channels, the cut-set outer bound and the noisy network coding inner bound restricted to independent erasure quantization are generated by a polymatroid broadcast rate region and a submodular cut rate region, respectively, even if the erasures are not independent across all receivers. The simplified noisy network coding inner bound with independent erasure quantization is representable by a penalized polymatroid broadcast rate region if independent erasures across all receivers are assumed for each broadcast channel. Finally, we study the gap between these bounds and provide algorithms to approximate and solve the weighted sum multicast rate maximization problem for these bounds.