| TR#: | CS0826 |
| Class: | CS |
| Title: | BALANCING
COMMUNICATION IN RING-STRUCTURED NETWORKS. |
| Authors: | A. Litman and A.L. Rosenberg |
| CS0826.pdf | |
| Abstract: | We present a polynomial-time algorithm for finding an almost optimal solution to the following combinatorial problem, which is motivated by the problem of balancing communication in networks having the structure of rings. Input: a circle and a multiset of c chords, having n distinct endpoints, representing desired point-to-point communications; c' of the chords are distinct. The task: to map each chord to an arc having the same endpoints, in a way that minimizes the maximum number of arcs crossing any normal to the circle. Our algorithm operates in time O(n^2c) and uses O(n+c') words of storage; it finds a mapping that is within +1 of optimal. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1994/CS/CS0826), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1994
To the main CS technical reports page