Competitive source routing on tori and meshes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 82-91

  Yeh, Tzuoo Hawn ^a   Kuo, Cheng Ming ^a   Lei, Chin Laung ^a   Yen, Hsu Chun ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPETITIVE ANALYSIS; COMPETITIVE RATIO; MAXIMUM LOAD; PERFORMANCE OF ALGORITHM; ROUTING DECISIONS; SOURCE NODES; SOURCE ROUTING; SYSTEM LOADS;

ALGORITHMS;

EID: 84958060986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_10     Document Type: Conference Paper

References (21)

1. N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In 33rd FOCS, pages 334-343, 1992.
2. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 3th FOCS, pages 32-40, 1993.
3. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In 25th STOC, pages 164-173, 1993.
4. B. Awerbuch, Y. Bartal, A. Fiat, and A. Ros~n. Competitive non-preemptive call control. In 5th SODA, pages 312-320, 1994.
5. th FOCS, pages 412-423, 1994.
6. B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In 24th STOC, pages 517-580, 1992.
7. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In 2th STOC, pages 39-50, 1992.
8. Y. Bartal and A. Rosén. The distributed k-server problem - a competitive distributed translator for k-server algorithms. In 33rd FOCS, pages 344-353, 1992.
9. A. Borodin, P. Raghavan, B. Schieber, and E. Upfal. How much can hardware help routing. In 25th STOC, pages 573-582, 1993.
10. S. Irani, N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. In 2nd SODA, pages 251-260, 1991.
11. C. Kaklamanis, D. Krizanc, and T. Tsantilas. Tight bounds for oblivious routing in the hypercube. In 2rid SPAA, pages 31-36, 1990.
12. E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. In 25th STOC, pages 507-511, 1994.
13. M. Kunde. Packet routing on grids of processors. Algorithmica, 9(1):32-46, 1993.
14. nd SPAA, pages 2-10, 1990.
15. T. Leighton, F. Makedon, and I. Tollis. A 2n - 2 step algorithm for routing in an n × n array with constant size queues. In 1st SPAA, pages 328 335, 1989.
16. th Annual Symposium on Theoretical Aspects of Computer Science, volume 480 of Lecture Nodes in Computer Science, pages 444-455, Springer-Verlag, 1991.
17. J. Sibeyn, B. Chlebus, and M. Kaufmann. Deterministic permutation routing on meshes. J. Algorithms, 22:111-141, 1997.
18. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28:202 208, 1985.
19. S. Vishwanathan. Randomized on-line graph coloring. J. Algorithms, 13(4):657-669, 1992.
20. T.-H. Yeh, C.-M. Kuo, C.-L. Lei, and H.-C. Yen. Competitive source routing on tori and meshes. Technical report, Dept. of Electrical Engineering, National Taiwan University, 1996.
21. N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11(6):525-541, 1994.