Optimal information dispersal for reliable communication in computer networks

Hung Min Sun; Shiuh-Pyng Shieh

doi:10.1109/ICPADS.1994.590356

Optimal information dispersal for reliable communication in computer networks

Hung Min Sun^*, Shiuh-Pyng Shieh

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

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 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
DOIs	https://doi.org/10.1109/ICPADS.1994.590356
State	Published - 19 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

Access to Document

10.1109/ICPADS.1994.590356

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

Cite this

@conference{3e662751cb65442f9d917065b284009a,

title = "Optimal information dispersal for reliable communication in computer networks",

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.",

author = "Sun, {Hung Min} and Shiuh-Pyng Shieh",

year = "1994",

month = dec,

day = "19",

doi = "10.1109/ICPADS.1994.590356",

language = "English",

pages = "460--464",

note = "null ; Conference date: 19-12-1994 Through 21-12-1994",

}

TY - CONF

T1 - Optimal information dispersal for reliable communication in computer networks

AU - Sun, Hung Min

AU - Shieh, Shiuh-Pyng

PY - 1994/12/19

Y1 - 1994/12/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028758721&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.1994.590356

DO - 10.1109/ICPADS.1994.590356

M3 - Paper

AN - SCOPUS:0028758721

SP - 460

EP - 464

Y2 - 19 December 1994 through 21 December 1994

ER -

Optimal information dispersal for reliable communication in computer networks

Abstract

Conference

Access to Document

Other files and links

Cite this