On-line network routing

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

Volumn 1442, Issue , 1998, Pages 242-267

  Leonardi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958965071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0029572     Document Type: Conference Paper

References (41)

1. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proceedings of the 25th ACM Symposium on the Theory of Computing, pages 623-631, 1993.
2. B. Awerbuch and Y. Azar. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 240-249, 1994.
3. B. Awerbuch and Y. Azar. Competitive multicast routing. Wireless Networks, 1:107-114, 1995.
4. B. Awerbuch, Y. Azar, and A. Fiat. Packet routing via min-cost circuit routing. In Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems, pages 37-42, 1996.
5. B. Awerbuch, Y. Azar, A. Fiat, and T. Leighton. Making commitments in the face of uncertainty: How to pick a winner almost every time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 519-530, 1996.
6. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosén. On-line competitive algorithms for call admission in optical networks. In Proceedings of the 4th Annual European Symposium on Algorithms, Lecture Notes in Compter Science 1136, pages 431-444. Springer-Verlag, 1996.
7. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
8. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown duration. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 321-327, 1994.
9. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive non-preemptive call control. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 312-320, 1994.
10. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 412-423, 1994.
11. B. Awerbuch and T. Singh. On-line algorithms for selective multicast and maximal dense trees. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 354-362, 1997.
12. Y. Azar, A. Broder, and A. Karlin. On-line load balancing. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 218-225, 1992.
13. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Prahs, and O. Waarts. Online load balancing of temporary tasks. In Proceedings of the 3rd Workshop on Algorithms and Data Structures, LNCS, pages 119-130. Springer-Verlag, 1993.
14. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour, and B. Schieber. Bandwidth allocation with preemption. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 616-625, 1995.
15. Y. Bartal, A. Fiat, and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In Proceedings of the 28th ACM Symposium on Theory of Computing, pages 531-540, 1996.
16. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 24th International Colloqium on Automata, Languages and Programming, LNCS 1256, pages 516-526. Springer-Verlag, 1997.
17. A. Blum, A. Fiat, H. Karloff, and Y. Rabani, 1993. Personal comunication.
18. A. Borodin and R. El-Yaniv. Call admission and circuit-routing. In Online Computation and Competitive Analysis. Cambridge University Press, 1997.
19. A. Borodin, J. Kleinberg, and M. Sudan, 1996. Personal communication.
20. R. Canetti and S. Irani. Bounding the power of preemption in randomized scheduling. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 616-615, 1995.
21. A. Frank. Packing paths, cuts, and circuits - a survey. In B. Korte, L. Lovász, H.J. Proemel, and A. Schrijver, editors, Paths, Flows, and VLSI-Layout, pages 49-100. Springer-Verlag, 1990.
22. J.A. Garay and I.S. Gopal. Call preemption in communications networks. In Proceedings of INFOCOM '92, pages 1043-1050, 1992.
23. J.A. Garay, I.S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. In Proceedings of the 2nd Israeli Symposium on Theory of Computing and Systems, pages 285-293, 1993.
24. R. Gawlick, A. Kamath, S. Plotkin, and K. Ramakrishnan. Routing and admission control of virtual circuits in general topology networks. Technical Report BL011212-940819-19TM, AT&T Bell Laboratories, 1994.
25. O. Gerstel and S. Kutten. Dynamic wavelength allocation in WDM ring networks. In Proceedings of ICC '97, 1997.
26. O. Gerstel, G.H. Sasaki, and R. Ramaswami. Dynamic channel assignment for WDM optical networks with little or no wavelength conversion. In Proceedings of the 34th Allerton Conference on Communication, Control, and Computin, 1996.
27. A. Goel, M. R. Henzinger, and S. Plotkin. Online throughput-competitive algorithms for multicast routing and admission control. In Proceedings of the 9th ACM-SIAM Symposium on Discrete algorithms, pages 97-106, 1998.
28. P.E. Green. Fiber-Optic Communication Networks. Prentice Hall, 1992.
29. S. Irani. Coloring inductive graphs on-line. Algorithmica, 11:53-72, 1994.
30. A. Kamath, O. Palmon, and S. Plotkin. Routing and admission control in general topology networks with poisson arrivals. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pages 269-278, 1996.
31. H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium, 33:143-153, 1981.
32. J. Kleinberg and R. Rubenfield. Short paths in expander graphs. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 86-95, 1996.
33. J. Kleinberg and E. Tardos. Disjoint paths in densely embedded graphs. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pages 52-61, 1995.
34. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 101-111, 1991.
35. S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with applications to routing and scheduling. In Proceedings of the 23rd International Colloqium on Automata, Languages and Programming, LNCS 955, pages 303-314. Springer-Verlag, 1995.
36. S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, and A. Rosén. On-line randomized call-control revisited. In Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 323-332, 1998.
37. R. J. Lipton and A. Tomkins. Online interval scheduling. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 302-311, 1994.
38. Y. Ma and S. Plotkin. Improved lower bounds for load balancing of tasks with unknown duration. Information Processing Letter, 62:31-34, 1997.
39. M. Mihail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth. In Proceedings of the 36th Annual IEEE Symposium on Foudations of Computer Science, pages 548-557, 1995.
40. M. Slusarek. Optimal on-line coloring of circular arc graphs. RAIRO Journal on Informatique Theoretique et Applications, 29(5):423-429, 1995.
41. Jan van Leeuwen ed. Handbook of theoretical computer science, Vol A, Algorithms and Complexity. The MIT Press, 1990.