This paper discusses a networking concept referred to as Multiple-Ring Architecture (MRA). In FDDI reliability applications, MRA is an attractive alternative to the popular dual homing architecture for the following reason. Unlike the requirement of several reliable concentrators needed in the dual homing architecture, the MRA only requires several routing interfaces at each backbone node (i.e....

The exact calculation of all-terminal network reliability is an NP-hard problem, with computational effort growing exponentially with the number of nodes and links in the network. Because of the impracticality of calculating allterminal network reliability for networks of moderate to large size, Monte Carlo simulation methods to estimate network reliability and upper and lower bounds to bound r...

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

In the design of communication networks, one of the fundamental considerations is the reliability and availability of communication paths between all terminals. Together, these form the network system reliability. The other important aspect is the layout of paths to minimize cost while meeting a reliability criterion. In this paper, a new heuristic search algorithm based on Genetic Algorithms (...

The design of the computer system was significantly changed due to the emergence and popularization of the multicore processors. Moving to the advanced multicore processors, moving to the heterogeneous computer systems and increasing of the integrity level between computer system components are the main trends of the computer systems development. Significant changes in the computer systems desi...

Let GK denote a graph G whose edges can fail and with a set K C V specified. Edge failures are independent and have known probabilities. The K-terminal reliability of GK, R(GK), is the probability that all vertices in K are connected by working edges. A factoring algorithm for computing network reliability recursively applies the formula R(GK) = piR(GK * eC) + qiR(GK e) where GK * ec is GK, wit...

the input transitions at t = t 1 and t = f Z imply a pulse at the input port Il of the component. The mechanism is illustrated through an example presented subsequently. ns and the input signals at ports A and B. Although both of the input signals at A and B are logical 1 and 2 ns in width that is much larger than t p / h = 0.5 ns, the overlapping region where both inputs are high constitutes a...

The exact calculation of all-terminal network reliability is an NP-hard problem, with computational effort growing exponentially with the number of nodes and links in the network. During optimal network design, a huge number of candidate topologies are typically examined with each requiring a network reliability calculation. Because of the impracticality of calculating all-terminal network reli...