The connection machine
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Bounds on the greedy routing algorithm for array networks
Journal of Computer and System Sciences
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Elements of network protocol design
Elements of network protocol design
From static to dynamic routing: efficient transformations of store-and-forward protocols
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy dynamic routing on arrays
Journal of Algorithms - Special issue on SODA '95 papers
Randomized greedy hot-potato routing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Hot-potato routing on processor arrays
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Deterministic Many-to-Many Hot Potato Routing
IEEE Transactions on Parallel and Distributed Systems
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
A case for bufferless routing in on-chip networks
Proceedings of the 36th annual international symposium on Computer architecture
Research challenges in QoS routing
Computer Communications
Evaluating Bufferless Flow Control for On-chip Networks
NOCS '10 Proceedings of the 2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip
A practical test scheduling using network-based TAM in network on chip architecture
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
| Hi-index | 0.00 |
We present the first dynamic hot-potato routing algorithm that does not require any form of explicit flow control: a node may inject a message into the network (n × n mesh) whenever a link is free. In the worst case, a node may have to wait an expected &Ogr;(n) time before it has a free link. If destinations are chosen uniformly at random, this algorithm guarantees delivery in an expected &Ogr;(n) time steps. Both measures are optimal up to a constant factor.