Transition Transformation and Representation for SAN Descriptions of Radio Communication Protocols
Authors: Ostermann, Martin
Chair of Communication Networks (ComNets), Faculty 6, RWTH Aachen University
: Zheng Xie
In 10th Aachen Symposium on Signal Theory, Algorithms and Software for Mobile Communications, p.p. 83-88, Berlin, Germany,VDE Verlag, 2001.
Publication Date: Sep, 2001
On page(s):83-88
ISBN: 3-8007-2610-6
Abstract Stochastic Automata Networks (SANs) have been in use for several years to perform the numerical analysis of certain modeling problems, to substitute, or to complement methods like queuing models, Petri-nets, etc. By the use of an SAN descriptor, large Markov chains can be described by small matrices of the size of the underlying single components of an automata netowork. It was already shown how it is possible for SANs to be utilized to analyze tightly coupled networks, like those that describe the behavior of point to point communication protocols over stochastic channels. By solving the static state probabilities of the overall system, a wide range of performance parameters can be obtained. In this paper, a method is discussed to derive the transition descriptions that compose an SAN description from the procedural notation of tan algorithm in an integrated fashion based on tensor algebra and matrix products. The special properties of radio communication systems and their models in regard to the structure and concurrency of the algorithm are taken into account. The main advantage of this method is the unified handling on the construction of the SAN and the solving of its steady states probabilities. Thus it simplifies the implementation of research tools compared to general graph based construction methods and general compilation techiques. The goal of this paper is to encourage more research concerning the SAN approach for performance analysis of radio communication protocols.
Author Keywords
Stochastic Automata Networks
DownloadBibtex
@PROCEEDINGS{ost_ASST01,
AUTHOR = {Ostermann, M.},
TITLE = {Transition Transformation and Representation for SAN Descriptions of
Radio Communication Protocols},
YEAR = {2001},
MONTH = {Sep},
PAGES = {83-88},
PUBLISHER = {VDE Verlag},
ADDRESS = {Berlin, Germany},
BOOKTITLE = {10th Aachen Symposium on Signal Theory, Algorithms and Software for
Mobile Communications},
AFFILIATION = {Chair of Communication Networks (ComNets), Faculty 6, RWTH Aachen University},
ISBN = {3-8007-2610-6},
KEYWORDS = {Stochastic Automata Networks},
URL = {https://www.comnets.rwth-aachen.de}
}