Volume 1136 of the series Lecture Notes in Computer Science pp 471485
A lower bound for nearly minimal adaptive and hot potato algorithms
 Ishai BenAroyaAffiliated 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
Abstract
Recently, Chinn, Leighton, and Tompa [10] presented lower bounds for storeandforward 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. [10] 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 [10] 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 BenDor, Halevi, and Schuster [6] contains algorithms that have poor performance in routing worst case permutations.
 Title
 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
 Pages
 pp 471485
 Copyright
 1996
 DOI
 10.1007/3540616802_76
 Print ISBN
 9783540616801
 Online ISBN
 9783540706670
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1136
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Ishai BenAroya ^{(2)}
 Donald D. Chinn ^{(3)}
 Assaf Schuster ^{(2)}
 Author Affiliations

 2. Department of Computer Science, Technion, 32000, Haifa, Israel
 3. Department of Computer Science and Engineering, University of Washington, FR35, 98195, Seattle, WA
Continue reading...
To view the rest of this content please follow the download PDF link above.