Optical Networks - _References10_124

Optical Networks - _References10_124 - References 623 B A C...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
References 623 A C D E B Figure 10.22 Network topology for Problem 10.26. Gb/s B C D E A1 5 2 5 5 1 5 B 5 35 15 C1 5 2 5 D5 (a) Assuming OC-192c (10 Gb/s) trunks are used, complete an equivalent table for the required number of lightpaths (that is, wavelengths) between each pair of nodes. (b) Using the given physical topology, and assuming that there are no wave- length conversion capabilities contained within the optical crossconnects at the nodes, specify a reasonable wavelength-routing design for each light- path. Clearly label each wavelength along its end-to-end path through the network. (c) What is the maximum load on any link in the network, and how does it compare with the number of wavelengths you are using in to- tal? References [ABC + 94] A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Proceedings of 5th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 412–423, Jan. 1994. [ACKP97] V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano. Bandwidth allocation algorithms on tree-shaped all-optical networks with wavelength converters. In
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
624 WDM Network Design Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity , 1997. [AMO93] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications . Prentice Hall, Englewood Cliffs, NJ, 1993. [Bal96] K. Bala et al. WDM network economics. In Proceedings of National Fiber Optic Engineers Conference , pages 163–174, 1996. [Ber76] C. Berge. Graphs and Hypergraphs . North Holland, Amsterdam, 1976. [Ber96] J.-C. Bermond et al. Efficient collective communication in optical networks. In 23rd International Colloquium on Automata, Languages and Programming—ICALP ’96, Paderborn, Germany, pages 574–585, 1996. [BG92] D. Bertsekas and R. G. Gallager. Data Networks . Prentice Hall, Englewood Cliffs, NJ, 1992. [BG95] D. Bienstock and O. Gunluk. Computational experience with a difficult mixed-integer multicommodity flow problem. Mathematical Programming , 68:213–237, 1995. [BH96] R. A. Barry and P. A. Humblet. Models of blocking probability in all-optical networks with and without wavelength changers. IEEE JSAC/JLT Special Issue on Optical Networks , 14(5):858–867, June 1996. [Bha99] R. Bhandari. Survivable Networks: Algorithms for Diverse Routing .K luwer Academic Publishers, Boston, MA, 1999.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

Optical Networks - _References10_124 - References 623 B A C...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online