Resource allocation problems in multifiber WDM tree networks

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

Volumn 2880, Issue , 2003, Pages 218-229

  Erlebach, Thomas ^a   Pagourtzis, Aris ^b   Potika, Katerina ^b   Stefanakos, Stamatis ^a  

^a ETH ZURICH   (Switzerland)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FORESTRY; GRAPH THEORY; OPTIMIZATION; TREES (MATHEMATICS);

ALL- OPTICAL NETWORKS; DIRECTED TREES; MULTI FIBERS; OPTIMIZATION PROBLEMS; RESOURCE ALLOCATION PROBLEM; TREE NETWORK; WDM TREE NETWORKS;

APPROXIMATION ALGORITHMS;

ALGORITHMS; FIBER OPTICS; PROBLEM SOLVING;

EID: 0344391994     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39890-5_19     Document Type: Article

References (26)

1. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosén. On-line competitive algorithms for call admission in optical networks. Algorithmica, 31(1):29-43, 2001.
2. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive non-preemptive call control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), pages 312-320, 1994.
3. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from wavelength-routing in all-optical networks. In Proceedings of IPPS'97, Second Workshop on Optics and Computer Science (WOCS), 1997.
4. C. Chekuri, M. Mydlarz, and F. Shepherd. Multicommodity demand flow in a tree. In Proceedings of the 30th International Colloquium on Automata, Languages, and Programming (ICALP'03), LNCS 2719, pages 410-425, 2003.
5. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica, 21(1):5-12, 2001.
6. T. Erlebach and K. Jansen. Maximizing the number of connections in optical tree networks. In Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC'98), LNCS 1533, pages 179-188, 1998.
7. T. Erlebach and K. Jansen. The complexity of path coloring and call scheduling. Theoretical Computer Science, 255(1-2):33-50, 2001.
8. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal wavelength routing in directed fiber trees. Theoretical Computer Science, 221:119-137, 1999.
9. T. Erlebach, A. Pagourtzis, K. Potika, and S. Stefanakos. Resource allocation problems in multifiber WDM tree networks. TIK-Report 178, Computer Engineering and Networks Laboratory (TIK), ETH Zürich, August 2003.
10. A. Ferreira, S. Perennes, A. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. In Proc. AlgoTel'02, pages 25-32, Mèze, France, May 2002.
11. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3-20, 1997.
12. L. Gargano and U. Vaccaro. Routing in all-optical networks: Algorithmic and graph-theoretic problems. In I. Althöfer et al., editors, Numbers, Information and Complexity, pages 555-578. Kluwer Academic Publishers, 2000.
13. M. C. Golumbic and R. E. Jamison. The edge intersection graphs of paths in a tree. J. Comb. Theory Series B, 38(1):8-22, February 1985.
14. P. E. Green. Fiber Optic Networks. Prentice Hall, Englewood Cliffs, NJ, 1993.
15. R. Klasing. Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Department of Computer Science, University of Warwick, September 1998. Presented as invited talk at the MFCS'98 Workshop on Communications.
16. G. Li and R. Simha. On the wavelength assignment problem in multifiber optical tree networks. In Terabit Optical Networking: Architecture, Control, and Management Issues, number 4213 in Proceedings of SPIE, pages 84-91, November 2000.
17. G. Li and R. Simha. On the wavelength assignment problem in multifiber WDM star and ring networks. IEEE/ACM Transactions on Networking, 9(1):60-68, 2001.
18. L. Margara and J. Simon. Wavelength assignment problem on all-optical networks with k fibres per link. In Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP 2000), LNCS 1853, pages 768-779, 2000.
19. L. Margara and J. Simon. Decidable properties of graphs of all-optical networks. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP'01), LNCS 2076, pages 518-529, 2001.
20. C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos. Path multi-coloring in weighted graphs. In Proceedings of the 8th Panhellenic Conference on Informatics, volume I, pages 178-186, Nicosia, Cyprus, November 2001.
21. C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos. Fiber cost reduction and wavelength minimization in multifiber WDM networks. Manuscript, 2003.
22. C. Nomikos, A. Pagourtzis, and S. Zachos. Routing and path multicoloring. Information Processing Letters, 80(5):249-256, 2001.
23. P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC'94), pages 134-143, 1994.
24. R. Ramaswami and K. N. Sivarajan. Routing and wavelength assignment in all-optical networks. IEEE/ACM Transactions on Networking, 3(5):489-500, October 1995.
25. P.-J. Wan and L. Liu. Maximal throughput in wavelength-routed optical networks. In Multichannel Optical Networks: Theory and Practice, volume 46 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 15-26. AMS, 1998.
26. P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), pages 830-831, 2003.