### Abstract

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.

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

Pages | 460-464 |

Number of pages | 5 |

State | Published - 1 Dec 1994 |

Event | Proceedings of the 1994 International Conference on Parallel and Distributed Systems - Hsinchu, China Duration: 19 Dec 1994 → 21 Dec 1994 |

### Conference

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

City | Hsinchu, China |

Period | 19/12/94 → 21/12/94 |

## Fingerprint Dive into the research topics of 'Optimal information dispersal for reliable communication in computer networks'. Together they form a unique fingerprint.

## Cite this

*Optimal information dispersal for reliable communication in computer networks*. 460-464. Paper presented at Proceedings of the 1994 International Conference on Parallel and Distributed Systems, Hsinchu, China, .