The design of a suitable interconnection network for inter-processor communication is one of the key issues of the system performance. The reliability of these networks and their ability to continue operating despite failures are major concerns in determining the overall system performance. In this paper a new irregular network IASEN (Irregular Augmented Shuffle Exchange Network) has been propo...

Preventing the attacks in a computer network is the core problem in network security. We introduce a new game-theoretic model of the interaction between a network administrator who uses limited resource to harden a network and an attacker who follows a multistage plan to attack the network. The possible plans of the attacker are compactly represented using attack graphs, while the defender adds...

We may presume the neural networks are simplified models of the biological neurons system. The Artificial Neural Network (ANN) is an information processing system which is inspired by brain learning system. It is assumed that brain is composed of a large number of highly interconnected processing elements working in groups to solve specific problems. Various networks and algorithms have been pr...

In this paper, the notion of crosstalk-free rearrangeability (CFrearrangeability) of multistage interconnection networks (MINs) is formally defined. Using the concept of line digraphs from graph theory, we show that the problem of crosstalk-free routing on any bit permutation network (BPN) is always equivalent to the classical permutation routing problem on a BPN of smaller size and with fewer ...

AbslradThe Clos-nehuork is widely recognized as a s.ealable arehitechlre for high-performance switches and routerr. Since more contention points are introduced in the multistage network, eel1 buffers are commonly used to resolve the contention. Recently, several scheduling algorithms hare been proposed for the buffered ClosNetwork switches. These approaches will came either mis-sequence or memo...

We simulate an ATM VPI-switch with pipelined (or shared-slot data buuer) and output buuering. Our experiments for 2 2 and 4 4 switches under constant and time-variant traac indicate that both switches and memory organizations have near-optimal through-put. Assuming switches are of similar technology, multistage network experiments under constant traac indicate that 4 4 and 16 16 networks conngu...

Optical MINs hold great promise and have advantages over their electronic networks.they also hold their own challenges. More research has been done o n Electronic Multistage Interconnection Networks, (EMINs) but these days optical communication is a good networking choice to meet the increasing demands of high-performance computing communication applications for high bandwidth applications. The...

This chapter studies the cooperative broadcasting in wireless networks. We especially focus on multistage cooperative broadcasting in which the message from a source node is relayed by multiple groups of cooperating nodes. Interestingly, group transmissions become beneficial in the case of broadcasting as opposed to the case in traditional networks where receptions from different transmitters a...