BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:On Storing and Retrieving (coded) Data in Mobile P2P Networks - So
 ljanin\, E (Bell Labs)
DTSTART:20100407T150000Z
DTEND:20100407T160000Z
UID:TALK24097@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Imagine an agent having a piece of information that he wants t
 o communicate to his partner. The agent knows that his partner resides in 
 a certain part of an occupied city but does not want to be seen talking wi
 th him\, or with anyone else on the street for a long time. The agent and 
 his partner have a number of friends walking in the same part of the city\
 , and are willing to relay small pieces of information between the secret 
 couple. Because of that\, the agent decides to split his data in small chu
 nks which he can inconspicuously pass to his friends. To increase persiste
 ncy of the data among the friends who are moving in an adverse environment
 \, the agent also decides to make these data chunks redundant by using era
 sure correcting codes. Assuming that all participants in this storing and 
 retrieving process perform simple random walks over a finite\, random\, re
 gular\, graph\, and can exchange information only when they are on the sam
 e node of the graph\, we describe how coding\, at the expense of introduci
 ng redundancy and processing complexity\, not only increases the persisten
 ce of the data\, but also reduces the average time necessary for the trans
 fer of information between the agent and his partner.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR