TY - ECHAP
AU - Mateusz Nowak
AU - Piotr Pecka
AU - S. Balandin
AU - R. Dunaytsev
AU - Y. Koucheryavy
AB - Modelling with use of Markov chains is difficult from computational point of view, because of a rapid increase in the number of states occurring even when there is only a slight increase in the model’s scale. However, thanks to the appropriate description of the model the number of states can be significantly reduced. This paper discusses a synchronous slotted-ring network with optical packet switching modelled by means of markovian chains with continuous time. Simplifying the description has made it possible to significantly reduce the model’s dimension without significantly diminishing the results’ accuracy.
BT - Lecture Notes in Computer Science
DA - 8
LA - eng
N1 - 10.1007/978-3-642-14891-0\_21
N2 - Modelling with use of Markov chains is difficult from computational point of view, because of a rapid increase in the number of states occurring even when there is only a slight increase in the model’s scale. However, thanks to the appropriate description of the model the number of states can be significantly reduced. This paper discusses a synchronous slotted-ring network with optical packet switching modelled by means of markovian chains with continuous time. Simplifying the description has made it possible to significantly reduce the model’s dimension without significantly diminishing the results’ accuracy.
PB - Springer Berlin / Heidelberg
PY - 2010
SE - Reducing the Number of States for Markovian Model of Optical Slotted Ring Network
SN - 978-3-642-14890-3
T2 - Lecture Notes in Computer Science
TI - Smart Spaces and Next Generation Wired/Wireless Networking. Third Conference on Smart Spaces, ruSMART 2010, and 10th International Conference, NEW2AN 2010
VL - 6294
ER -