Max-plus algebra models of queueing networks
NK Krivulin - arXiv preprint arXiv:1212.0578, 2012 - arxiv.org
arXiv preprint arXiv:1212.0578, 2012•arxiv.org
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 …
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 …
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.
arxiv.org
以上显示的是最相近的搜索结果。 查看全部搜索结果