Randomized greedy hot-potato routing

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. S. Acampora and S. I. A. Shah. Multihop lightwave networks: a comparison of store-and-forward and hotpotato routing. In Proc. IEEE INFOCOM, pages 10- 19, 1991.
	2	Amotz Bar-Noy , Prabhakar Raghavan , Baruch Schieber , Hisao Tamaki, Fast deflection routing for packets and worms, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.75-86, August 15-18, 1993, Ithaca, New York, United States [doi>10.1145/164051.164062]
	3	P. Baran. On distributed communications networks. IEEE Transactions on Communications, pages 1-9, 1964.
	4	I. Ben-Aroya, T. Eilam, and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Distributed Computing, 9(1):3-19, 1995.
	5	Ishai Ben Aroya , Ilan Newman , Assaf Schuster, Randomized single-target hot-potato routing, Journal of Algorithms, v.23 n.1, p.101-120, April 1997 [doi>10.1006/jagm.1996.0811]
	6	A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. Theory of Computing Systems, 31(1):41-61, January/February 1998.
	7	Allan Borodin , Yuval Rabani , Baruch Schieber, Deterministic Many-to-Many Hot Potato Routing, IEEE Transactions on Parallel and Distributed Systems, v.8 n.6, p.587-596, June 1997 [doi>10.1109/71.595575]
	8	Andrei Broder , Eli Upfal, Dynamic deflection routing on arrays (preliminary version), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.348-355, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.237981]
	9	U. Feige and P. Raghavan. Exact analysis of hotpotato routing. In IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 553-562, Pittsburgh, PN, October 1992. IEEE Computer Society Press.
	10	A. G. Greenberg and J. Goodman. Sharp approximate models of deflection routing. IEEE Transactions on Communications, 41(1):210-223, January 1993.
	11	B. Hajek, Bounds on evacuation time for deflection routing, Distributed Computing, v.5 n.1, p.1-6, June 1991 [doi>10.1007/BF02311228]
	12	W D Hillis, The connection machine, MIT Press, Cambridge, MA, 1985
	13	Christos Kaklamanis , Danny Krizanc , Satish Rao, Hot-potato routing on processor arrays, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.273-282, June 30-July 02, 1993, Velen, Germany [doi>10.1145/165231.376321]
	14	Michael Kaufmann , Harald Lauer , Heiko Schröder, Fast Deterministic Hot-Potato Routing on Processor Arrays, Proceedings of the 5th International Symposium on Algorithms and Computation, p.333-341, August 25-27, 1994
	15	Yishay Mansour , Boaz Patt-Shamir, Many-to-one packet routing on grids, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.258-267, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225136]
	16	N. F. Maxemchuk. Comparison of deflection and store and forward techniuques in the Manhattan street and shuffle exchange networks. In Proc. IEEE INFOCOM, pages 800-809, 1989.
	17	Ilan Newman , Assaf Schuster, Hot-Potato Algorithms for Permutation Routing, IEEE Transactions on Parallel and Distributed Systems, v.6 n.11, p.1168-1176, November 1995 [doi>10.1109/71.476188]
	18	A. Schuster. Bounds and Analysis Techniques for Greedy Hot.Potato Routing, chapter 11, pages 283-354. Optical Interconnections and Parallel Processing: The Interface. Kluwer Academic Publishers, 1997.
	19	Charles L. Seitz, Mosaic C: An Experimental Fine-Grain Multicomputer, Proceedings of the International Conference on Future Tendencies in Computer Science, Control and Applied Mathematics, p.69-85, December 08-11, 1992
	20	B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proc. Fourth Syrup. Real Time Signal Processing IV, pages 241-248. SPIE, 1981.
	21	P. Spirakis and V. Triantafillou. Pure greedy hotpotato routing in the 2-D mesh with random destinations. Parallel Processing Letters, 7(3):249-258, September 199"/'.
	22	T. Szymanski. An analysis of "hot potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918-925, 1990.
	23	Z. Zhang and A. S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. In Proc. IEEE INFOCOM, pages 1012-1021, 1991.