## 摘要

In an (m, n) Information Dispersal Scheme (IDS), the sender node decomposes a message M of length L into n pieces S_{i}, l ≤ i ≤ n, each of length L/m, such that any m pieces collected by the receiver node over different paths suffice for reconstructing M. Because of variations of network traffic, the number n of available vertex-disjoint paths for the transmission from the sender node to the receiver node may vary in time. It is very difficult to determine the best n and m such that give the highest communication reliability, when given the maximum number of available disjoint paths and an upper bound for the information expansion rate (n/m). In this research, we discovered several interesting features of (m, n) IDSs which can help reduce the complexity for computing the highest communication reliability. From these findings, we propose a method for determining the optimal IDS.

原文 | English |
---|---|

頁面 | 460-464 |

頁數 | 5 |

DOIs | |

出版狀態 | Published - 19 十二月 1994 |

事件 | Proceedings of the 1994 International Conference on Parallel and Distributed Systems - Hsinchu, China 持續時間: 19 十二月 1994 → 21 十二月 1994 |

### Conference

Conference | Proceedings of the 1994 International Conference on Parallel and Distributed Systems |
---|---|

城市 | Hsinchu, China |

期間 | 19/12/94 → 21/12/94 |