No abstract

No abstract

No abstract

No abstract

Sadržaj -U ovom radu su prikazani rezultati analize varijacije kašnjenja paketa kod 32x32 komutatora paketa sa baferima u ukrsnim ta kama, u uslovima uniformnog dolaznog saobra aja. Analizirani su komutatori sa razli itim veli inama bafera i razli itim algoritmima raspore ivanja: longest-queue-first, round-robin, exaustive-round-robin i frame-based-round-robin-matching. Rezultati su pokazali da najmanju varijaciju kašnjenja, me u posmatranima, unosi round-robin algoritam.Klju ne re i -Algoritam raspore ivanja, dužina bafera, krosbar komutator paketa, varijacija kašnjenja. ABSTRACTThis paper presents the results of the packet delay variation analysis for 32x32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.