14 search results - page 2 / 3 » New Bounds for Oblivious Mesh Routing |
ANCS
2009
ACM
13 years 2 months ago
2009
ACM
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
TPDS
1998
13 years 4 months ago
1998
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
SPAA
1999
ACM
13 years 9 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...