In this paper, it is shown that for a given p (1 < p 5 n ) , the n-cube network can tolerate up to p2,-P -1 processor failures and remains connected provided that at most p neighbors of any nonfaulty processor are allowed to fail. This generalizes the result for p = n -1, obtained by Esfahanian [l]. We also show that the n-cube network with n 2 5 remains connected provided that at most two neighbors of any processor are allowed to fail.

Convergence of manufacturing industry and ICT becomes a new competence and it is

No abstract

I n this paper, we study the problem of optimal transmission schedules f o r embedding complete graphs in WDM broadcast-and-select networks. A n optimal transmission schedule is defined to be the one that schedules transmissions such that each node transmits once to every other node within a repeating cycle of minimum length. Our model assumes that the network has N nodes with k wavelength channels, and each node is equipped with multiple tunable transmztters and multiple fixed-tuned receivers. Given a and p (1 5 a , p 5 k ) , we first obtain an optimal transmission schedule with schedule length max{*, P(N -1) + kd} such that each node transmits to each of zts nezghboring nodes exactly cup times withzn this time period assuming that each node has a single transmitter and a single receiver. Using this result, we next show that there exists an optzmal transmisszon schedule with average schedule length max{ , + $8) when each node has a transmitters and P receivers. W e then discuss an O(1og k) algorithm to compute optimal numbers of transmitters and recezvers t o minimize the overall cost of transmitters and receivers in the network while meeting a given bound of schedule length. 0-8186-7591-8/96 $5.00 0 1996 IEEE Proceedings of MPPOI '96

No abstract