Compact routing messages in self-healing trees

Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver t has not been deleted, with only an additional O(ylog⁡Δ) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet is removed from the network. CompactFTZ uses only O(log⁡n) bits memory for local fields (such as routing tables) and O(log2⁡n) bits for the routing labels, thus requiring O(log2⁡n) bits overall.