Optimal information dispersal for reliable communication in computer networks

Hung Min Sun*, Shiuh-Pyng Shieh

*Corresponding author for this work

Research output: Contribution to conferencePaper

1 Scopus citations

Abstract

In an (m, n) Information Dispersal Scheme (IDS), the sender node decomposes a message M of length L into n pieces Si, 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 languageEnglish
Pages460-464
Number of pages5
StatePublished - 1 Dec 1994
EventProceedings of the 1994 International Conference on Parallel and Distributed Systems - Hsinchu, China
Duration: 19 Dec 199421 Dec 1994

Conference

ConferenceProceedings of the 1994 International Conference on Parallel and Distributed Systems
CityHsinchu, China
Period19/12/9421/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

    Sun, H. M., & Shieh, S-P. (1994). 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, .