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
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
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
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th 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
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Lower bounds for graph embeddings and combinatorial preconditioners
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
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
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed online call control on general networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding effective support-tree preconditioners
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Traffic engineering of management flows by link augmentations on confluent trees
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
New lower bounds for oblivious routing in undirected graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Semi-oblivious routing: lower bounds
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Atomic routing games on maximum congestion
Theoretical Computer Science
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
ACM Transactions on Algorithms (TALG)
Routing with load balancing: increasing the guaranteed node traffics
IEEE Communications Letters
Oblivious routing in fat-tree based system area networks with uncertain traffic demands
IEEE/ACM Transactions on Networking (TON)
Optimal capacity allocation for load balanced shortest path routing
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
Fine two-phase routing over shortest paths with traffic matrix
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extracting hierarchies with overlapping structure from network data
Proceedings of the Winter Simulation Conference
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
Hi-index | 0.00 |
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a scheme consists of probability distributions over s-t paths for every source-target pair s,t in the network.In a recent result [11] it was shown that for any undirected network there is an oblivious routing scheme that achieves a polylogarithmic competitive ratio with respect to congestion. Subsequently, Azar et al. [4] gave a polynomial time algorithm that for a given network constructs the best oblivious routing scheme, i.e. the scheme that guarantees the best possible competitive ratio. Unfortunately, the latter result is based on the Ellipsoid algorithm; hence it is unpractical for large networks.In this paper we present a combinatorial algorithm for constructing an oblivious routing scheme that guarantees a competitive ratio of O(log4n) for undirected networks. Furthermore, our approach yields a proof for the existence of an oblivious routing scheme with competitive ratio O(log3n), which is much simpler than the original proof from [11].