Routing and admission control in networks with advance reservations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2462, Issue , 2002, Pages 215-228

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; PROFITABILITY; QUALITY OF SERVICE;

ADVANCE RESERVATION; AXIS PARALLEL RECTANGLES; BANDWIDTH REQUIREMENT; C-APPROXIMATION ALGORITHMS; REAL TIME NETWORK; SPATIAL CHARACTERISTICS; TEMPORAL CHARACTERISTICS; WEIGHT INDEPENDENT SETS;

APPROXIMATION ALGORITHMS;

EID: 84893462541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45753-4_19     Document Type: Conference Paper

References (22)

1. 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).
2. 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.
3. E. Asplund, B. Grunbaum, “On a coloring problem”, Math. Scand. 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 J. on Disc. Mathematics, Vol. 12, pp. 289–297, 1999.
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, Vol. 48 (2001), pp. 1069-1090.
7. 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.
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, San Francisco, CA, (2002), pp. 732-741.
9. 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.
10. 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.
11. 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.
12. 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.
13. M.C. Golumbic and R.E Jamison, “Edge and vertex intersection of paths in a tree”, Discrete Math. 55 (1985), 151-159.
14. R. Guerin and A. Orda, “Networks with advance reservations: the routing perspective”, Proceedings of INFOCOM 2000, Tel-Aviv, Israel, April 2000.
15. P.G.H Lehot, “An optimal algorithm to detect a line graph and output its root graph”, J. ACM 21 (1974) 569-575.
16. W. Reinhardt. Advance resource reservation and its impact on reservation protocols. In Proceedings of Broadband Islands’95, Dublin, Ireland, September 1995.
17. 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.
18. O. Schelén and S. Pink. Sharing resources through advance reservations agents. In Proceedings of IWQoS’97, New York, NY, May 1997.
19. 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.
20. R. Tarjan, “Decomposition by clique separators”, Discrete Math. 55 (1985), 221-231.
21. J. Virtamo. A model of reservation systems. IEEE. Trans. Commun., 40(1):109–118, January 1992.
22. D. Wischik and A. Greenberg. Admission control for booking ahead shared resources. In Proceedings of INFOCOM’98, San Francisco, CA, April 1998.