Event Detail

Event Type: 
Probability Seminar
Thursday, November 20, 2008 - 06:00
Kidder 350

Speaker Info

School of Electrical Engineering and Computer Science, Oregon State University

Currently, to disseminate a piece of data from a source to multiple destinations on the Internet, the data is divided into a number of packets which are then forwarded hop-by-hop through a series of routers along the paths that connect the source and the destinations. This store-and-forward scheme is simple, however it is often suboptimal. In this talk, I will describe a new paradigm for data dissemination and storage over the Internet using Network Coding (NC) that promises significant performance improvements in both data dissemination throughput and data robustness, particularly in distributed settings. I will introduce some algebraic structures for a generic NC scheme then focus on a simple Random Network Coding scheme (RNC) that is immediately applicable to a variety of current and future Internet applications. I will describe the architecture and protocols of a distributed NC-based storage and delivery system that is superior to YouTube both in throughput and storage performance . A few theoretical results on the performance of RNC scheme will be given. These results are obtained using tools from basic probability, Markov chain, and birth-death process theories.