Computer simulations of a modified MiMa-algorithm for a crossbar packet switch

Tashev, Tasho; Monov, Vladimir

doi:10.1145/2659532.2659610

Cited by 2 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The perturbations are introduced in uniform load traffic as follows. We use the family template for a uniform model Uni i shown in figure 2 [8]. This family has ρ=100% load intensity of each input line (i.i.d.…”

Section: Asymptotically Vanishing Perturbation For Stability Analysismentioning

confidence: 99%

“…going throughput tends to 1. In [8] it is shown that the upper bound of throughput of the MiMa-algorithm for a uniform traffic model is also 1. Thus, with this type of input perturbations the throughput of the switch tends to its upper bound without perturbation.…”

Section: Assess the Stability Of The Numerical Procedures For Upper Boundmentioning

confidence: 99%

“…The computer simulation of the THR is executed on the grid-structure of Institute IICT-BAS (www.hpc.acad.bg). Our modeling of the THR uses the "Minimum of Maxima" algorithm [8], denoted by MiMa, for switch with commutation field size (n x n). This algorithm is specified by the apparatus of Generalized Nets (GN) [9].…”

Section: Introductionmentioning

confidence: 99%

“…We will investigate the stability of the numerical procedure with respect to small perturbations in the input (intensity ρ) and their effect on the output (THR). For this purpose we use a modified family of patterns [8] for i.i.d. Bernoulli uniform load traffic [10] simulation with an asymptotically vanishing perturbation.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Computer Simulations for Stability Analysis of a Numerical Procedure for Crossbar Packet Switch

Tashev¹,

Monov²,

Tasheva³

2017

Information Technologies and Control

View full text Add to dashboard Cite

The paper is concerned with the problem of calculating the bound of the throughput (THR) of a crossbar packet switch. For this purpose a suitable numerical procedure is used. The input data for the procedure are the results of computer simulations executed on a grid-computational structure (www.hpc.acad.bg). The modeling of the THR uses MiMa-algorithm for a crossbar packet switch, specified by the apparatus of Generalized Nets. For studying the stability of the numerical procedure we use a modified family of patterns for i.i.d. Bernoulli uniform load traffic simulation. The obtained results show that the numerical procedure is stable which means that small input perturbations result in small changes in the output.

show abstract

Section: Asymptotically Vanishing Perturbation For Stability Analysismentioning

confidence: 99%

Section: Assess the Stability Of The Numerical Procedures For Upper Boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations