Wireless VOD Yangyang Liu(刘扬扬) 5120309665

1 2 3 4 Brief Introduction of VOD 点击添加文本 VOD With Different Popularity VOD With Cache 4 点击添加文本 Reference Paper 点击添加文本

What is VOD? System Allow users to select and watch/listen to video content when they choose to Provide subscribers with the possibility of watching the video of their choice at the time of their choice 点击添加文本 点击添加文本 点击添加文本 点击添加文本

The Periodic Broadcasting Protocols Staggered Broadcasting Protocol Pyramid Broadcasting Protocol 点击添加文本 Harmonic Broadcasting Protocol 点击添加文本 Pagoda and New Pagoda Broadcasting Protocol 点击添加文本 点击添加文本

Optimization of CBR Broadcasting Scheme 点击添加文本 点击添加文本 S, the total length(in time units)of the video , the ith segment w, the client waiting time requirement , the bandwidth used to transmit the ith segment n, the number of segments for a given video 点击添加文本 点击添加文本

Optimization of CBR Broadcasting Scheme 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Optimization of CBR Broadcasting Scheme Solution: 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Minimizing the Access Delay 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Minimizing the Access Delay Theorem : Given and , If is an integer, then the minimum access delay can be provided is 点击添加文本 Parameters D Duration of the video C Num. of intervals/packets for CBR video Ratio of redundant time intervals Rated system transmission reliability K Num. of slots in a time interval N Num. of subchannels 点击添加文本 点击添加文本 点击添加文本

Popularity Why use popularity? Describe the degree that how popular the video is. The probability that a media video is requested by the customers at a certain moment. 点击添加文本 Why use popularity? The popularity-based data allocation within a cluster will have a real impact on data retrievals due to the greatly localized data allocation. 点击添加文本 点击添加文本 点击添加文本

Modeling the System with Popularity 1 sever, M videos Popularity matrix , each video has a popularity(stands for the request probability) Each occupies N subchannels(fixed). Use CBR broadcasting scheme B is the total bandwidth, and is the bandwidth allocated for each video is the duration of each video a is ration of redundant time intervals 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Modeling the System with Popularity 点击添加文本 点击添加文本 Parameters Bi Bandwidth for each video N Constant, number of channels for each video Wi Delay for each video Pi Popularity of each video Di Duration of each video a Ration of redundant time intervals 点击添加文本 点击添加文本

Modeling the System with Popularity In which, 点击添加文本 点击添加文本 St. 点击添加文本 Using: S is the size of the video and is the coding rate. 点击添加文本

P2P VOD A video server load is reduced by peers who cache data of the viewed videos and send these data to other peers instead of the video server. 点击添加文本 Cache 点击添加文本 Video-popularity based caching (VPC) that reduces the video server load by considering video popularity 点击添加文本 点击添加文本

Modeling the System with Cache 点击添加文本 User 点击添加文本 User User 点击添加文本 User User 点击添加文本

Modeling the System with Cache N users, M videos Each user has total cache size S, each video occupies size of Matrix is a (0,1) matrix, if user i has the cache of video j, then , else Matrix , is the probability of user i need video j Matrix , is the transmission rate between user i and user j Matrix , is the distance between user i and user j 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Modeling the System with Cache(cost& incentive) Matrix , is the cost to cache video i r, unit reward c, unit cost of upload a video 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Modeling the System with Cache 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Future Work Find some algorithms to solve the problems modeled by the VOD With Different Popularity(Greedy?) Find some algorithms to solve the problems modeled by the VOD With Cache(Game Theory?) 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Related Paper “Video-on-Demand Broadcasting Protocols: A Comprehensive Study”, Ailan Hu, Intel Corporation “Wireless VoD Service under Network Crowdsourcing Architecture for content Distribution” “Exact Decoding Probability Under Random Linear Network Coding”, Oscar Trullols-Cruces, Student Member, IEEE, Jose M. Barcelo-Ordinas, and Marco Fiore,IEEE COMMUNICATIONS LETTERS, VOL. 15, NO. 1, JANUARY 2011 “Video-Popularity-based Caching Scheme for P2P Video-on-Demand Streaming”, Takaya Fujimoto, Rei Endo, Kei Matsumoto, Hiroshi Shigeno,Faculty of Science and Technology, Keio University, 2011 International Conference on Advanced Information Networking and Applications “Distributed Caching via Rewarding: An Incentive Scheme Design in P2P-VoD Systems”, Weijie Wu, Richard T.B. Ma, and John C.S. Lui, Fellow, IEEE, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 25, NO. 3, MARCH 2014 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Related Paper “Video-on-Demand networks: design approaches and future challenges,” F. Thouin and M. Coates, IEEE Network, vol. 21, no. 2, pp. 42–48, March 2007 “Harmonic broadcasting for video-on-demand service,” L-S. Juhn and L-M. Tseng, IEEE Trans. Broadcasting, vol. 43, no. 3, pp. 268–271, September 1997 “Fundamental Limits of Distributed Caching in D2D Wireless Networks”, Mingyue Ji, Giuseppe Caire and Andreas F. Molisch Department of Electrical Engineering University of Southern California “Femtocaching and Device-to-Device Collaboration: A New Architecture for Wireless Video Distribution”, Negin Golrezaei, Student Member, IEEE, Andreas F. Molisch, Fellow, IEEE, Alexandros G. Dimakis, Member, IEEE, and Giuseppe Caire, Fellow, IEEE “Impact of Popularity Evolution on P2P-Based VoD Delivery over Next-Generation Optical Access Networks”, Emanuele Di Pascale, David B. Payne, and Marco Ruffini, CTVR, Trinity College Dublin, Globecom 2013 点击添加文本 点击添加文本 点击添加文本 点击添加文本

Related Paper “Popularity-aware Caching Algorithm for Video-on-Demand Delivery over Broadband Access Networks”, Chamil Jayasundara, Ampalavanapillai Nirmalathas, Elaine Wong, Nishaanthan Nadarajah, full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2010 proceedings “A Popularity-based Data Allocation Scheme for a VOD Server”, Carl K. Chang, Chiao-Chuan Shih, and Thinh T.Nguyen 点击添加文本 点击添加文本 点击添加文本 点击添加文本

点击添加文本 THANK YOU! 点击添加文本 点击添加文本 点击添加文本

点击添加文本 Q&A 点击添加文本 点击添加文本 点击添加文本