B. Mukherjee: Optical Communication Networks -- Figures

List of Figures

(``Optical Communication Networks''
by Biswanath Mukherjee)


NumberTable CaptionPage
1.1The low-attenuation regions of an optical fiber.6
1.2A four-channel point-to-point WDM transmission system with amplifiers.10
1.3A Wavelength Add/Drop Multiplexer (WADM).11
1.4A 4 x 4 passive star.12
1.5A 4 x 4 passive router (four wavelengths).12
1.6A 4 x 4 active switch (four wavelengths).13
1.7A passive-star-based local optical WDM network.14
1.8A wavelength-routed (wide-area) optical WDM network.16
1.9A wavelength-routed WDM network.22
2.1The low-attenuation regions of an optical fiber. 24
2.2Single-mode and multimode optical fibers.26
2.3Light traveling via total internal reflection within a fiber.27
2.4Graded-index fiber.28
2.5Numerical aperture of a fiber.28
2.6Splitter, combiner, and coupler.35
2.7A 16 x 16 passive-star coupler.36
2.8The general structure of a laser.38
2.9Structure of a semiconductor diode laser.39
2.10Free spectral range and finesse of a tunable filter capable of tuning to N different channels.47
2.11Cascading filters with different FSRs.48
2.12Structure of a Mach-Zehnder interferometer.49
2.13A semiconductor optical amplifier.54
2.14Erbium-doped fiber amplifier.55
2.15The gain spectrum of an erbium-doped fiber amplifier with input power = - 40 dBm.56
2.162 x 2 crossconnect elements in the cross state and bar state.58
2.17Schematic of optical crosspoint elements. 60
2.18A 2 x 2 amplifier gate switch.62
2.19A 4 x 4 nonreconfigurable wavelength router.63
2.20The waveguide grating router (WGR).64
2.21A P x P reconfigurable wavelength-routing switch with M wavelengths.67
2.22The staggering switch architecture.68
2.23The CORD architecture.69
2.24The HLAN architecture.70
2.25An all-optical wavelength-routed network.70
2.26Wavelength-continuity constraint in a wavelength-routed network.71
2.27Functionality of a wavelength converter.72
2.28An opto-electronic wavelength converter.73
2.29A wavelength converter based on nonlinear wave-mixing effects.74
2.30A wavelength converter using co-propagation based on XGM in an SOA.76
2.31An interferometric wavelength converter based on XPM in SOAs.76
2.32Conversion using saturable absorption in a laser.77
2.33A switch which has dedicated converters at each output port for each wavelength.79
2.34Switches which allow sharing of converters.80
2.35The share-with-local wavelength-convertible switch architecture.81
2.36Architecture which supports electronic wavelength conversion.81
2.37Broadcast-and-select WDM local optical network with a passive-star coupler network medium.86
2.38Lightpath routing in a WDM WAN.90
2.39MONET New Jersey Area Network.93
2.40ONTC testbed.95
2.41The AT&T/MIT-LL/DEC AON testbed architecture.96
2.42Critical angle in a step index fiber.98
2.43Critical angle in a graded index fiber.98
2.44Two architectures for wavelength convertible routers: (a) share-per-node, (b) share-per-link.103
2.45T=Transmitter, R=Receiver. All connections begin at transmitters and end at receivers105
3.1A broadcast-and-select WDM network.110
3.2Alternative physical topologies for a WDM local lightwave network.111
3.3Architecture of the PAC optical packet network (the dashed lines are used to detect energy on the various channels from the ``main" star).124
3.4The ALOHA/ALOHA protocol.125
3.5Bimodal throughput characteristics of the slotted-ALOHA/ delayed-ALOHA protocol for L = 10 slots per data packet and N = number of data channels.127
3.6Nonmonotonic delay characteristics of the slotted-ALOHA/ delayed-ALOHA protocol for L=10 slots per data packet, N=3 data channels, zero propagation delay, and different values of the backoff parameter K.128
3.7The extended slotted-ALOHA protocols: (a) simple case, (b) higher concurrency to reduce channel wastage. Note: $\lambda_0$ is the control channel and $\lambda_1, \lambda_2, ... , \lambda_N$ are data channels. 130
3.8The dynamic time-wavelength division multiple access (DT-WDMA) protocol. 135
3.9The multichannel bus network: (a) network structure with tunable transmitters and fixed receivers, and (b) a cycle in AMTRAC for N=4 and M=4.140
3.10Classification of single-hop network architectures.142
4.1Passive-star topology for Rainbow.150
4.2State diagram for the Rainbow model.154
4.3Timing for connection setup.156
4.4Throughput vs. arrival rate. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau$ = 1 ms, $1/\rho$ = 100 ms.160
4.5Throughput vs. message size. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau$ = 1 ms, $\sigma = 0.0001 msg/slot, $\phi = 10$ ms.161
4.6Throughput vs. timeout duration. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau = 1$ ms, $1/\rho=100$ ms.161
4.7Timeout probability vs. timeout duration. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau = 1$ ms, $1/\rho=100$ ms.162
4.8Throughput vs. timeout duration for different message lengths. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau = 1$ ms, $\sigma = 0.0001 msg/slot. 163
4.9Delay vs. throughput with parameter $\phi $. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau = 1$ ms, $\sigma = 0.0001 msg/slot, $1/\rho= 100$ ms. 164
4.10Delay vs. throughput with parameter $\sigma $. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau = 1$ ms, $1/\rho= 100$ ms, $\phi = 10$ ms. 165
4.11Delay vs. throughput for varying message size. Slot = 1 microsecond, N=32, R=50 microsecond, $\tau = 1$ ms, $\sigma = 0.0001 msg/slot, $\phi = 10$ ms. 165
4.12Throughput vs. timeout duration for different number of stations. Slot = 1 microsecond, R=50 microsecond, $\tau = 1$ ms, $\sigma = 0.0001 msg/slot, $1/\rho= 100$ ms. 166
5.1An example four-node multihop network: (a) physical topology, (b) logical topology.172
5.2A (2,2) ShuffleNet.177
5.3A (2,3) de Bruijn graph.182
5.4A 4 x 6 Manhattan Street Network (MSN) with unidirectional links.184
5.5A (2,4) ShuffleNet.185
5.6An eight-node binary hypercube.187
5.7A linear dual-bus network.189
5.8Classification of multihop network architectures.196
5.9The (10-node) Peterson graph.199
5.10A bidirectional ring network.199
6.1A 10-node (2,5,2) GEMNET.205
6.2Bounds and average hop distance for a P=2, 64-node GEMNET with different values of K.212
6.3Growing a (1,6,2) GEMNET by one node.216
7.1Delay behavior of a shared-channel, WDM, multihop network with changes in load $\lambda$ and number of available wavelengths w.221
7.2Logical assignment of wavelengths in an eight-node network arranged as a ShuffleNet with K=2 and P=2: (a) nonshared case where w=2N=16; (b) shared case where w=8 < 2N.223
7.3Twelve-node SC_GEMNETs, along with corresponding timing diagrams, for various values of w: (a) w=12; (b) w=6; (c) w=4; (d) w=3; and (e) w=2. (Note: unless otherwise shown, all links are directed from left to right.)228
7.4A (3,2) complete Moore graph.233
7.5Effects of sharing on multicasting in a (3,2) complete, Moore graph. The source node is node 1 and the destination nodes are nodes 2, 3, 6, and 7: (a) nonshared case; (b) shared-channel case.234
7.6Various delay components vs. number of wavelengths in a 12-node network with R=2 and $\lambda$ = 0.05.239
7.7Average delay vs. number of wavelengths in a 12-node network with R=2 and various load values. Marked points indicate values of admitting equal sharing of the available bandwidth among the 12 nodes when each node has a single transmitter-receiver pair.241
7.8Upper (w_H) and lower (w_L) bounds on the number of channels admitting stability and optimal number of channels (w*) vs. the load in a 12-node network. Note that the curves for R=1 and R=0 are identical; therefore only one of them is shown.242
7.9Average delay, T, vs. number of wavelengths, w, for various values of propagation delay in a 120-node network: (a) $\lambda$ = 0.001; (b) $\lambda$ = 0.005; (c) $\lambda$ = 0.01; (d) $\lambda$ = 0.05.244
7.10Average delay, T, vs. number of wavelengths, w, for various values of load in a 120-node network: (a) R=0; (b) R=1; (c) R=10; (d) R=100.245
7.11Upper (w_H) and lower (w_L) bounds on the number of channels admitting stability and optimal number of channels (w*) vs. load in a 120-node network.246
7.12Delay vs. load for Systems A through F: (a) m=1; (b) m=5; (c) m=20; (d) m=36.251
7.13Ratio of maximum throughput at a given m to the maximum throughput at m=1.252
7.14A (2,2) complete Moore graph.255
7.15A (4,2) incomplete Moore graph.255
8.1NSFNET T1 backbone, 1991. ( \copyright Merit Network, Inc. )262
8.2Modified physical topology.266
8.3A 16-node hypercube virtual topology embedded on the NSFNET physical topology.267
8.4Details of the Utah (UT) node.268
8.5The physical topology with embedded wavelengths corresponding to an optimal solution (more than one transceiver at any node can tune to the same wavelength).269
8.6The physical topology with embedded wavelengths corresponding to an optimal solution (all transceiver pairs at any node must be tuned to different wavelengths).269
8.7Delay vs. throughput (scaleup) characteristics with no WDM, i.e., physical topology as virtual topology.283
8.8Delay vs. throughput (scaleup) characteristics with WDM used on some links, but no WRSs, i.e., multiple point-to-point links are allowed on the physical topology.284
8.9Delay vs. throughput (scaleup) characteristics with full WDM on some links and a WRS at each node, i.e., arbitrary virtual topologies are allowed.284
8.10Delay vs. throughput (scaleup) characteristics for different virtual topologies.285
8.11Distributions of the number of wavelengths used in each of the 21 fiber links of the NSFNET for the virtual topology approach with nodal degree P = 4, 5, and 6.287
9.1NSFNET T1 backbone.293
9.2Optimal solution for a two-wavelength and a five-wavelength network. Each physical link consists of two unidirectional fibers carrying transmissions in opposite directions (hence, each wavelength may appear twice on any link in the diagrams; their signal propagation directions are opposite to each other in such cases). Wavelength 0 is used to embed the physical topology over the virtual topology, so the Wavelength-0 lightpaths are not shown explicitly in these diagrams to preserve clarity. Note: $\circ$ = transmitter; $\bullet$ = receiver. 294
9.3Transport node in the RACE WDM optical network architecture.306
9.4Average packet hop distance for the optimal solution.311
9.5Average transceiver utilization for the optimal solution.312
9.6Average wavelength utilization for the optimal solution.312
9.7Comparison of heuristic algorithms for a four-wavelength network.314
9.8Reconfiguration statistics.316
9.9Physical network topology.318
9.10Physical network topology.319
10.1Lightpath routing in an all-optical network.322
10.2Effect of nodal degree d (for K=2 alternate paths) on wavelength routing.335
10.3Effect of number of connections on link congestion.338
10.4Connection requests.340
11.1An all-optical wavelength-routed network.342
11.2Wavelength-continuity constraint in a wavelength-routed network.343
11.3Functionality of a wavelength converter.344
11.4A switch which has dedicated converters at each output port for each wavelength.345
11.5Switches which allow sharing of converters.346
11.6Wavelength conversion for distributed network management.350
11.7Blocking probabilities for different loads in a 10-node optical ring with sparse nodal conversion.358
11.8NSFNET with the number of convertible routes shown. A number on a link indicates how many source-destination paths passed through the previous node and possibly could have been converted. A number next to a node indicates how many source-destination paths pass through the node and can possibly be wavelength converted.359
11.9Blocking probabilities in the NSFNET for optimal and heuristic placement of wavelength converters (30 ERLANG load).360
11.10Comparison of blocking probabilities in the NSFNET when using full conversion and no conversion in the network with the Best-Fit algorithm.362
11.11Percent gain in the NSFNET from using full-conversion at every node as opposed to no conversion in the network.362
11.12Distribution of the number of wavelength converters utilized at node 2 in the NSFNET (30 ERLANG load).363
11.13Network with uniform loading.366
12.1Implementation of the circuit-migration sequence.381
12.2Network architecture for distributed control and management.382
12.3The AT&T testbed architecture.388
12.4The Bellcore all-optical network architecture.390
12.5Transport node in the RACE architecture.392
13.1The WDDI ring network.400
13.2WDDI node and bridge interfaces.403
13.3Delay versus N characteristics for two-server traffic (W=2).420
13.4Delay versus N characteristics for clustered traffic, c=2, k=5 (W=2).422
13.5Delay versus N characteristics for pseudo-random traffic (W=2).423
13.6Delay versus throughput characteristics (W=2).424
13.7Delay vs. throughput characteristics for multiple partitions for MIN-DIFF-based algorithms.426
13.8Delay vs. number of partitions for MIN-DIFF-based algorithms.426
13.9Delay vs. throughput characteristics for multiple partitions for MIN-CROSS-based algorithms.428
13.10Delay vs. number of partitions for MIN-CROSS-based algorithms.428
14.1EDFA gain curve.433
14.2Wavelength routing using AOTF.434
14.3Wavelength-routed network with $\Lambda_0$ cycles.436
14.4An example five-station, five-switch subgraph of the NSFNET T3 backbone. This network is used for the example ``static'' analysis results.437
14.5A (random) four-station, eight-switch network generated by Module 1. Note that this network contains $\Lambda_0$ cycles (as indicated by dashed and dotted lines) when all switches are in BAR state.438
14.6Flow chart of modules.439
14.7Network after elimination of $\Lambda_0$ cycles using Module 3.448
14.8Network after establishing two connections -- heavy lines -- (from station 2 to station 4 and from station 4 to station 3) using Module 4. However, a new connection -- dashed heavy line -- (from station 3 to station 1) is causing a $\Lambda_k$ cycle -- dashed light line.448
14.9Network after elimination of $\Lambda_k$ cycles using Module 5.449
14.10Fraction of unblocked calls vs. M for the 5-station, 17-link network.452
14.11Probability of resource blocking vs. M for the 5-station, 17-link network.452
14.12Probability of crosstalk blocking vs. M for the 5-station, 17-link network.453
14.13Fraction of unblocked calls vs. M for the 14-station, 56-link network.454
14.14Probability of resource blocking vs. M for the 14-station, 56-link network.454
14.15Probability of crosstalk blocking vs. M for the 14-station, 56-link network.455
14.16Network for Problem 14.1.459
14.17Network for Problems 14.2 and 14.3.460
14.18Network for Problem 14.4.461
15.1Example of a passive-star-based optical metropolitan-area network (slightly modified version of the one used in [LTGC94]).464
15.2Example of a nonreflective star.465
15.3Two examples of powers on three wavelengths passing through a fiber.467
15.4Simple two-star network that needs no amplifiers to operate.468
15.5Original amplifier gain model approximations used in previous studies [LTGC94].470
15.6More-accurate amplifier gain model used in this study.471
15.7Mid-sized tree-based network needing no amplifiers to function.481
15.8A possible MAN network.482
15.9A scaled-up version of the MAN network in Fig. 15.8.485
15.10A scaled-down version of the MAN network in Fig. 15.8.485
15.11A sample switched network.487
15.12A cascade of amplifiers along a link.489
15.13Network for Problems 15.5 and 15.6.490
15.14A portion of a network.491
15.15A distribution network.492
16.1A TDM link and multiplexer.495
16.2Generation of the OTDM signal: packet compression.498
16.3Evolution of a nonhyperbolic secant pulse in a fiber.502
16.4Evolution of a hyperbolic secant pulse in a fiber.502
16.5All-optical clock recovery system (BPF = band-pass filter, PC = polarization controller) [BCHK96].503
16.6The HLAN architecture.505
16.7The staggering switch architecture.506
16.8The CORD architecture.507
16.9A pseudo-random sequence generator.511
16.10A CDMA receiver.512
16.11Original data streams and coded, transmitted streams.513
16.12Combined signals on data channel.514
16.13Decoded sequence consisting of original signal and pseudo-noise.515
16.14Decoded sequence with varying number of overlapping signals.516
16.15Implementation of a CDMA coder and decoder based on optical splitters and combiners.517
16.16Optical time-spreading CDMA.519
16.17CDMA codes.521


Back to:
``Optical Communication Networks'' Homepage
B. Mukherjee's Homepage


Please report questions, comments, errors, or problems to
Biswanath Mukherjee (mukherjee@cs.ucdavis.edu)
Last updated: July 29, 1997