“…For arbitrary bufferless networks, a recent result by Busch et al [21] shows that the packets can be delivered in time O((C + D) log 3 (n + N)). Here, we show that it is possible to improve this general result and obtain better delivery times for special network topologies such as trees and leveled networks, reducing the performance gap between bufferless and store-and-forward algorithms on these networks.…”