Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing paths they produce. This paper introduces a dynamic compact routing scheme that allows the distribution of traffic from any source to any set of leaf nodes along a point-to-multipoint routing path referred to as multicast (traffic) distribution tree. By means of the proposed scheme, a multicast distribution tree can dynamically evolve according to the arrival of leaf-initiated join/leave requests. We evaluate by means of simulation the performance of the proposed scheme and analyze the tradeoffs between the stretch of the produced routing paths, the size and the number of routing table entries, and the communication cost.