Improved Bounds for the Token Distribution Problem

Herley, Kieran T.

dc.contributor.author	Herley, Kieran T.	en_US
dc.date.accessioned	2007-04-23T17:39:26Z
dc.date.available	2007-04-23T17:39:26Z
dc.date.issued	1989-10	en_US
dc.identifier.citation	http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1051	en_US
dc.identifier.uri	https://hdl.handle.net/1813/6851
dc.description.abstract	The problem of packet routing on bounded degree networks is considered. An algorithm is presented that can route $n$ packets in $O$(log $n + K)$ time on a particular $n$-node expander-based network provided that no more than $K$ packets share the same source or destination.	en_US
dc.format.extent	585383 bytes
dc.format.extent	152235 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.language.iso	en_US	en_US
dc.publisher	Cornell University	en_US
dc.subject	computer science	en_US
dc.subject	technical report	en_US
dc.title	Improved Bounds for the Token Distribution Problem	en_US
dc.type	technical report	en_US