Abstract
The call control problem is an important optimization problem encountered in the design and operation of communication networks. The goal of the call control problem in rings is to compute, for a given ring network with edge capacities and a set of paths in the ring, a maximum cardinality subset of the paths such that no edge capacity is violated. We give a polynomial-time algorithm to solve the problem optimally. The algorithm is based on a decision procedure that checks whether a solution with at least k paths exists, which is in turn implemented by an iterative greedy approach operating in rounds. We show that the algorithm can be implemented efficiently and, as a by-product, obtain a linear-time algorithm to solve the call control problem in chains optimally.
Research partially supported by the Swiss National Science Foundation.
Supported by the joint Berlin/Zurich graduate program Combinatorics, Geometry, and Computation (CGC), financed by ETH Zurich and the German Science Foundation (DFG).
This is a preview of subscription content, log in via an institution to check access.
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
R. Adler and Y. Azar. 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’99, pages 1–10, 1999.
A. Blum, A. Kalai, and J. Kleinberg. Admission control to minimize rejections. In Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), LNCS 2125, pages 155–164, 2001.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Applied Mathematics, 59:225–235, 1995.
E. M. Eschen and J. P. Spinrad. An O(n2) algorithm for circular-arc graph recognition. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms SODA’93, pages 128–137, 1993.
H. Gabow and R. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30(2):209–221, 1985.
J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. Journal of Algorithms, 23:180–194, 1997.
M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods, 1(2):216–227, 1980.
M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
I. A. Karapetian. On the coloring of circular arc graphs. Journal of the Armenian Academy of Sciences, 70(5):306–311, 1980. (in Russian)
S. Leonardi. On-line network routing. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, LNCS 1442. Springer-Verlag, Berlin, 1998.
S. Plotkin. Competitive routing of virtual circuits in ATM networks. IEEE Journal of Selected Areas in Communications, 13(6): 1128–1136, August 1995.
G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms SODA’ 98, pages 333–341, 1998.
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
Adamy, U., Ambuehl, C., Anand, R.S., Erlebach, T. (2002). Call Control in Rings. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_67
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive