B. Mukherjee: Optical Communication Networks -- Tables

List of Tables

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


NumberTable CaptionPage
2.1Tunable optical transmitters and their associated tuning ranges and times.45
2.2 Tunable optical filters and their associated tuning ranges and times. 51
2.3 Amplifier characteristics. 57
2.4 Requirements for EDFA applications. 84
6.1 Comparison of GEMNET (GN), ShuffleNet (SN) and de Bruijn (DB) graph. (Link loads are computed under the assumption of one unit of flow between every source-destination pair and different routing schemes. Also in this table, E[h] is averaged over all the individual nodes' average hop distance (E[h_i]).) 214
7.1 Optimal number of wavelengths w* for N=120 and various values of $\lambda$ and R. 247
7.2 w*, w_L, w_H, and w_max for R=10 and various values of N and $\lambda$. 248
7.3 Delay, T, in slots, for the seven example systems. 249
8.1 Traffic matrix (in bytes per 15-minute interval). 279
8.2 Summary of experimental results. 281
8.3 Virtual topology for nodal degree P = 4 and best scaleup (106). 282
8.4 Traffic scaleups for different nodal degrees. 286
9.1 Cost of upgrading the NSFNET using WDM. 308
9.2 Average packet hop distance for different virtual topology establishment algorithms. 315
10.1 Sample numerical results for static lightpath establishment (SLE) on a 100-node random network. 334
10.2 Sample numerical results for dynamic lightpath establishment (DLE) using the LCP routing scheme on the same 100-node random network as in the static case. Same set of lightpaths as in SLE is considered, but lightpaths are made to arrive randomly. Results in this table are averaged over 10 random arrival patterns of lightpaths. 337
12.1 The CST at node A. 383
13.1 Traffic matrix no. 1, showing two communities of interest. 405
13.2 Traffic matrix no. 2, showing balanced traffic flows. 405
13.3 Traffic matrix no. 3, with each nondiagonal entry being an uniformly distributed random number between 0 and 7. 410
14.1 Static analysis via exhaustive search on the network with five access stations, 5 switches, and 22 links. 456
14.2 Static analysis with an expanded/contracted number of switches. 457
15.1 Important parameters and their values used in the amplifier-placement algorithms. 466
15.2 Number of amplifiers needed for the various amplifier-placement schemes. (Note that N = number of stations and M = number of stars for the lower bound computation. A ``*'' in column 4 indicates that the NLP solver could not perform better than the LP solution, even when it was given multiple feasible starting points, including the solutions found in [LTGC94] and [RaIM96].) 480
15.3 Exact amplifier placements for the network depicted in Fig. 15.8. 483
15.4 Transmitter and receiver powers for the network depicted in Fig. 15.8. 484


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