Advanced message passing techniques for distributed storage
author:
David Saad,
Aston University
Description
Distributed storage plays an important role in networks where individual nodes are limited in their storage capabilities and where files are infrequently required. The scenario examined is one where file information is encoded and then divided to a number of segments, which are then distributed over a graph representing the network. Nodes requesting a particular file collect the required number of file segments from neighbouring nodes to retrieve the original information.
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:01 | Advanced message passing techniques for distributed storage |
| 1:34 | Outline |
| 2:04 | Distributed storage |
| 5:05 | Distributed storage - advantages |
| 6:32 | Coding - BEC |
| 7:49 | Coding - file segments |
| 8:54 | Fountain codes |
| 11:01 | Segment distribution |
| 12:19 | Message passing |
| 17:05 | Message passing |
| 19:50 | Experiments |
| 22:35 | Results - BP vs. WSAT |
| 24:35 | Connectivity transition point |
| 25:23 | Summary & future research |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Visitors who watched this lecture also watched...
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !



