Abstract
In this paper, we consider hot-potato packet routing of one-to-one routing patterns on n-node trees. By applying a ‘charging argument’, we show that any greedy hot-potato algorithm routes a oneto-one routing pattern within 2(n � 1) steps. On the other hand, a trivial lower bound suggests that at least 3n/2 steps are required by any oblivious greedy algorithm. As the main contribution of the paper, we tighten the 2(n � 1) upper bound by constructing (for all sufficiently large n )a n elaborate one-to-one packet routing problem on an n-node tree for which an oblivious greedy hot
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
