Optical Networks: A Practical Perspective - Part 73. This book describes a revolution within a revolution, the opening up of the capacity of the now-familiar optical fiber to carry more messages, handle a wider variety of transmission types, and provide improved reliabilities and ease of use. In many places where fiber has been installed simply as a better form of copper, even the gigabit capacities that result have not proved adequate to keep up with the demand. The inborn human voracity for more and more bandwidth, plus the growing realization that there are other flexibilities to be had by imaginative use of the fiber, have led people. | 690 Deployment Considerations Table Traffic matrix for the long-haul mesh network case study. The fiber topology is shown in Figure a . The traffic is shown in terms of the number of 10 Gb s wavelengths between pairs of nodes in the upper-right triangle of this matrix. Node Node Destination Node Number Total Number Name 12 3 4 5 6 7 8 91011 12 13 141516171819 Traffic 1 Seattle 0222212331 3 3 2 1 3 3 2 3 3 41 2 San Francisco 0032333321 1 1 1 1 1 2 3 2 1 35 3 Los Angeles 0001123113 1 2 1 3 1 1 3 1 3 33 4 Salt Lake City 0000211321 2 3 1 2 1 2 2 3 1 32 5 El Paso 0000012322 3 2 1 1 3 2 1 2 1 34 6 Denver 0000002232 1 3 2 2 3 1 1 2 2 34 7 Houston 0000000132 2 3 3 3 3 2 3 2 1 41 8 Dallas 0000000012 1 3 1 2 1 3 1 1 1 33 9 Kansas City 0000000001 2 3 3 1 1 2 3 1 1 35 10 Chicago 0000000000 1 3 2 2 3 3 3 3 1 36 11 Nashville 0000000000 0 2 3 3 1 2 2 3 1 34 12 Atlanta 0000000000 0 0 2 1 2 3 1 1 2 40 13 Tampa 0000000000 0 0 0 3 2 1 2 2 3 35 14 Miami 0000000000 0 0 0 0 2 1 2 2 1 33 15 Charlotte 0000000000 0 0 0 0 0 1 1 1 2 32 16 Philadelphia 0000000000 0 0 0 0 0 0 2 1 1 33 17 New York 0000000000 0 0 0 0 0 0 0 2 3 37 18 Boston 0000000000 0 0 0 0 0 0 0 0 2 34 19 Cleveland 0000000000 0 0 0 0 0 0 0 0 0 30 as ultra-long-haul ULH systems. We also look at the benefits of different types of protection architectures. The network of Figure a has 19 nodes and 28 links interconnecting the nodes. Table shows the assumed traffic matrix between the various nodes in terms of 10 Gb s channels. The total end-to-end traffic amounts to Tb s and represents a fairly realistic network in the 2002-2003 time frame. The first step in the design process is to route the end-to-end traffic and determine the amount of working and protection capacity required. Sophisticated algorithms are used to perform this function in practice but we use fairly simple algorithms for this study. For 1 1 protection we have to calculate a pair of working and protection paths which are node disjoint that
