MODELING AND ANALYSIS OF COMMUNICATION-SYSTEMS BASED ON COMPUTATIONAL METHODS FOR MARKOV-CHAINS

被引：31

作者：

KRIEGER, UR ^{[1
]}

MULLERCLOSTERMANN, B ^{[1
]}

SCZITTNICK, M ^{[1
]}

机构：

[1] UNIV DORTMUND,DEPT COMP SCI,W-4600 DORTMUND 50,GERMANY

来源：

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 1990年 / 8卷 / 09期

关键词：

D O I：

10.1109/49.62851

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We describe a computational approach for modeling and analyzing modern communication systems based on numerical methods for Markov chains. Advanced direct and iterative procedures for the calculation of the stationary distribution of a homogenous discrete- or continuous-time Markov chain with finite state space are presented. They are implemented in a convenient software tool for interactive modeling and performance evaluation of communication systems. The versatility of these algorithms is illustrated by their application to Markovian queueing models derived from telecommunication networks.

引用

页码：1630 / 1648

页数：19

共 130 条

[11]

BERRY LTM, 1989, ATR, V23, P23

[12]

Brandt Achi, 1985, SPARSITY ITS APPL, P257

[13]

BROCKMEYER E, 1954, TELETEKNIK, P361

[14]

BROCKMEYER E, 1960, LIFE WORKS AK ERLANG

[15] THEOREMS OF STEIN-ROSENBERG TYPE .3. THE SINGULAR CASE [J].

BUONI, JJ ;

NEUMANN, M ;

VARGA, RS .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1982, 42 (FEB) :183-198

[16] INCOMPLETE FACTORIZATION OF SINGULAR M-MATRICES [J].

BUONI, JJ .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (02) :193-198

[17]

CACHARD F, 1981, CREATION COMP LOGICI

[18]

CAMERON WH, 1983, 10 P ITC MONTR

[19] ITERATIVE AGGREGATION DISAGGREGATION TECHNIQUES FOR NEARLY UNCOUPLED MARKOV-CHAINS [J].

CAO, WL ;

STEWART, WJ .

JOURNAL OF THE ACM, 1985, 32 (03) :702-719

[20] ITERATIVE METHODS FOR OVERFLOW QUEUING MODELS .2. [J].

CHAN, RH .

NUMERISCHE MATHEMATIK, 1988, 54 (01) :57-78

← 1 2 3 4 5 6 7 8 9 10 →