Optical couplers which are composed of three channel waveguides arranged two-dimensionally are investigated numerically. The mode-matching method that matches the boundary conditions in the sense of least squares is applied to this problem, using the hybrid-modal representation. The precise numerical results of the dispersion relations and field distributions are presented for the lowest three modes near the cutoff. The arrangement of three waveguides can be optimized so as to satisfy the condition for maximum power-transfer efficiency.

Theoretical network analysis of a network constructed of "Interconnectable Star Couplers" whose all diagonal elements of transmission matrix are zero is investigated. Under certain connection rules, Interconnectable Star Coupler can be connected each other without oscillation and ghost formation. The rules are: (1) Network should not contain any loop. (2)Only single port pair should be connected between neighbor star couplers. (3)Network shold not contain any usual star coulpler. "Coupled Star Network", which is constructed under the connection rules, is able to form Cascade Star topology, Stratified Star topology and their mixed topology. It is shown that the Coupled Star Network is equivalent to a large Interconnectable Star Coupler so that bidirectional communication, which can add confidentiality to the broadcasting bus and doubles communication capacity, is available. A new configuration of Coupled Star Network using passive Interconnectable Star Couplers and optical amplifiers is proposed. This network has two separated bidirectional communication channel which can be applied for so-called Multimedia LAN. As a result of comparison between Cascade Star topology and Stratifide Star topology, it is shown that the latter topology is superior to former topology, from the view point of signal degeneration and maximum round trip delay time. Cascade Star topology, however, is superior to Stratified Star topology from the angle of total fiber length. Accordingly, optimized network topology is thought to be mixed topology of these.

We present schemes for disseminating information in the n-dimensional hypercube with some faulty nodes/edges. If each processor can send a message to t neighbors at each round, and if the number of faulty nodes/edges is k(kn), then this scheme will broadcast information from any source to all destinations within any consecutive n+[(k+l)/t] rounds. We also discuss the case where the number of faulty nodes is not less than n.

We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t1 and t2 any of these schemes can broadcast information within any consecutive logt+1N2 rounds, and for an arbitrary t they can broadcast information within any consecutive logt+1N3 rounds.