Routing and wavelength assignment (RWA) problems in wavelength-routed optical networks are typically solved using a combination of integer programming and graph coloring. Such techniques are complex and make extensive use of heuristics. We explore an alternative solution technique in the well-known maximum edge disjoint paths (EDP) problem which can be naturally adapted to the RWA problem. Maximum EDP is NP-hard, but now it is known that simple greedy algorithms for it are as good as any of the more complex heuristic solutions. In this paper we investigate the performance of a simple greedy maximum edge disjoint paths algorithm applied to the RWA problem and compare it with a previously known solution method.
Abstract-In this paper, we analyze the dispersion characteristics of an optical fiber having linear chirp type refractive index profile. The chirp type profile is general in nature and by controlling the profile parameters, one can obtain a wide range of profiles from simple step index to complex multiple cladded type. The problem is treated as an optimization problem in the profile parameter space. It is shown that a variety of dispersion characteristics can be realized with proper optimization of the profile parameters. Linear finite element method (LFEM) is employed for computing the modal fields and propagation constants. Tolerance analysis of the fiber dispersion characteristics and bending loss calculation are also carried out.
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.