Optical Networks - _Problems9_123

Optical Networks - _Problems9_123 - Problems 619 As...

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

View Full Document Right Arrow Icon
Problems 619 As mentioned in Section 10.2.2, there are two common methods for computing disjoint paths. One method first computes a shortest path and then a second path that avoids the first. Since there may be multiple shortest paths, multiple candidate disjoint paths can be computed and the best chosen from among them. Algorithms that solve the k shortest paths problem [Yen71] can be used to generate multiple candidate paths. The other method to compute disjoint paths is to use an algorithm that solves the minimum disjoint path problem [Suu74, ST84]. A reference that discusses disjoint paths when SRLGs are considered is [Bha99]. The statistical blocking model for dimensioning is analyzed in [SS00, BK95, RS95, KA96, SAS96, YLES96, BH96]. The worst-case analysis of the maximum load model with online traffic is con- sidered in [GK97]. Problems 10.1 In general, there are several valid design options even for a three-node network. Consider the designs shown in Figure 10.1(c), but now assume that the number of dropped lightpaths is six instead of five as discussed in the text. The advantage of this design is that it provides more flexibility in handling surges in A–B and B–C traffic. For example, this design not only can handle the traffic requirement of 50 Gb/s between every pair of nodes, it can also handle a traffic requirement of 60 Gb/s between nodes A–B and B–C, and 40 Gb/s between nodes A–C. This latter traffic pattern cannot be handled if only five lightpaths/wavelengths are dropped. Consider the design of Figure 10.1(c), and assume that x wavelengths are dropped at node B and y wavelengths pass through. Determine the range of traffic matrices that this design is capable of handling as a function of x and y . 10.2 Consider the network design approach using fixed-wavelength routing in a four-node ring network with consecutive nodes A, B, C, and D. Suppose the traffic requirements are as follows: ABCD A –3–3 B 3–23 C –2–2 D 332– (a) Do a careful routing of traffic onto each wavelength so as to minimize the number of wavelengths needed.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/15/2011 for the course ECE 6543 taught by Professor Boussert during the Spring '09 term at Georgia Institute of Technology.

Page1 / 4

Optical Networks - _Problems9_123 - Problems 619 As...

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

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