Calculating the S-T up and down distributions of a class of stochastic networks
β Scribed by Sun-Wah Kiu
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 485 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0026-2714
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, seriesβparallel reduction, and conditioning. Examples illustrate the
This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni