Optimal information dispersal for reliable communication in computer networks

Hung Min Sun*, Shiuh-Pyng Shieh

*Corresponding author for this work

研究成果: Paper同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁面460-464
頁數5
DOIs
出版狀態Published - 19 十二月 1994
事件Proceedings of the 1994 International Conference on Parallel and Distributed Systems - Hsinchu, China
持續時間: 19 十二月 199421 十二月 1994

Conference

ConferenceProceedings of the 1994 International Conference on Parallel and Distributed Systems
城市Hsinchu, China
期間19/12/9421/12/94

指紋 深入研究「Optimal information dispersal for reliable communication in computer networks」主題。共同形成了獨特的指紋。

引用此