This thesis considers a logical connectivity problem for lightwave network in star architecture where wavelength division multiplexing and multihop transmission are performed. Such a logical connectivity characterized by an assignment of wavelengths to the transmitters and receivers of each node. This thesis is to propose a new type of wavelength assignment problem where with traffic, glass distances between nodes, and number of transceivers all given, (i) transceiver allocation, (ii) logical connection diagram(achieved by wavelength assignment) and (iii) partitioning the flow of the traffic among the logical links created (the routing problem) over the network are jointly determined to minimize the mean propagation delay of the network. The problem is expressed in a mixed-integer programming, for which a heuristic algorithm is proposed based on a hygreedy type of search. This effectiveness of the algorithm is numerically tested in comparison with lower bounds.
