In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori con guration decisions such as core selection. The protocol is resource-e cient, robust, exible, and scalable. In addition, our protocol is provably loop-free. Our protocol starts with a resources-saving tree Shared Tree and individual receivers switch to a QoS-competitive tree Source-Based Tree when necessary. In both trees, the new destination is able to choose the most promising among several paths. An innovation is that we use dynamic routing information without relying on a link state exchange protocol to provide it. Our protocol limits the e ect of precon guration decisions drastically, by separating the management from the data transfer functions; administrative routers are not necessarily part of the tree. This separation increases the robustness, and exibility of the protocol. Furthermore, QoSMIC is able to adapt dynamica...