M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the Association for Computing Machinery, vol. 36, no. 2, pp. 335--348, April 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to the sender [26] Channel coding techniques such as FEC can be used at the packet level to eliminate the need for acknowledgements. The encoded packets have the property that as long as the receiver obtains enough number of unique packets, it can perform decoding and recover the original packets [27, 28]. This feedback free technique is particularly suitable for applications that need to support oneto many or many to one [29] reliable simultaneous content distribution. The coding and decoding overhead of this approach may be high, however, and a tradeoff between coding efficiency and complexity ....

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the ACM, vol. 38, pp. 335--348, 1989.

.... WORK Many diversity schemes have been proposed in wireless literature, ranging from frequency and time, to spatial diversity [17] In wired networks, path diversity was first proposed in [18] and the theoretical work on information dispersion for security and load balancing was proposed in [19]. There have been other works dealing with simultaneous downloading of data from multiple mirror sites to accomplish path diversity. If the data is not delay sensitive, it is possible to use multiple TCP connections to different sites, with each TCP connection downloading a different part of the ....

M.O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the Association for Computing Machinery, vol. 36, no. 2, pp. 335--348, April 1989.

....about the data. The formation of the shares is called encoding and the process of combining the shares to reconstruct the original data is called decoding. An example scheme is replication. Each replica is the original data, thus, m=l and p=l. Other threshold schemes include Information Dispersal [Rabin1989], Secret Sharing [Shamir1979] Ramp Schemes [Blakley1985] Read Solomon Codes [Plank1997] and Tornado Codes [Luby1998] Table 1 lists a number of well known threshold schemes. n m p Name n 1 1 Replication n n 1 Decimation (Striping) n n n Splitting (XOR ing) n m 1 Information Dispersal ....

M. O. Rabin "Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance", Journal of the ACM, 36(2):335-348 ACM April 1989

....[28] indicates that the choice of the best server is often not obvious and that the obtained performance can dramatically vary depending on the server selected. One relevant related work in parallel access is Maxemchuk s work on dispersity routing [21] and Rabin s work on information dispersal [24], where a document is divided into several pieces and each piece also includes some redundant information. The receiver obtains different pieces of the document along different network paths and when the receiver has enough pieces the document is reconstructed. Currently there are several software ....

M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance", Journal of the ACM, 36(2):335--348, April 1989.

....communication media, the assumption is made that decoding is mainly impeded by packet loss. Either the packet is present and correct or it is lost. These losses are mainly caused by network congestion and the resultant buffer overflow and queuing delay. In this case, packet level FEC schemes [24] [27] provide an efficient way to fight against losses, although perfect recovery cannot be guaranteed. The description of the FEC algorithms is outside the scope of this paper but can be found in [28] Recall, however, that common FEC schemes based on Reed Solomon codes or X OR functions can ....

M. O. Rabin, "Efficient dispersal of information for security, load balancing and fault tolerance," J. ACM, vol. 36, pp. 335--348, Apr. 1989.

....and statistical record keeping [31] The work in [31] indicates that the choice of the best server is often not obvious and that the obtained performance can dramatically vary depending on the server selected. Maxemchuk s work on dispersity routing [24] and Rabin s work on information dispersal [28] explored how to improve document delivery from a single server along multiple paths. Using erasure codes, the server takes the original document, breaks it into k blocks and generates h parity blocks with the property that any k out of the k h data parity blocks can be used to reconstruct the ....

M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance", Journal of the ACM, 36(2):335--348, April 1989.

....source data. The key property of a digital fountain is that the source data can be reconstructed intact from any subset of the encoding packets equal in total length to the source data. The digital fountain concept is similar to ideas found in the seminal works of Maxemchuk [13] 14] and Rabin [21]. Our approach is to construct better approximations of a digital fountain as a basis for protocols that perform reliable distribution of bulk data. We emphasize that the digital fountain concept is quite general and can be applied in diverse network environments. For example, our framework for ....

....that experience congestion are delayed, but the destination can recover the data once a sufficient number of packets arrive, irrespective of the paths they took. This application dates back to the seminal works on dispersity routing by Maxemchuk [13] 14] and information dispersal by Rabin [21]. Both suggested using standard erasure codes. We expect Tornado codes will lead to improved practical dispersity routing schemes. Another application for which the Tornado code approximation might be useful arises in the context of mirrored data. Currently, to minimize response time, clients ....

M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance." In Journal of the ACM, Volume 38, pp. 335348, 1989.

....with m=2, n=3, and original data S. All implementations of secret sharing use random numbers to provide the guarantee that collecting fewer than p shares reveals no information about the original data. Rabin s information dispersal algorithm, a 1 m n threshold scheme, does not use random numbers [21]. Indeed, the parameter p indicates the number of random numbers required per encoding (i.e. p 1 random numbers s a 1 x b 1 a 2 x b 2 a 3 x b 3 x y ISBN 0 7695 1212 7 01 10.00 (C) 2001 IEEE are required to encode a secret for any threshold scheme) Ramp schemes implement the full ....

M. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the Association for Computing Machinery, 1989, pp. 335-348.

....the view that fault tolerance is a natural attribute of computing systems, taken into consideration from the very initial design phases, and not an exceptional attribute. Conceptual Model and Architecture 11 forward to tolerate both intrusions and physical faults [Fray et al. 1986, Rabin 1989] and to tolerate malicious logic faults [Joseph Avizienis 1988] The MAFTIA project aims to follow this very approach, by building on this and other earlier work and extending it to the case of large distributed systems. Conceptual Model and Architecture 13 Chapter 3 Refinement of core ....

