Observations on hot potato routing

Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Volumn , Issue , 1995, Pages 30-39

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MESH NETWORKING;

DESIGN PRINCIPLES; GENERAL NETWORKS; HOT-POTATO; HOT-POTATO ROUTING; PACKET ROUTING; POSITIVE SIDES; UPPER BOUND; WORST-CASE PERFORMANCE;

COMPUTATION THEORY;

EID: 84966480595     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISTCS.1995.377049     Document Type: Conference Paper

References (14)

1. A. S. Acampora, S. I. A. Shah. "Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing". In Proc. IEEE INFOCOM, 10-19. IEEE Computer Society Press, 1991.
2. P. Baran. "On distributed communications networks. " IEEE Transactions on Communications, 1-9, 1964.
3. A. Bar-Noy, P. Raghavan, B. Schieber, H. Tamaki. "Fast deflection routing for packets and worms". In Proc. of 12th ACM Symp. on Principles of Distr. Comput., 75-86, 199S.
4. I. Ben-Aroya, A. Schuster. "Greedy Hot-Potato Routing on the Two-Dimensional Mesh". Manuscript, 1994.
5. A. Ben-Dor, S. Halevi, A. Schuster. "Potential function analysis of greedy hot-potato routing. " In Proc. of 13th ACM Symp. on Principles of Distr. Comput., 225-234, 1991
6. A. Borodin, J. E. Hopcroft. "Routing, merging, and sorting on parallel models of computation. " J CSS, 30: 130-145, 1985.
7. A. Borodin, Y. Rabani, B. Schieber. "Deterministic many-to-many hot potato routing. " manuscript, 1994.
8. J. T. Brassil, R. L. Cruz. "Bounds on Maximum Delay in Networks with Deflection Routing". In 29th Annual Allerton Conference, on Communication, Control, and Computing, 571-580, 1991.
9. U. Feige, P. Raghavan. "Exact analysis of hot-potato routing". In Proc. of 33rd Symp. on Foundations of Computer Science, 553-562, 1992.
10. B. Hajek. "Bounds on evacuation time for deflection routing". Distributed Computing, 5: 1-6, 1991.
11. C. Kaklamanis, D. Krizanc, S. Rao. "Hot-potato routing on processor arrays". In Proc. of fifth Symp. on Parallel Algorithms and Architectures, 1993.
12. A. Lempel, J. Ziv. "Compression of two-dimensional data". IEEE Trans. Inform. Theory, Vol. IT-32, no. 1, 2-8, 1986.
13. Y. Mansour, B. Patt-Shamir. "Greedy packet scheduling on shortest paths". In Proc. of 10th ACM Symp. on Principles of Distr. Comput., 165-175, 1991.
14. I. Newman, A. Schuster. "Hot-potato worm routing is almost as easy as store-and-forward packet routing". In Proc. of second Israel Symposium on Theory of Computing and Systems, 202-211, 1993.