Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
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
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On-Line Routing in All-Optical Networks
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Finding effective support-tree preconditioners
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Improved bounds for the unsplittable flow problem
Journal of Algorithms
Minimizing average latency in oblivious routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimizing matrix transpose on torus interconnects
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Competitive routing in the half-θ6-graph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Oblivious low-congestion multicast routing in wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
| Hi-index | 0.00 |
We give a survey about recent advances in the design of oblivious routing algorithms. These routing algorithms choose their routing paths independent of the traffic in the network and they are therefore very well suited for distributed environments in which no central entitiy exist that could make routing decisions based on the whole traffic pattern in the network.