Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Routing Permutations on Graphs Via Matchings
SIAM Journal on Discrete Mathematics
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
Randomized algorithms
Information Processing Letters
On Bufferless Routing of Variable Length Messages in Leveled Networks
IEEE Transactions on Computers
Constant time per edge is optimal on rooted tree networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized single-target hot-potato routing
Journal of Algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Many-to-many routing on trees via matchings
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
Optical networks: a practical perspective
Optical networks: a practical perspective
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Shortest-path routing in arbitrary networks
Journal of Algorithms
Optimal bounds for matching routing on trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Locally efficient on-line strategies for routing packets along fixed paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth 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
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Distributed System Design
Õ(congestion + dilation) hot-potato routing on leveled networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Bounds on Maximum Delay in Networks with Deflection Routing
IEEE Transactions on Parallel and Distributed Systems
Hot-Potato Algorithms for Permutation Routing
IEEE Transactions on Parallel and Distributed Systems
Deterministic Many-to-Many Hot Potato Routing
IEEE Transactions on Parallel and Distributed Systems
Fast Deterministic Hot-Potato Routing on Processor Arrays
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Bounds on evacuation time for deflection routing
Distributed Computing
Direct routing: Algorithms and complexity
Algorithmica
Exact analysis of hot-potato routing
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
In bufferless networks the packets cannot be buffered while they are in transit; thus, once injected, the packets have to move constantly. Bufferless networks are interesting because they model optical networks. The objective of this work is to demonstrate that efficient bufferless packet switching is achievable in particular, interesting network topologies. We consider the tree and leveled network topologies, which represent a wide class of network configurations. On these networks, we study many-to-one batch problems where each node is the source of at most one packet, and the destination of an arbitrary number of packets. Each packet is to follow a preselected path from the source to the destination. Let T^* be the optimal delivery time for the packets. We have the following results:*For trees, we present two bufferless algorithms: (i) a deterministic algorithm with delivery time O(@d.T^*.logn),and (ii) a randomized algorithm with delivery time O(T^*.log^2n);where, @d is the maximum node degree, andn is the number of nodes. Both algorithms are distributed in the sense that packet forwarding decisionsare made locally at the nodes. *For leveled networks, we present two algorithms: (i) a centralized algorithm with delivery time O(T^*.logn),and (ii) a distributed algorithm with delivery timeO(T^*.log^2n),where n is the number of nodes. The first algorithm is centralized in the sense that all decisions are madeby a single node. The distributed algorithm simulates the centralized one; the cost of this simulation isan extra logarithmic factor. Our bufferless algorithms are near-optimal, and they improve on previous results for trees and leveled networks by multiple logarithmic factors.