Download presentation
Presentation is loading. Please wait.
Published byHugh Preston Modified over 5 years ago
1
The University of Adelaide, School of Computer Science
8 November 2018 Optical Networks: A Practical Perspective, 3rd Edition Chapter 6 Client Layers of the Optical Layer Copyright © 2010, Elsevier Inc. All rights Reserved Chapter 2 — Instructions: Language of the Computer
2
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.1 Chapter 6 Figure 6.1 Comparison of asynchronous and synchronous multiplexing. (a) In the asynchronous case, demultiplexers must be stacked up to extract a lower-speed stream from a multiplexed stream. (b) In the synchronous case, this can be done in a single step using relatively simple circuitry. Copyright © 2010, Elsevier Inc. All rights Reserved
3
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.2 Chapter 6 Figure 6.2 The mapping of lower-speed asynchronous streams into virtual tributaries in SONET. Copyright © 2010, Elsevier Inc. All rights Reserved
4
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.3 Chapter 6 Figure 6.3 The use of pointers in a SONET STS-1 signal carrying virtual tributaries (VTs). The STS payload pointer in the transport overhead points to the STS-1 synchronous payload envelope (SPE) and the VT pointer inside the STS-1 SPE points to the VT SPE. Copyright © 2010, Elsevier Inc. All rights Reserved
5
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.4 Chapter 6 Figure 6.4 SONET/SDH layers showing terminations of the path, line, and section layers for a sample connection passing through terminalmultiplexers (TMs) and add/drop multiplexers (ADMs). The physical layer is not shown. Copyright © 2010, Elsevier Inc. All rights Reserved
6
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.5 Chapter 6 Figure 6.5 Structure of an STS-1 frame. B denotes an 8-bit byte. Copyright © 2010, Elsevier Inc. All rights Reserved
7
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.6 Chapter 6 Figure 6.6 Structure of an STS-N frame, which is obtained by byte-interleaving N STS-1 frames. Copyright © 2010, Elsevier Inc. All rights Reserved
8
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.7 Chapter 6 Figure 6.7 SONET overhead bytes. Entries of the form X/Y indicate that the first label X applies to the first STS-1 within an STS-N signal and the second label Y applies to the remaining STS-1’s in the STS-N. Copyright © 2010, Elsevier Inc. All rights Reserved
9
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.8 Chapter 6 Figure 6.8 Elements of a SONET infrastructure. Several different SONET configurations are shown, including point-to-point, linear add/drop, and ring configurations. Both access and interoffice (backbone) rings are shown. The figure also explains the role of a DCS in the SONET infrastructure, to crossconnect lower-speed streams, to interconnect multiple rings, and to serve as a node on rings by itself. Copyright © 2010, Elsevier Inc. All rights Reserved
10
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.9 Chapter 6 Figure 6.9 Different types of crossconnect systems. Copyright © 2010, Elsevier Inc. All rights Reserved
11
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.10 Chapter 6 Figure 6.10 OTN hierarchy. Copyright © 2010, Elsevier Inc. All rights Reserved
12
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.11 Chapter 6 Figure 6.11 OTN (G.709) frame (a) structure showing the location of the overhead bytes, and (b) a larger view of the overhead bytes. Copyright © 2010, Elsevier Inc. All rights Reserved
13
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.12 Chapter 6 Figure 6.12 GFP relationship with clients and optical transport paths. Copyright © 2010, Elsevier Inc. All rights Reserved
14
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.13 Chapter 6 Figure 6.13 GFP frame structure. Copyright © 2010, Elsevier Inc. All rights Reserved
15
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.14 Chapter 6 Figure 6.14 Ethernet topologies. Copyright © 2010, Elsevier Inc. All rights Reserved
16
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.15 Chapter 6 Figure 6.15 (a) Basic Ethernet frame and (b) VLAN Ethernet frame. Copyright © 2010, Elsevier Inc. All rights Reserved
17
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.16 Chapter 6 Figure 6.16 (a) An Ethernet spanning tree and (b) a tree showing the root, root ports, and designated ports. Copyright © 2010, Elsevier Inc. All rights Reserved
18
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.17 Chapter 6 Figure 6.17 Provider bridges (Q-in-Q) for VLANs, and the Ethernet frame structures. Copyright © 2010, Elsevier Inc. All rights Reserved
19
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.18 Chapter 6 Figure 6.18 Provider backbone bridges (Mac-in-Mac) for VLANs, and the Ethernet frame address and tag information. Copyright © 2010, Elsevier Inc. All rights Reserved
20
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.19 Chapter 6 Figure 6.19 IP in the layered hierarchy, working along with a variety of data link layers and transport layers. Copyright © 2010, Elsevier Inc. All rights Reserved
21
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.20 Chapter 6 Figure 6.20 Various implementations of IP over WDM. (a) A packet-over-SONET (POS) variant, where IP packets are mapped into PPP frames then an HDLC-like framing and scrambling, and finally into SONET frames. (b) IP packets are mapped into PPP frames, and then framed using the Generic Framing Procedure (GFP) before mapped into a SONET or OTN path. (c) Using Gigabit or 10-Gigabit Ethernet media access control (MAC) as the link layer and Gigabit or 10-Gigabit Ethernet physical layer (PHY) for encoding the frames for transmission over a wavelength. Copyright © 2010, Elsevier Inc. All rights Reserved
22
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.21 Chapter 6 Figure 6.21 Routing in an IP network. The routing tables at some of the nodes are also shown. The tables contain the identity of the next hop node for each destination. Copyright © 2010, Elsevier Inc. All rights Reserved
23
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.22 Chapter 6 Figure 6.22 (a) A simple LSP X and (b) an LSP tunnel Y for an LSP X. Copyright © 2010, Elsevier Inc. All rights Reserved
24
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.23 Chapter 6 Figure 6.23 (a) AnMPLS label and (b) a stack of LSP labels prepended to an IP packet. Copyright © 2010, Elsevier Inc. All rights Reserved
25
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.24 Chapter 6 Figure 6.24 Ringlets 0 and 1 of a Resilient Packet Ring. Copyright © 2010, Elsevier Inc. All rights Reserved
26
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.25 Chapter 6 Figure 6.25 An RPR node. Copyright © 2010, Elsevier Inc. All rights Reserved
27
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.26 Chapter 6 Figure 6.26 Node structure for Ringlet 0 for the case of two transit queues: primary transit queue (PTQ) and secondary transit queue (STQ). The STQ is optional. Copyright © 2010, Elsevier Inc. All rights Reserved
28
Copyright © 2010, Elsevier Inc. All rights Reserved
Figure 6.27 Chapter 6 Figure 6.27 Architecture of a storage-area network. Copyright © 2010, Elsevier Inc. All rights Reserved
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.