TY - GEN

T1 - The max-plus algebra approach in modelling of queueing networks

AU - Krivulin, N. K.

PY - 1996

Y1 - 1996

N2 - A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix. We show how the matrix may be calculated from the service time of customers in the general case, and give examples of matrices inherent in particular networks.

AB - A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic state equation which relates the departure epochs of customers from the network nodes in an explicit vector form determined by a state transition matrix. We show how the matrix may be calculated from the service time of customers in the general case, and give examples of matrices inherent in particular networks.

KW - model design

KW - system dynamics

KW - queueing networks

M3 - Conference contribution

SN - 1-56555-098-6

SP - 485

EP - 490

BT - Proceedings of 1996 Summer Computer Simulation Conference, Portland, OR, July 21-25, 1996

A2 - Ingalls, V. W.

A2 - Cynamon, J.

A2 - Saylor, A.

PB - Society for Computer Simulation International

ER -