Mixing times and ℓp bounds for Oblivious routing

11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009

Volumn , Issue , 2009, Pages 240-248

  Lawler, Gregory ^a   Narayanan, Hariharan ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FLOW GRAPHS; HARMONIC ANALYSIS; HARMONIC FUNCTIONS; MIXING; RANDOM PROCESSES;

ADAPTIVE ROUTING; CANONICAL BASIS; COMPETITIVE RATIO; ELECTRICAL FLOWS; OBLIVIOUS ALGORITHMS; OBLIVIOUS ROUTING; PERFORMANCE INDICES; UNDIRECTED GRAPH;

COMBINATORIAL MATHEMATICS;

EID: 84959868738     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. B. AWERBUCH, Y. AZAR, E. F. GROVE, M.-Y. KAO, P. KRISHNAN, AND J. S. VITTER, Load balancing in the Lp norm., in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science (FOCS), 1995, pp. 383-391.
2. Y. BARTAL AND S. LEONARDI, On-line routing in all optimal networks, Theoretical Computer Science, 1997.
3. P. DIACONIS AND D. STROOCK, Geometric bounds for eigenvalues of Markov Chains, Annals of Applied Probability, 1, (1991).
4. P. G. DOYLE AND J. L. SNELL, Random Walks and Electric Networks, Mathematical Association of America, 1984.
5. C. HARRELSON, K. HILDRUM, AND S. B. RAO, A polynomial-time tree decomposition to minimize congestion, in Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003, pp. 34-43.
6. M. HAJIAGHAYI, R. KLEINBERG, T. LEIGHTON, AND H. RÄCKE New lower bounds for oblivious routing in undirected graphs In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 918-927.
7. P. HARSHA, T. HAYES, H. NARAYANAN, H. RÄCKE, AND J. RADHAKRISHNAN, Minimizing average latency in Oblivious routing, (SODA), 2008.
8. G. LAWLER Intersections of Random Walks Birkhäuser, 1991.
9. B.S. MITYAGIN An interpolation theorem for modular spaces, Mat. Sb. (N.S.) 66 (108) 1965 473-482
10. B. MORRIS AND A. SINCLAIR, Random Walks on Truncated Cubes and Sampling 0-1 knapsack solutions. SIAM journal on computing 34 (2004), pp. 195-226
11. H. RÄCKE, Minimizing congestion in general networks, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), 2002, pp. 43-52.
12. H. RÄCKE, Optimal Hierarchical Decompositions for Congestion Minimization in Networks. In Proc. of the 40th STOC, 2008.
13. M. RIESZ, Sur les maxima des formes bilinéaires et sur les fonctionelles linéaires. Acta Math. 49, 465-497 (1926).
14. T. ROUGHGARDEN AND É. TARDOS, HOW bad is selfish routing?, Journal of the ACM, 49 (2002), pp. 236-259.
15. A. SINCLAIR Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow. Combinatorics, Probability and Computing 1 (1992), pp. 351-370
16. G. O. THORIN, Convexity theorems generalizing those of M. Riesz and Hadamard with some applications. Comm. Sem. Math. Univ. Lund = Medd. Lunds Univ. Sem. 9, 1-58 (1948).
17. P. TETALI, Random walks and the effective resistance of networks Journal of Theoretical Probability. Volume 4, Number 1, January, 1991
18. L. G. VALIANT AND G. J. BREBNER, Universal schemes for parallel communication, in Proceedings of the 13th ACM Symposium on Theory of Computing (STOC), 1981, pp. 263-277.