Show simple item record

dc.contributor.authorHerley, Kieran T.en_US
dc.date.accessioned2007-04-23T17:39:26Z
dc.date.available2007-04-23T17:39:26Z
dc.date.issued1989-10en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1051en_US
dc.identifier.urihttps://hdl.handle.net/1813/6851
dc.description.abstractThe 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.extent585383 bytes
dc.format.extent152235 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleImproved Bounds for the Token Distribution Problemen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics