Abstract
The drawback of a conventional crossbar switch is its high complexity of switch points, O( N 2), where N is the number of ports of the switch. We present an alternative design of crossbar switch (Crossbar ∗) which maps the locations of the switch points to a set of a finite projective plane. Since the number of points of a set of a finite projective plane is √ N, the complexity of switch points is reduced to O( N√ N). We also show a simple self-routing algorithm, which is essential for fast cell switching. An analytical performance evaluation for bursty 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 ∗.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
