Efficient on-line call control algorithms
Journal of Algorithms
Online computation and competitive analysis
Online computation and competitive analysis
All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Admission Control to Minimize Rejections
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On the minimum diameter spanning tree problem
Information Processing Letters
| Hi-index | 0.00 |
A tree of rings is a graph that can be constructed by starting with a ring and then repeatedly adding a new disjoint ring to the graph and identifying one vertex of the new ring with a vertex of the existing graph. Trees of rings are a common topology for communication networks. We give randomized on-line algorithms for the problem of deciding for a sequence of requests (terminalpa irs) in a tree of rings, which requests to accept and which to reject. Accepted requests must be routed along edge-disjoint paths. It is not allowed to reroute or preempt a request once it is accepted. The objective is to maximize the number of accepted requests. For the case that the paths for accepted requests can be chosen by the algorithm, we obtain competitive ratio O(log d), where d is the minimum possible diameter of a tree resulting from the tree of rings by deleting one edge from every ring. For the case where paths are pre-specified as part of the input, our algorithm achieves competitive ratio O(log l), where l is the maximum length of a simple path in the given tree of rings.