Abstract
Exactly computing network reliability measures is an NP-hard problem. Therefore, Monte Carlo simulation has been frequently used by network designers to obtain accurate estimates. This paper focuses on simulation estimation of network reliability. Using a heap data structure, efficient implementation of a previous approach, dagger sampling, is proposed. Two new techniques, geometric sampling and block sampling, are developed to efficiently sample states of a network. These techniques are event-driven rather than time-driven, and are thus efficient for highly reliable networks. To test relative performance, computational experiments are carried out on various types of networks using the new procedures.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 224-231 |
| Number of pages | 8 |
| Journal | Proceedings - Winter Simulation Conference |
| Volume | 1 |
| State | Published - Dec 1 2004 |
| Event | Proceedings of the 2004 Winter Simulation Conference - Washington, DC, United States Duration: Dec 5 2004 → Dec 8 2004 |
All Science Journal Classification (ASJC) codes
- Software
- Modeling and Simulation
- Computer Science Applications