Traffic grooming and wavelength conversion in optical networks

Abstract

This manuscript has been reproduced from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer.The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction.In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps.

A generalized framework for analyzing time-space switched optical networks

“…Earlier work on WDM grooming networks concentrate on performance analysis of fixed-path (shortest-path) rout ing strategies with random wavelength assignment [27]. However, there has been very little or no significant research can be found in the literature on dynamic routing in WDM grooming networks.…”

“…Analytical models that account for dynamic routing based on up-to-date network status are complex, hence have received very little attention [26]. Analytical model for WDM/TDM networks can be found in [9,27].…”