Traffic grooming in WDM optical networks is one of the most important and hot problem in the area of optical networks. We first systematically investigated the grooming problems in WDM optical tree networks with traffic requirements in this thesis. We first propose the genetic algorithms(GA) to deal with a variety of grooming problems in tree networks, and propose the connection model of optical tree networks, and apply the technology of wavelengths-reuse in the decoding of the individual in the genetic algorithms, and get good grooming results.
Connectivity of a network dictates the routability and survivability of a network. Thispaper is to investigate the edge connectivity problems in distributed environments. For a given networkorgraph G, one can distributivelyfindbridges in the networkfirst thenfind the 2-edge conneted components. Both algorithmsproposed in this paper, bridgefinding and 2-edge connected component identifying, require only O(m) message complexity, where m is the number of edges in G. Besides, this paper also shows an efJicient distributed 2-edge cutset algorithm that has O(n message complexity, where n is the number of nodes in G.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.