Admission control in networks with advance reservations

Algorithmica (New York)

Volumn 40, Issue 4, 2004, Pages 293-304

  Lewin Eytan, Liane ^a   Naor, Joseph ^a   Orda, Ariel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Advance reservations; Approximation algorithms; Axis parallel rectangles; Independent set; Line network; Local ratio

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; QUALITY OF SERVICE; REAL TIME SYSTEMS; SET THEORY; VIDEO CONFERENCING;

ADVANCE RESERVATIONS; APPROXIMATION ALGORITHMS; AXIS PARALLEL RECTANGLES; INDEPENDENT SET; LINE NETWORK; LOCAL RATIO;

TELECOMMUNICATION NETWORKS;

EID: 21044443608     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1114-1     Document Type: Conference Paper

References (21)

1. P.K. Agarwal, M. van Kreveld, and S. Suri, Label placement by maximum independent set in rectangles, Computational Geometry: Theory and Applications, 11(3-4): (1998), 209-218.
2. T. Asano, Difficulty of the maximum independent set problem on intersection graphs of geometric objects, Graph Theory, Combinatorics, and Applications, Vol. 1, Kalamazoo, MI, 1988, Wiley-Interscience, New York, 1991, pp. 9-18.
3. E. Asplund and B. Grunbaum, On a coloring problem, Mathematica Scandinavica 8 (1960), 181-188.
4. 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.
5. V. Bafna, P. Berman, and T. Fujito, A 2-approximation algorithm for the undirected feedback vertex set problem, SIAM Journal on Discrete Mathematics, 12, (1999), 289-297.
6. 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, 48 (2001), 1069-1090.
7. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Annals of Discrete Mathematics, 25, (1985) 27-46.
8. 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, 2002, pp. 732-741.
9. P. Berman, B. DasGupta, S. Muthukrishnan, 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.
10. C. Chekuri, M. Mydlarz, and F.B. Shepherd, Multicommodity demand flow in a tree, Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, 2003, pp. 410-425.
11. T. Erlebach, Call admission control for advance reservation requests with alternatives, Proceedings of the 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, Proceedings in Informatics, Carleton Scientific, Waterloo, Ontario, 2002, pp. 51-64.
12. 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, Berlin, 1997, pp. 199-213.
13. 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, Berlin, 1998, pp. 179-188.
14. R. Guerin and A. Orda, Networks with advance reservations: the routing perspective, Proceedings of INFOCOM '2000, Tel-Aviv, 2000, Vol. 1, pp. 118-127.
15. W. Reinhardt, Advance resource reservation and its impact on reservation protocols, Proceedings of Broadband Islands '95, Dublin, September 1995. A technical report can be found at cite-seer.ist.psu.edu/reinhardt95advance.html.
16. J. Roberts and K. Liao, Traffic models for telecommunication services with advance capacity reservation. Computer Networks and ISDN Systems, 10(3-4) (1985), 221-229. (Special issue: selected papers from the 11th International Teletraffic Congress.)
17. O. Schelén and S. Pink, Sharing resources through advance reservations agents, Proceedings of IFIP 5th International Workshop on Quality of Service, New York, 1997, pp. 265-276.
18. A. Schill, F. Breiter, and S. Kühn, Design and evaluation of an advance resource reservation protocol on top of RSVP, Proceedings of the 4th IFIP International Conference on Broadband Communications, Stuttgart, 1998, pp. 23-40.
19. R.E. Tarjan, Decomposition by clique separators, Discrete Mathematics, 55 (1985), 221-231.
20. J. Virtamo, A model of reservation systems, IEEE Transactions on Communications, 40(1) (1992) 109-118.
21. D. Wischik and A. Greenberg. Admission control for booking ahead shared resources, Proceedings of INFOCOM '98, San Francisco, CA, 1998, pp. 873-882.