Approximating call-scheduling makespan in all-optical networks

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

Volumn 1928, Issue , 2000, Pages 13-22

  Becchetti, Luca ^a   Ianni, Miriam Di ^b   Marchetti Spaccamela, Alberto ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; GRAPH THEORY; OPTICAL COMMUNICATION; SCHEDULING; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS;

ALL- OPTICAL NETWORKS; APPROXIMATION RATIOS; CONSTANT APPROXIMATION ALGORITHMS; PATH COLORINGS; RELEASE DATE; ROUTING AND SCHEDULING; STAR NETWORK; STARTING TIME;

TREES (MATHEMATICS);

EID: 84958764560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40064-8_3     Document Type: Conference Paper

References (21)

1. Y. Aumann and Y. Rabani. Improved bounds for all-optical routing. In Proc. Of the 6-th ACM Symposium on Discrete Algorithms, pages 567-576, 1995.
2. Y. Bartal, A. Fiat, and S. Leonardi. Lower bounds for on-line graph problems with application to on-line circuit and optical-routing. In Proc. of the 28th Annual Symposium on the Theory of Computing, pages 531-540, 1996.
3. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proc. of the 24th International Colloquium on Automata, Languages and Programming, volume 1256 of Lectures Notes in Computer Science, pages 516-526, 1997.
4. L. Becchetti, M. Di Ianni, and A. Marchetti-Spaccamela. Approximation Algorithms for Routing and Call Scheduling in all-optical Chains and Rings. In Proc. of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lectures Notes in Computer Science, pages 201-212, 1999.
5. C. Brackett. Dense Wavelength Division Multiplexing Networks: Principles and Applications. IEEE Journal Selected Areas in Comm., 8:948-964, 1990.
6. J. Van Leeuwen editor. Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity. Elesevier North-Holland, Amsterdam, 1990.
7. T. Erlebach and K. Jansen. Scheduling Virtual Connections in Fast Networks. In Proc. of the 4th Parallel Systems and Algorithms Workshop PASA ‘96, 1996.
8. T. Erlebach and K. Jansen. Call Scheduling in Trees, Rings and Meshes. In Proc. of the 30th Hawaii International Conference on System Sciences, 1997.
9. T. Erlebach and K. Jansen. Off-line and on-line call-scheduling in stars and trees. In WG: Graph-Theoretic Concepts in Computer Science, International Workshop WG, volume 1335 of Lecture Notes in Computer Science, 1997.
10. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal Wavelength Routing on Directed Fiber Tree. Theoretical Computer Science, 221 (1-2):119-137, 1999.
11. P. E. Green. Fiber-optic Communication Networks. Prentice-Hall, 1992.
12. M. Di Ianni. Efficient delay routing. Theoretical Computer Science, 196:131-151, 1998.
13. S. Khanna. A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Tech. J., Spring, 1997.
14. J. Kleinberg and E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. In Proc. of 27th ACM Symposium on the Theory Of Computing, pages 26-35, 1995.
15. F.T. Leighton, B.M. Maggs, and A.W. Richa. Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules. In Proc. of 28th Annual Hawaii International Conference on System Sciences, pages 555-563, 1995.
16. T. Leighton, B. Maggs, and S. Rao. Packet routing and jobshop scheduling in O(congestion+dilation) steps. Combinatorica, 14, 1994.
17. K. Nosu, N. K. Cheung and G. Winzer. Dense Wavelength Division Multiplexing Networks: Principles and Applications. IEEE Journal Selected Areas in Comm., 8, 1990.
18. Y. Rabani. Path coloring on the mesh. In Proc. of 37th Annual IEEE Symposium Foundations of Computer Science, pages 400-409, 1996.
19. P. Raghavan and E. Upfal. Efficient Routing in All-Optical Networks. In Proc. Of the 26th Annual Symposium on the Theory of Computing, pages 134-143, 1994.
20. D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines on-line. SIAM Journal of Computing, 24 (6):1313-1331, 1995.
21. B. Zelinka. Medians and Peripherians on Trees. Arch. Math. (Brno), pages 87-95, 1969.