2000
DOI: 10.1007/978-1-4757-4828-4
|View full text |Cite
|
Sign up to set email alerts
|

Computational Probability

Abstract: This paper puts on the stage old ideas that are still very useful in computational probability problems arising in telecommunication and teletraffic applications. Basic computational problems to be discussed are the calculation of equilibrium and transient solutions for Markovian systems and the calculation of overfow probabilities in finite-buffer systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 25 publications
(1 citation statement)
references
References 65 publications
0
1
0
Order By: Relevance
“…Here, π i ij q represents the probability flux from state i to state j and the symbol \ represents exclusion. In general, it is computationally intractable to solve this system of equations for most queuing models (Grassman, 2000).…”
Section: Markov Chain Modelmentioning
confidence: 99%
“…Here, π i ij q represents the probability flux from state i to state j and the symbol \ represents exclusion. In general, it is computationally intractable to solve this system of equations for most queuing models (Grassman, 2000).…”
Section: Markov Chain Modelmentioning
confidence: 99%