Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms