Browsing by Subject "Poly-logarithmic factors"
Now showing items 1-3 of 3
-
Article
Near-optimal hot-potato routing on trees
(2004)In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems ...
-
Article
Universal bufferless packet switching
(2007)A packet-switching algorithm specifies the actions of the nodes in order to deliver packets in the network. A packet-switching algorithm is universal if it applies to any network topology and for any batch communication ...
-
Conference Object
Universal bufferless routing
(2005)Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...