Optical Networks - _Problems9_123

2 ? 1 ? 2 ? 1 ? 2 ? 1 ? 2 ? 3 ? 4 ? 3 ? 4 ? 3 ? 4 a b

Info icon This preview shows pages 3–4. Sign up to view the full content.

2 λ 1 λ 2 λ 1 λ 2 λ 1 λ 2 λ 3 λ 4 λ 3 λ 4 λ 3 λ 4 A B C A B C Figure 10.21 Two different scenarios of wavelength assignment in networks with bidi- rectional links. 10.11 Show that a network having P fiber pairs between nodes and W wavelengths on each fiber with no wavelength conversion is equivalent to a network with one fiber pair between nodes with PW wavelengths, and degree P wavelength conversion capability at the nodes. 10.12 Generalize the example of Figure 10.13 to the case when the number of nodes is arbitrary, say, N . Compare the number of wavelengths required in this general case to the upper bound given by Theorem 10.1. 10.13 In order to prove that W ( 2 L 1 ) M L + 2 in Theorem 10.1, we supposed that there were K lightpaths of length M hops. Instead, suppose there are K(x) lightpaths of length x hops, and derive an upper bound for W that holds for every x . Now, optimize x to get the least upper bound for W . Compare this bound with the bound obtained in Theorem 10.1. 10.14 Show that Algorithm 10.3 always does the wavelength assignment using L wave- lengths. Hint: Use induction on the number of nodes. 10.15 Consider the following modified version of Algorithm 10.3. In step 2, the algorithm is permitted to assign any free wavelength from a fixed set of L wavelengths, instead of the least numbered wavelength. Show that this algorithm always succeeds in performing the wavelength assignment. 10.16 Prove that Theorem 10.3 can be tight in some cases. In other words, give an example of a ring network and a set of lightpath requests and routing with load L that requires 2 L 1 wavelengths. Hint: First, give an example that requires 2 L 2 wavelengths and then modify it by adding an additional lightpath without increasing the load. Note that the example in Figure 10.19 shows such an example for the case L = 2 . Obtain an example for the case L > 2 .
Image of page 3

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

622 WDM Network Design 10.17 Consider a ring network with a lightpath request set of one lightpath between each source-destination pair. Compute the number of wavelengths sufficient to support this set with full wavelength conversion and without wavelength conversion. What do you conclude from this?
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '09
  • Boussert
  • Wavelength, Shortest path problem, Standing wave, Network topology, Wavelength Assignment

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern