A Markovian model of the RED mechanism solved with a cluster of computers

Jarosław Bylina, Beata Bylina


The paper presents a working example of distributed application which can be used to find stationary probabilities of states for queuing models - by generating a transition rate matrix and solving a linear system. The presented example is connected to the RED mechanism which can be used in the TCP/IP protocol to control packets flow. The paper also shows efficiency of the application with the use of a various number of computers connected with Ethernet.

Full Text:


DOI: http://dx.doi.org/10.17951/ai.2006.5.1.19-27
Data publikacji: 2006-01-01 00:00:00
Data złożenia artykułu: 2016-04-27 10:15:45


Total abstract view - 283
Downloads (from 2020-06-17) - PDF - 0



  • There are currently no refbacks.

Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.