Abstract
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 ℓ), where ℓ is the maximum length of a simple path in the given tree of rings.
Supported by the joint Berlin/Zurich graduate program Combinatorics, Geometry, and Computation (CGC),financed by ETH Zurich and the German Science Foundation (DFG).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA. (1999) 1–10
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proceedings of the 34th AnnualSymp osium on Foundations of Computer Science FOCS. (1993) 32–40
Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms SODA. (1994) 312–320
Awerbuch, B., Gawlick, R., Leighton, T., Rabani, Y.: On-line admission control and circuit routing for high performance computing and communication. In: Proceedings of the 35th AnnualSymp osium on Foundations of Computer Science FOCS. (1994) 412–423
Beauquier, B., Pérennes, S., Tóth, D.: All-to-all routing and coloring in weighted trees of rings. In: Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA. (1999) 185–190
Blum, A., Kalai, A., Kleinberg, J.: Admission control to minimize rejections. In: Proceedings of the 7th InternationalWorkshop on Algorithms and Data Structures WADS. LNCS 2125 (2001) 155–164
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
Deng, X., Li, G., Zang, W., Zhou, Y.: A 2-approximation algorithm for path coloring on trees of rings. In: Proceedings of the 11th AnnualI nternational Symposium on Algorithms and Computation ISAAC. LNCS 1969 (2000) 144–155
Erlebach, T.: Approximation algorithms and complexity results for path problems in trees of rings. In: Proceedings of the 26th InternationalS ymposium on MathematicalF oundations of Computer Science MFCS. LNCS 2136 (2001) 351–362
Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. Journal of Algorithms 23 (1997) 180–194
Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Information Processing Letters 53 (1995) 109–111
Kleinberg, J., Tardos, É.: Disjoint paths in densely embedded graphs. In: Proceedings of the 36th AnnualSymp osium on Foundations of Computer Science FOCS. (1995) 52–61
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anand, R.S., Erlebach, T. (2002). On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_50
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive