Abstract
Consider a set of packets distributed unevenly among the nodes of a bounded degree network of processors. The Token Distribution Problem involves redistributing these packets so that each node holds the same number. Token distribution algorithms underlie several efficient routing algorithms. Peleg and Upfal formulated this problem and presented a communication-efficient solution. In this paper we refine their techniques to provide a solution that is efficient with respect to both communication and local computation.
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.
