## Abstract

Under the assumption that each arc's capacity of the network is deterministic, the quickest path problem is to find a path sending a given amount of data from the source to the sink such that the transmission time is minimized. However, in a stochastic-flow network, the minimum transmission time is not fixed. We try to evaluate the system reliability that d units of data can be sent through the stochastic-flow network within the time constraint according to a routing policy. The solution procedure is presented to calculate the system reliability with respect to a routing policy. An efficient algorithm is subsequently proposed to derive the optimal routing policy.

Original language | English |
---|---|

Pages | 470-473 |

Number of pages | 4 |

State | Published - 1 Dec 2009 |

Event | 15th ISSAT International Conference on Reliability and Quality in Design - San Francisco, CA, United States Duration: 6 Aug 2009 → 8 Aug 2009 |

### Conference

Conference | 15th ISSAT International Conference on Reliability and Quality in Design |
---|---|

Country | United States |

City | San Francisco, CA |

Period | 6/08/09 → 8/08/09 |

## Keywords

- Optimal
- Quickest path
- Routing policy
- Stochastic-flow network
- System reliability