The purpose of this write-up is to compare multistage filters [3] and sketches with respect to their ability to identify heavy hitters. In a nutshell, the conclusion is that multistage filters as I use them identify heavy hitters with less memory than sketches, but some sketches support important other operations, more specifically they can be added and subtracted without any need to re-read th...

In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n) compared to its propagation delay O(n) only. Here, we attempt to identify the sets of permutations, which are routable in O(n) time in these networks. We de®ne four classes of self-routable permutations for Benes network. An O(n) algorithm is presented here, that identi®es if any permutation P belongs...

Optimizing interconnection networks is a prime object in switching schemes. In this work the authors present a novel approach for obtaining a required channel arrangement in a multi-stage interconnection network, using a new concept – a fundamental arrangement. The fundamental arrangement is an initial N-1 stage switch arrangement that allows obtaining any required output channel arrangement gi...

ATM switch architectures based on deflection routing are here examined, described in terms of a general switch model and compared with regards to their internal operations. Their common feature is the availability of multiple I/O paths through a multistage unbuffered interconnection network where conflicts for the same interstage link are dealt with by deflecting packets onto the wrong path. Th...

This paper considers a multistage interconnection network based on the Indirect Star Graph topology as a candidate for an ATM (Asynchronous Transfer Mode) switch fabric. We consider both buffered and unbuffered versions of the indirect star. The performance of three existing routing algorithms is studied, and it is found that the packet acceptance probability offered by these algorithms is unsa...

Previous models for performance evaluation of mul-tistage switches have been neither accurate enough nor based on realistic assumptions regarding the correlation of the blocked cells in successive stages of the switch. In this paper, a new analytical model which permits an accurate analysis of multistage switches is proposed. The new model reeects the behavior of blocked cells, and takes into a...

The pursuit of high connectivity in network design for multicomputers is often complicated by wiring constraints, resulting in a trade-off between efficiency and realizability. The Mesh of Clos topology addresses this trade-off by combining a multistage network with a mesh network. In this paper, a simulation study is presented in order to evaluate wormhole-routed Mesh of Clos communication net...

Multistage Interconnection Networks (MINs) interconnect thousands of various processors and memory modules. These Systems attract the researchers in various aspects such as performance parameters, reliability and routing. In this paper reliability of Irregular Fault Tolerant MIN named as Irregular Triangle has been discussed and compared with Theta Network.

We present a folded free-space polarization-controlled optical multistage interconnection network (MIN) based on a dilated bypass-exchange switch (DBS) design that uses compact polarization-selective diffractive optical elements (PDOE's). The folded MIN design has several advantages over that of the traditional transparent MIN, including compactness, spatial filtering of unwanted higher-order d...

In this paper, we consider the application of the the rmodynamic concepts to the study of connect ing networks such as those found in telephone systems as illustrated in Fig. 1. Basically, the problem is to obtain all possible connections between N inputs and N outputs given by the permutat ion group by means of a physical structure. This could, for example, be an N • N matrix. For telephone ap...