A lower bound for nearly minimal adaptive and hot potato algorithms
- Ishai Ben-AroyaAffiliated withDepartment of Computer Science, Technion
- , Donald D. ChinnAffiliated withDepartment of Computer Science and Engineering, University of Washington Email author
- , Assaf SchusterAffiliated withDepartment of Computer Science, Technion
Recently, Chinn, Leighton, and Tompa  presented lower bounds for store-and-forward permutation routing algorithms on the n × n mesh with bounded buffer size and where a packet must take a shortest (or minimal) path to its destination. We extend their analysis to algorithms that are nearly minimal. (In their preliminary work, Chinn et al.  mention a similar result that seems, however, incorrect.) We also apply this technique to the domain of hot potato algorithms, where there is no storage of packets and the shortest path to a destination is not assumed (and is in general impossible).We show that “natural” variants and “improvements” of several algorithms in the literature perform poorly in the worst case. As a result, we identify algorithmic features that are undesirable for worst case hot potato permutation routing.
Researchers in hot potato routing have defined simple and greedy classes of algorithms. We show that when an algorithm is too simple and too greedy, its performance in routing permutations is poor in the worst case. Specifically, the technique of  is also applicable to algorithms that do not necessarily send packets in minimal or even nearly minimal paths: it may be enough that they naively attempt to do so when possible. In particular, our results show that a certain class of greedy algorithms that was suggested recently by Ben-Dor, Halevi, and Schuster  contains algorithms that have poor performance in routing worst case permutations.
- A lower bound for nearly minimal adaptive and hot potato algorithms
- Book Title
- Algorithms — ESA '96
- Book Subtitle
- Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings
- pp 471-485
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.