A simulation study of the throughput of a crossbar switch node by means of periodic input patterns

Authors:
Tasho Tashev;Vladimir Monov
Affiliations:
Institute of Information and Communication Technologies (IICT) -- Bulgarian Academy of Sciences;Institute of Information and Communication Technologies (IICT) -- Bulgarian Academy of Sciences
Venue:
Proceedings of the 13th International Conference on Computer Systems and Technologies
Year:
2012

Citing 7
Cited 1

High-speed switch scheduling for local-area networks

ACM Transactions on Computer Systems (TOCS)
Designing and Implementing a Fast Crossbar Scheduler

IEEE Micro
An approach for performance improvement of class of algorithms for synthesis of non-conflict schedule in the switch nodes

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Computering simulation of schedule algorithm for high performance packet switch node modelled by the apparatus of generalized nets

Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering

Computer Communications
Converging the Evolution of Router Architectures and IP Networks

IEEE Network: The Magazine of Global Internetworking
Large-Scale simulation of uniform load traffic for modeling of throughput on a crossbar switch node

LSSC'11 Proceedings of the 8th international conference on Large-Scale Scientific Computing

A computer modeling of the throughput of a crossbar switch by PI-patterns for uniform traffic with variable intensity

Proceedings of the 14th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a simple model for uniform traffic with periodic input patterns is suggested. Periodic input patterns (PI-Patterns) represent a further development of the family of patterns (S-Patterns) proposed in our previous investigations. Our simulation studies use the Generalized Nets (GN) model of the known PIM-algorithm. The simulation results of a GN-model using PI-Patterns are presented and compared with results obtained for S-Patterns. It is shown that the upper bound for the throughput of PIM-algorithm for the S-Patterns is the value of throughput for uniform traffic with PI-Patterns.