Randomized Single-Target Hot-Potato Routing

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 101-120

  Aroya, Ishai Ben ^a   Newman, Ilan ^b   Schuster, Assaf ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009792556     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0811     Document Type: Article

References (29)

1. A. S. Acampora and S. I. A. Shah, Multihop lightwave networks: A comparison of store-and-forward and hot-potato routing, in "INFOCOM," pp. 10-19, IEEE, 1991.
2. A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki, Fast deflection routing for packets and worms, in "Proc. 12th Symp. on Principles Of Distributed Computing, ACM, 1993," pp. 75-86.
3. P. Baran, On distributed communications networks, IEEE Trans. Comm. 12 (1964), 1-9.
4. I. Ben-Aroya, D. D. Chinn, and A. Schuster, "A CLT-Type Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms," Technical Report LPCR No. 9405, C.S. Dept., Technion, May 1994.
5. I. Ben-Aroya, I. Newman, and A. Schuster, Randomized single target hot potato routing, J. Algorithms, in press. (Also in "Proc. 3rd Israeli Symp. on Theory of Computing and Systems, Jan. 1995," pp. 20-29.)
6. I. Ben-Aroya, I. Newman, and A. Schuster, Randomized single target hot potato routing, J. Algorithms, in press. (Also in "Proc. 3rd Israeli Symp. on Theory of Computing and Systems, Jan. 1995," pp. 20-29.)
7. I. Ben-Aroya, E. Tamar, and A. Schuster, Greedy hot-potato routing on the two-dimensional mesh, Distrib. Comput. 9(1):3-19, 1995. (Also in "Proc. 2nd European Symp. on Algorithms, Utrecht, 1994.)
8. I. Ben-Aroya, E. Tamar, and A. Schuster, Greedy hot-potato routing on the two-dimensional mesh, Distrib. Comput. 9(1):3-19, 1995. (Also in "Proc. 2nd European Symp. on Algorithms, Utrecht, 1994.)
9. A. Ben-Dor, S. Halevi, and A. Schuster, Potential function analysis of greedy hot-potato routing, in "Proc. 13th symp. on Principles of Distributed Computing, Los Angeles, Aug. 1994," ACM, pp. 225-234. (Also Technion/LPCR TR #9303, January 1993.)
10. A. Borodin and J. E. Hopcroft, Routing, merging, and sorting on parallel models of computation, J. Comput. Syst. Sci. 30:130-145, 1985.
11. A. Borodin, Y. Rabani, and B. Schieber, "Deterministic Many-to-Many Hot Potato Routing," Technical Report RC 20107, IBM Watson Research Report, 1995.
12. J. T. Brassil and R. L. Cruz, Bounds on maximum delay in networks with deflection routing, in "Proc. 29th Allerton conf. on Communication, Control and Computing, 1991," pp. 571-580.
13. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observation, Ann. Math. Stat. 23:493-507, 1952.
14. U. Feige, Observations on hot potato routing, in "Proc. 3rd Israeli symp. on Theory of Computing and Systems, Jan. 1995," pp. 30-39.
15. U. Feige and P. Raghavan, Exact analysis of hot-potato routing, in "Proc. 33rd Symp. on of Foundations of Computer Science," IEEE, Nov. 1992, pp. 553-562.
16. A. G. Greenberg and J. Goodman, Sharp approximate models of adaptive routing in mesh networks, in "Teletraffic Analysis and Computer Performance Evaluation," (O. J. Boxma, J. W. Cohen, and H. C. Tijms, Eds.), pp. 255-270, Elsevier, Amsterdam, 1986. (Revised 1988.)
17. A. G. Greenberg and B. Hajek, Deflection routing in hypercube networks, IEEE Trans. Comm. June 1992.
18. B. Hajek, Bounds on evacuation time for deflection routing, Distrib. Comput. 5:1-6, 1991.
19. C. Kaklamanis, D. Krizanc, and Satish Rao, Hot-potato routing on processor arrays, in Proc. 5th Symp. on Parallel Algorithms and Architectures, ACM, 1993, pp. 273-282.
20. M. Kaufmann, H. Lauer, and H. Schröder, Fast deterministic hot-potato routing on meshes, in Proc. 5th Symp. on Algorithms and Computation (ISAAC), number 834 in LNCS, pp. 333-341, Springer-Verlag, 1994.
21. N. F. Maxemchuk, Comparison of deflection and store and forward techniques in the manhattan street and shuffle exchange networks, in IEEE INFOCOM, pp. 800-809, 1989.
22. I. Newman and A. Schuster, Hot-potato algorithms for permutation routing. Technical Report PCL Report #9201, CS dept. Technion, November 1992. (To appear in IEEE TPDS, 1995.)
23. I. Newman and A. Schuster, Hot-potato algorithms for permutation routing. Technical Report PCL Report #9201, CS dept. Technion, November 1992. (To appear in IEEE TPDS, 1995.)
24. J. Y. Ngai and C. L. Seitz, A framework for adaptive routing in multicomputer networks, in Proc. 1st Symp. on Parallel Algorithms and Architectures, ACM, 1989, pp. 1-9.
25. R. Prager, An algorithm for routing in hypercube networks. Master's thesis, University of Toronto, Computer Science Department, 1986.
26. C. L. Seitz, The Caltech Mosaic C: an experimental, fine-grain multicomputer, in 4th Symp. on Parallel Algorithms and Architectures, San Diego, June 1992. ACM. Keynote Speech.
27. B. Smith, Architecture and applications of the HEP multiprocessor computer system, in Proc. (SPIE) Real Time Signal Processing IV, pp. 241-248, 1981.
28. T. Szymanski, An analysis of hot potato routing in a fiber optic packet switched hypercube, in Proc. IEEE INFOCOM, pp. 918-926, 1990.
29. Z. Zhang and A. S. Acampora, Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities, in Proc. IEEE INFOCOM, pp. 1012-1021, 1991.