Abstract
The provisioning of quality-of-service (QoS) for real-time network applications may require the network to reserve resources. A natural way to do this is to allow advance reservations of network resources prior to the time they are needed. We consider several two-dimensional admission control problems in simple topologies such as a line, a ring and a tree. The input is a set of connection requests, each specifying its spatial characteristics, that is, its source and destination; its temporal characteristics, that is, its start time and duration time; and, potentially, also a bandwidth requirement. In addition, each request has a profit gained by acommodating it. We address the related admission control problem, where the goal is to maximize the total profit gained by the accommodated requests. We provide approximation algorithms for several problem variations. Our results imply a 4c-approximation algorithm for finding a maximum weight independent set of axis-parallel rectangles in the plane, where c is the size of a maximum set of overlapping requests.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P.K. Agarwal, M. van Kreveld, ans S. Suri, “Label placement by maximum independent set in rectangles”, Computational Geometry: Theory and applications, 11(3–4): 209–218 (1998).
T. Asano, “Difficulty of the maximum independent set problem on intersection graphs of geometric objects”, Proceedings of the Sixth Internat. Conf. on the Theory and Applications of Graphs, Western Michigan University 1988.
E. Asplund, B. Grunbaum, “On a coloring problem”, Math. Scand. 8 (1960), 181–188.
B. Awerbuch, Y. Azar, and S. Plotkin, “Throughput-competitive online routing”, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 32–40.
V. Bafna, P. Berman, and T. Fujito, “A 2-approximation algorithm for the undirected feedback vertex set problem”, SIAM J. on Disc. Mathematics, Vol. 12, pp. 289–297, 1999.
A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber, “A unified approach to approximating resource allocation and scheduling”, Journal of the ACM, Vol. 48 (2001), pp. 1069–1090.
R. Bar-Yehuda and S. Even, “A local-ratio theorem for approximating the weighted vertex cover problem”, Annals of Discrete Mathematics, Vol. 25, pp. 27–46, 1985.
R. Bar-Yehuda, M. Halldorsson, J. Naor, H. Shachnai, and I. Shapira, “Scheduling split intervals”, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, (2002), pp. 732–741.
P. Berman, B. DasGupta, S. Muthukrishana, and S. Ramaswami, “Improved approximation algorithms for rectangle tiling and packing”, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 427–436.
T. Erlebach and K. Jansen, “Off-line and on-line call-scheduling in stars and trees”, Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG’97) LNCS 1335, Springer Verlag, 1997, pp. 199–213.
T. Erlebach and K. Jansen, “Maximizing the number of connections in optical tree networks”, Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC’98) LNCS 1533, Springer Verlag, 1998, pp. 179–188.
T. Erlebach, K. Jansen, and E. Seidel, “Polynomial-time approximation schemes for geometric graphs”, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 671–679.
M.C. Golumbic and R.E Jamison, “Edge and vertex intersection of paths in a tree”, Discrete Math. 55 (1985), 151–159.
R. Guerin and A. Orda, “Networks with advance reservations: the routing perspective”, Proceedings of INFOCOM 2000, Tel-Aviv, Israel, April 2000.
P.G.H Lehot, “An optimal algorithm to detect a line graph and output its root graph”, J. ACM 21 (1974) 569–575.
W. Reinhardt. Advance resource reservation and its impact on reservation protocols. In Proceedings of Broadband Islands’95, Dublin, Ireland, September 1995.
J. W. Roberts and K.-Q. Liao. Traffic models for the telecommunication services with advanced reservation. In Proceedings of the 11th Intl. Teletraffic Congress, Kyoto, Japan, June 1985. Paper 1.3-2.
O. Schelén and S. Pink. Sharing resources through advance reservations agents. In Proceedings of IWQoS’97, New York, NY, May 1997.
A. Schill, F. Breiter, and S. Kühn. Design and evaluation of an advance resource reservation protocol on top of RSVP. In Proceedings of IFIP Broadband’98, Stuttgart, Germany, April 1998.
R. Tarjan, “Decomposition by clique separators”, Discrete Math. 55 (1985), 221–231.
J. Virtamo. A model of reservation systems. IEEE. Trans. Commun., 40(1):109–118, January 1992.
D. Wischik and A. Greenberg. Admission control for booking ahead shared resources. In Proceedings of INFOCOM’98, San Francisco, CA, April 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
Lewin-Eytan, L., Naor, J.S., Orda, A. (2002). Routing and Admission Control in Networks with Advance Reservations. In: Jansen, K., Leonardi, S., Vazirani, V. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2002. Lecture Notes in Computer Science, vol 2462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45753-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-45753-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44186-1
Online ISBN: 978-3-540-45753-4
eBook Packages: Springer Book Archive