The drawback of a conventional crossbar switch is its high complexity
of switch points, O(N-2), when N is the number of pol ts of the switch
. We present an alternative design of crossbar switch (Crossbar) whic
h maps the locations of the switch points to a set of a finite project
ive plane. Since the number of points of a set of a finite projective
plane is root N, the complexity of switch points is reduced to O(N roo
t N). We also show a simple self-routing algorithm, which is essential
for fast cell switching. An analytical performance evaluation for bur
sty traffic based on the Markov-modulated Poisson process model (MMPP)
demonstrates that the cell loss probability is about 16% higher than
that of the conventional crossbar switches due to the blocking effect
of the Crossbar. (C) 1998 Elsevier Science B.V.