JavaScript is disabled for your browser. Some features of this site may not work without it.
Improved Bounds for the Token Distribution Problem

Author
Herley, Kieran T.
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.
Date Issued
1989-10Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1051
Type
technical report