Storage Optimization for a Peer-to-Peer Video-On-Demand Network
|Event Date:||February 11, 2010|
|Speaker:||Jagadeesh Dyaberi, Ph.D. Student|
|Speaker Affiliation:||School of Electrical and Computer Engineering|
|Sponsor:||Computer Engineering Graduate Student Series|
This talk explores requirements for efficient pre-seeding of video-on-demand (VoD) movie data onto numerous customer set-top boxes in a cable ISP environment. The preseeded content will then be distributed to other set-top boxes in the same cable community using a peer-to-peer (P2P) network protocol such as BitTorrent. The challenges and solutions required for P2P VoD provided by a fixed provider such as a cable company are fundamentally different from those seen in traditional P2P networks or client-server VoD solutions. Our work pre-positions data into set-top boxes using a mathematical programming algorithm. The objective of the algorithm is to minimize uplink traffic, given a popularity model for various pieces of content and information about storage and band-width capacity constraints at the customer nodes. Given the complex non-linear nature of P2P interactions, these mathematical programs are solved using non-linear optimization approaches. Using a BitTorrent-like peer-to-peer data delivery system, we show through extensive simulations that our mathematical model for pre-seeding data based on object popularity and node bandwidth availability leads to noticeably greater reductions in uplink traffic and VoD server load than a weighted-random pre-seeding scheme that only considers object popularity.
Jagadeesh Dyaberi is a doctoral student in the School of ECE working with Prof. Vijay Pai. He received the BS degree in Computer Engineering from Texas A&M University with a minor in Mathematics. His research interests include Storage, Distributed Systems and Networking.