Universal Bufferless Routing

Efficient bufferless packet switching on trees and leveled networks

“…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.…”

“…A recent result in [21] shows that it is possible to obtain a general bufferless packet switching algorithm for arbitrary networks with delivery time O ((C+D) log 3 (n+N)). However, that result does not take advantage of the special structure of leveled networks, which allows us to obtain a smaller delivery time, by one or two logarithmic factors.…”