Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
Max-plus algebra models of queueing networks. / Krivulin, N. K.
International Workshop on Discrete Event Systems WODES'96, University of Edinburgh, UK, Aug. 19-21, 1996. London : Institution of Electrical Engineers (IEE), 1996. стр. 76-81.Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
}
TY - GEN
T1 - Max-plus algebra models of queueing networks
AU - Krivulin, N. K.
N1 - Krivulin N. K. Max-plus algebra models of queueing networks. In International Workshop on Discrete Event Systems WODES'96, University of Edinburgh, UK, Aug. 19-21, 1996. London: The Institution of Electrical Engineers, 1996. P. 76-81.
PY - 1996
Y1 - 1996
N2 - A class of queueing networks which may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite 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. It is shown how the matrices inherent in particular networks may be calculated from the service times of customers. Since, in general, an explicit dynamic equation may not exist for a network, related existence conditions are established in terms of the network topology.
AB - A class of queueing networks which may have an arbitrary topology, and consist of single-server fork-join nodes with both infinite and finite 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. It is shown how the matrices inherent in particular networks may be calculated from the service times of customers. Since, in general, an explicit dynamic equation may not exist for a network, related existence conditions are established in terms of the network topology.
KW - max-plus algebra
KW - dynamic state equation
KW - fork-join queueing networks
KW - finite buffers
KW - blocking of servers
M3 - Conference contribution
SN - 0-85296-664-4
SP - 76
EP - 81
BT - International Workshop on Discrete Event Systems WODES'96, University of Edinburgh, UK, Aug. 19-21, 1996
PB - Institution of Electrical Engineers (IEE)
CY - London
T2 - International Workshop on Discrete Event Systems
Y2 - 19 August 1996 through 21 August 1996
ER -
ID: 4409927