Merkle Trees && ZFS
Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels of its children nodes.
Before downloading a file on a p2p network, in most cases the top hash is acquired from a trusted source, When the top hash is available, the hash tree can be received from any non-trusted source, like any peer in the p2p network. Then, the received hash tree is checked against the trusted top hash, and if the hash tree is damaged or fake, another hash tree from another source will be tried until the program finds one that matches the top hash.
it is efficient to split files up in very small data blocks so that only small blocks have to be re-downloaded if they get damaged.
http://ift.tt/T8wd5c
ZFS provides fault isolation between data and checksum by storing the checksum of each block in its parent block pointer -- not in the block itself. Every block in the tree contains the checksums for all its children, so the entire pool is self-validating.
http://ift.tt/1EdXzjE
http://ift.tt/1dDUDSf
http://ift.tt/1vjb3V6
We use ditto blocks to ensure that the more "important" a filesystem block is (the closer to the root of the tree), the more replicated it becomes.
ZFS Administration
http://ift.tt/1dDUGxt
Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels of its children nodes.
Before downloading a file on a p2p network, in most cases the top hash is acquired from a trusted source, When the top hash is available, the hash tree can be received from any non-trusted source, like any peer in the p2p network. Then, the received hash tree is checked against the trusted top hash, and if the hash tree is damaged or fake, another hash tree from another source will be tried until the program finds one that matches the top hash.
it is efficient to split files up in very small data blocks so that only small blocks have to be re-downloaded if they get damaged.
http://ift.tt/T8wd5c
ZFS provides fault isolation between data and checksum by storing the checksum of each block in its parent block pointer -- not in the block itself. Every block in the tree contains the checksums for all its children, so the entire pool is self-validating.
http://ift.tt/1EdXzjE
http://ift.tt/1dDUDSf
http://ift.tt/1vjb3V6
We use ditto blocks to ensure that the more "important" a filesystem block is (the closer to the root of the tree), the more replicated it becomes.
ZFS Administration
http://ift.tt/1dDUGxt
from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1DT0aL9
via LifeLong Community
No comments:
Post a Comment