....and (backward or forward) recovery, or intrusionmasking (cf. Section 4.3.1. 3) In MAFTIA, particular attention is being paid to the latter variety of intrusion tolerance, e.g. using the FRS technique, which can compensate errors due to both accidental faults and intrusions [Fraga Powell 1985, Rabin 1989, Deswarte et al. 1991, Fabre et al. 1994] Possible applications of this approach include services based on trustworthy trusted third parties such as those described in MAFTIA deliverables D26 and D27 [Abghour et al. 2001, Cachin 2001] Certification authority and directory service . Fair ....

[Article contains additional citation context not shown here]

M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance", Journal of the ACM, 36 (2), pp.335-48, 1989.

....systems and speed up the access to the storage devices. The aim of this paper is to define and assess by simulation a disk array system for the memorization of specific data for CM applications. Focusing on VOD service systems, a redundancy scheme based on an Information Dispersal Algorithm (IDA) [8] is used, its main task being to enhance the performance of the system. An index of the Quality of Service (QoS) offered by the system is also defined and evaluated. The paper is organized as follows: Section 2 introduces the problem of data storage in CM systems for VOD applications and ....

....disks in the groups, but also their number. We assume that data relating to normal traffic is stored according to traditional technique (parity encoding) while multimedia data is recorded using an information dispersal technique based on the Information Dispersal Algorithm (IDA) described in [8]. IDA is based on particular coding of information which, in the recording phase, provides the opportunity to vary arbitrarily the number of units used to achieve data redundancy. The system administrator can decide the number of additional units file by file, according to the degree of security ....

M.O. Rabin, "Efficient dispersal of information for security, load balancing and fault tolerance" ACM Journal of the Association for Computing Machinery, Vol.36 No.2, June 1994.

....This coalescence is achieved by partitioning the data set into bins. Items in the same bin share the same broadcast disk and therefore, have identical worst case latencies. Fault tolerance is achieved by Bestavros using AIDA, an elaboration on the Information Dispersal Algorithm (IDA) of Rabin [53]. Information Dispersal takes a file F and divides it in N independent pieces (dispersal) in such a way that recombining any m of such pieces (n N) is sufficient to retrieve F (reconstruction) AIDA uses IDA to adaptively decide the amount of redundancy used in the broadcast. Namely, the number ....

# M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," J. ACM, vol. 36, no. 2, pp. 335348, Apr. 1989.

....by adding a moderate level of redundancy using erasure resilient codes. Algorithms based on this approach have been developed for applications such as multicasting real time high volume video information over lossy packet based networks [3, 2, 9] and other high volume real time applications [14]. The two most important properties of erasure resilient codes in these applications are the running times of the encoding and decoding algorithms and the amount of encoding sufficient to recover the message. An erasureresilient code where any portion of the encoding equal to the length of the ....

M. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance", J. ACM, Vol. 36, No. 2, April 1989, pp. 335-348.

.... For this step, we utilize erasure codes (often referred to as Forward Error Correction codes) which have been widely suggested as a means of simplifying and streamlining reliable multicast transmission [6] 9] 10] 20] 22] 23] 24] 26] The main idea underlying this technique [14] [21] is to take an initial file consisting of k packets and generate an n packet encoding of the file with the property that the initial file can be restituted from any k packet subset of the encoding. For the application of reliable multicast, the source transmits packets from this encoding, and the ....

....Work Although the idea of parallel access to multiple mirror sites is quite straightforward, it has apparently received little attention in the literature. The most relevant related work includes Maxemchuk s work on dispersity routing [14] 15] and Rabin s work on information dispersal (IDA) [21]. For example, the idea of Rabin s IDA scheme is to break a file into several pieces, where each piece also includes some redundant information. By dispersing these pieces among different nodes in the network, one guarantees fault tolerance against link or node failures. Similarly, Maxemchuk ....

M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance." In Journal of the ACM, Volume 38, pp. 335348, 1989.

No context found.

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the Association for Computing Machinery, vol. 36, no. 2, pp. 335--348, April 1989.

No context found.

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the ACM, vol. 36, no. 2, pp. 335--348, April 1989.

No context found.

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the ACM, vol. 36, no. 2, pp. 335--348, April 1989.

No context found.

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," J. Assoc. Comput. Mach., vol. 36, no. 2, pp. 335--348, Apr. 1989.

No context found.

M. Rabin. "Efficient dispersal of information for security, load balancing and fault tolerance". Journal of the Association for Computing Machinery, Vol. 36, No. 2, April 1989, pp. 335-348.

No context found.

M.O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance", Journal of ACM, 36 (1989), 335-348.

No context found.

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," J. ACM, vol. 36, no. 2, pp. 335--348, Apr. 1989.

No context found.

M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the Association for Computing Machinery, vol. 36, no. 2, pp. 335--348, April 1989.

No context found.

M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," Journal of the Association for Computing Machinery, vol. 36, no. 2, pp. 335--348, April 1989.

No context found.

M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," Journal of ACM, Vol. 36, No. 2, pp. 335-348, Apr. 1989.

No context found.

M.O. Rabin. "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance." Journal of ACM, Vol. 36, No. 2, pp. 335-348, April 1989.

No context found.

M.O. Rabin, "Efficient Dispersal of Information for Security Load Balancing and Fault Tolerance", ACM Journal of the Association for Computing Machinery, Vol.36 No 2, April 1989, pp 335-348. This paper describes a new information coding system which can be used for storing and for transmitting data on a network not totally reliable.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC