Optimal placement of wavelength converters in trees and trees of rings

Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

Volumn , Issue , 1999, Pages 392-397

  Wan, Peng Jun ^a   Liu, Liwu ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

minimum vertex cover; tree; tree of rings; wavelength converter; Wavelength routed optical network

Indexed keywords

COMPUTER NETWORKS; FIBER OPTIC NETWORKS; OPTICAL COMMUNICATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION INDUSTRY; TOPOLOGY;

MINIMUM VERTEX COVER; TREE; TREE OF RINGS; WAVELENGTH CONVERTER; WAVELENGTH ROUTED OPTICAL NETWORKS;

FORESTRY;

EID: 0242292660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.1999.805548     Document Type: Conference Paper

References (16)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswani, B. Schieber, and M. Sudan, "Efficient Routing and Scheduling Algorithms for Optical Networks", Proceedings of the 5th Annual ACM-SAM Symposium on Discrete Algorithms, pp. 412-423, 1994.
2. Y. Aumann and Y. Rabani, "Improved Bounds for All Optical Routing", Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 567-576, San Francisco, California, pp. 22-24 January 1995.
3. R. Ballart, Y.C. Ching, "SONET: Now It's the Standard Optical Network", IEEE Communications Magazine, pp. 8-15, March 1989.
4. J. Babcock. SONET: A Practical Perspective. In Business Communications Review, Sept. 1990: 59-63.
5. B. Baker, "Approximation algorithms for NP-complete problems on planar graphs," Proc. 24th IEEE Symp. on Foundations of Computer Science, 1983.
6. R. Bar-Yehuda, S. Even, "On approximating a vertex cover for planar graphs," Proc. 14th A CM Symp. on Theory of Computing, 1982.
7. R. Downey, M. Fellows, "Parametrized Computational Feasibility," in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhauser, 1994.
8. J. Kleinberg, A. Kumar, "Wavelength Conversion in Optical Networks", Proc. 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
9. V. Kumar, E. Schwabe, "Improved access to optical bandwidth," Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997.
10. M. Mihail, C. Kaklamanis, S. Rao, "Efficient access to optical bandwidth," Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995.
11. B. Mukherjee, Optical Communication Networks, New York: McGraw-Hill, July 1997.
12. D. Nesset, T. Kelly, and D. Marcenac, "All-Optical Wavelength Conversion Using SOA Nonlinearities", IEEE Communications Magazine, December 1998, pp. 56-61.
13. Y. Rabani, "Path-coloring on the mesh," Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996.
14. G.R. Ritchie, "SONET Lays the Roadbed for Broadband Networks", Networking Management 1990.
15. P. Raghavan, E. Upfal, "Efficient all-optical routing," Proc. 26th AGM Symp. on Theory of Computing, 1994, pp. 134-143.
16. P. Wilfong, P. Winkler, "Ring Routing and Wavelength Translation", Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, 1998.