Mathematical analysis of peer to peer communication networks

Duration: 1 hour 3 mins
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Hajek, B (Illinois)
Monday 22 March 2010, 17:00-18:00
 
Created: 2010-03-23 09:36
Collection: Stochastic Processes in Communication Sciences
Rothschild Seminars
Publisher: Isaac Newton Institute
Copyright: Hajek, B
Language: eng (English)
Credits:
Author:  Hajek, B
 
Abstract: Distributed protocols for peer to peer file sharing, streaming video, and video on demand have revolutionised the way the majority of information is conveyed over the Internet. The peers are millions of computers, acting as both clients and servers, downloading and uploading information. Information to be shared is broken into chunks, and the chunks are traded among peers in the network. There can be turnover in the set of chunks of information being collected and/or in the set of peers collecting the information. Coding, in which groups of chunks are combined to form new chunks, can enhance the collection process. The systems are distributed and scalable. The theory for understanding peer to peer systems has lagged far behind our ability to mathematically model, predict, and optimize system performance. In this talk I shall discuss stochastic models, mathematical results, and challenges relating to the performance of peer to peer communication in large networks.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.9 Mbits/sec 899.57 MB View Download
WebM 480x360    549.13 kbits/sec 253.39 MB View Download
Flash Video 480x360    806.93 kbits/sec 374.61 MB View Download
iPod Video 480x360    505.33 kbits/sec 234.59 MB View Download
QuickTime 384x288    848.7 kbits/sec 394.00 MB View Download
MP3 44100 Hz 125.02 kbits/sec 57.83 MB Listen Download
Windows Media Video 477.21 kbits/sec 221.54 MB View Download
Auto * (Allows browser to choose a format it supports)