CQ Switch Analysis under Traffic Overload.docVIP

Telfor Journal, Vol.3, No. 1, 2011. 19 CQ Switch Analysis under Traffic Overload Milutin Radonji?, Member, IEEE, Igor Radusinovi?, Member, IEEE, Ivo Maljevi?, Member, IEEE, and Du?an Banovi? 1 quite far from the switching fabric (Distributed Systems), Abstract — An analysis of 2x2 crossbar packet switch with which results in control communication being no longer buffers at crosspoints and round robin scheduling algorithm is presented in this paper. The analysis is performed for a non-admissible traffic pattern, where output ports are overloaded. The case of full offered load is observed and output ports are loaded with packets that have different arrival probabilities. In addition to the parameters that are instantaneous, which in turn affects the performance of the entire device. Several approaches can be taken to solve this problem. The simplest one is to increase the duration of the time slot reserved for a transmission of a single packet through the commonly observed in such an analysis (throughput and switching matrix. This would solve the problem of time average packet delay), memory requirements for the required for the control communication, but it would also degrade the transmission speed of switching device. Another approach, known from the literature, is based on the implementation of small buffers at the crosspoints of switching matrix, in addition to the existing buffers in the input line cards [3]. Such a solution alleviates the problem of the control communication duration, but does not completely eliminate it, because it is still necessary that the scheduler has the information about the input buffer occupancy. The best solution would be the one that completely eliminates the control communication. This would mean that there are no buffers at the inputs, but only at the crosspoints