A Novel Video Layout Strategy for Near-Video-on- Demand Servers Shenze Chen & Manu Thapar Hewlett-Packard Labs 1501 Page Mill Rd. Palo Alto, CA 94304.

Slides:



Advertisements
Similar presentations
Jung-Hwan Low Redundancy Layered Multiple Description Scalable Coding Using The Subband Extension Of H.264/AVC Department of Electrical.
Advertisements

Dynamic Generation of Data Broadcasting Programs for Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array in a Mobile Computing.
I/O Management and Disk Scheduling Chapter 11. I/O Driver OS module which controls an I/O device hides the device specifics from the above layers in the.
Hierarchical Caching and Prefetching for Continuous Media Servers with Smart Disks By:Amandeep Singh Parth Kushwaha.
Faculty of Information Technology Department of Computer Science Computer Organization Chapter 7 External Memory Mohammad Sharaf.
Magnetic Disk Magnetic disks are the foundation of external memory on virtually all computer systems. A disk is a circular platter constructed of.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
RAID Redundant Array of Independent Disks
Class-constrained Packing Problems with Application to Storage Management in Multimedia Systems Tami Tamir Department of Computer Science The Technion.
Lecture 5 Memory Management Part I. Lecture Highlights  Introduction to Memory Management  What is memory management  Related Problems of Redundancy,
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 28 – Media Server (Part 3) Klara Nahrstedt Spring 2009.
File Processing - Indirect Address Translation MVNC1 Hashing Indirect Address Translation Chapter 11.
Continuous Media 1 Differs significantly from textual and numeric data because of two fundamental characteristics: –Real-time storage and retrieval –High.
Slice–and–Patch An Algorithm to Support VBR Video Streaming in a Multicast– based Video–on–Demand System.
CHAINING COSC Content Motivation Introduction Multicasting Chaining Performance Study Conclusions.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 27 – Media Server (Part 3) Klara Nahrstedt Spring 2011.
Tradeoffs in Scalable Data Routing for Deduplication Clusters FAST '11 Wei Dong From Princeton University Fred Douglis, Kai Li, Hugo Patterson, Sazzala.
June 3, 2015Windows Scheduling Problems for Broadcast System 1 Amotz Bar-Noy, and Richard E. Ladner Presented by Qiaosheng Shi.
Harmonic Broadcasting for Video-on- Demand Service Enhanced Harmonic Data Broadcasting And Receiving Scheme For Popular Video Service Li-Shen Juhn and.
Client Buffering Techniques for Scalable Video Broadcasting Over Broadband Networks With Low User Delay S.-H. Gary Chan and S.-H. Ivan Yeung, IEEE Transactions.
1 Adaptive Live Broadcasting for Highly-Demanded Videos Hung-Chang Yang, Hsiang-Fu Yu and Li-Ming Tseng IEEE International Conference on Parallel and Distributed.
Analysis of Using Broadcast and Proxy for Streaming Layered Encoded Videos Wilson, Wing-Fai Poon and Kwok-Tung Lo.
Periodic Broadcasting with VBR- Encoded Video Despina Saparilla, Keith W. Ross and Martin Reisslein (1999) Prepared by Nera Liu Wing Chun.
VCR-oriented Video Broadcasting for Near Video-On- Demand Services Jin B. Kwon and Heon Y. Yeon Appears in IEEE Transactions on Consumer Electronics, vol.
Locality-Aware Request Distribution in Cluster-based Network Servers 1. Introduction and Motivation --- Why have this idea? 2. Strategies --- How to implement?
Prefix Caching assisted Periodic Broadcast for Streaming Popular Videos Yang Guo, Subhabrata Sen, and Don Towsley.
Distributed Servers Architecture for Networked Video Services S. H. Gary Chan, Member IEEE, and Fouad Tobagi, Fellow IEEE.
A Server-less Architecture for Building Scalable, Reliable, and Cost-Effective Video-on-demand Systems Presented by: Raymond Leung Wai Tak Supervisor:
Proxy-based Distribution of Streaming Video over Unicast/Multicast Connections B. Wang, S. Sen, M. Adler and D. Towsley University of Massachusetts Presented.
Fast broadcasting scheme(FB) In FB scheme, we divide a movie into 2 k - 1 segments, k channels is needed. S = S 1 · S 2 · S 3 · S 4 · S 5 · S 6 · S 7 Waiting.
Fine-Grained Device Management in an Interactive Media Server Raju Rangaswami, Zoran Dimitrijevic, Edward Chang, and Shueng-Han Gary Chan IEEE Trans. on.
Smooth Workload Adaptive Broadcast Yang Guo, Lixin Gao Don Towsley, Subhabrata Sen IEEE TRANSACTIONS ON MULTIMEDIA, APRIL 2004.
Multicast with Cache (Mcache): An Adaptive Zero-Delay Video-on-Demand Service Sridhar Ramesh, Injong Rhee, and Katherine Guo INFOCOM 2001.
Web-Conscious Storage Management for Web Proxies Evangelos P. Markatos, Dionisios N. Pnevmatikatos, Member, IEEE, Michail D. Flouris, and Manolis G. H.
Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Ewa Kusmierek, Yingfei Dong, Member, IEEE, and David H. C. Du, Fellow, IEEE.
Design of an Interactive Video- on-Demand System Yiu-Wing Leung, Senior Member, IEEE, and Tony K. C. Chan IEEE Transactions on multimedia March 2003.
Multimedia Information Systems Shahram Ghandeharizadeh Computer Science Department University of Southern California.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
1 Proxy-Assisted Techniques for Delivering Continuous Multimedia Streams Lixin Gao, Zhi-Li Zhang, and Don Towsley.
A Server-less Architecture for Building Scalable, Reliable, and Cost-Effective Video-on-demand Systems Raymond Leung and Jack Y.B. Lee Department of Information.
MM File Management Karrie Karahlaios and Brian P. Bailey Spring 2007.
Jiazhang Liu;Yiren Ding Team 8 [10/22/13]. Traditional Database Servers Database Admin DBMS 1.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 32 – Media Server (Part 2) Klara Nahrstedt Spring 2012.
Optimizing Cloud Resources for Delivering IPTV Services Through Virtualization.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Data Compression By, Keerthi Gundapaneni. Introduction Data Compression is an very effective means to save storage space and network bandwidth. A large.
Practice 8 Chapter Ten. 1. Is disk scheduling, other than FCFS scheduling, useful in a single-user environment? Explain your answer. Answer: In a single-user.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
Improving Disk Throughput in Data-Intensive Servers Enrique V. Carrera and Ricardo Bianchini Department of Computer Science Rutgers University.
Virtual Memory The memory space of a process is normally divided into blocks that are either pages or segments. Virtual memory management takes.
Fast File System 2/17/2006. Introduction Paper talked about changes to old BSD 4.2 File System (FS) Motivation - Applications require greater throughput.
1 Push-to-Peer Video-on-Demand System. 2 Abstract Content is proactively push to peers, and persistently stored before the actual peer-to-peer transfers.
HADOOP DISTRIBUTED FILE SYSTEM HDFS Reliability Based on “The Hadoop Distributed File System” K. Shvachko et al., MSST 2010 Michael Tsitrin 26/05/13.
Storing and Serving Multimedia. What is a Media Server? A scalable storage manager Allocates multimedia data optimally among disk resources Performs memory.
Chapter 14: Mass-Storage Systems Disk Structure. Disk Scheduling. RAID.
NUS.SOC.CS5248 Ooi Wei Tsang 1 Course Matters. NUS.SOC.CS5248 Ooi Wei Tsang 2 Make-Up Lecture This Saturday, 23 October TR7, 1-3pm Topic: “CPU scheduling”
1 Using Network Coding for Dependent Data Broadcasting in a Mobile Environment Chung-Hua Chu, De-Nian Yang and Ming-Syan Chen IEEE GLOBECOM 2007 Reporter.
Large-Scale and Cost-Effective Video Services CS587x Lecture Department of Computer Science Iowa State University.
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 27 – Media Server (Part 2) Klara Nahrstedt Spring 2009.
Shou-Chih Lo and Chia-Wei Tseng National Dong Hwa University A Novel Multi-channel MAC Protocol for Wireless Ad Hoc Networks VTC 2007-spring.
Multimedia Systems Operating System Presentation On
Chapter 2 Memory and process management
Data Dissemination and Management (2) Lecture 10
A Server-less Architecture for Building Scalable, Reliable, and Cost-Effective Video-on-demand Systems Raymond Leung and Jack Y.B. Lee Department of Information.
Video On Demand.
Main Memory Background Swapping Contiguous Allocation Paging
13.3 Accelerating Access to Secondary Storage
Performance-Robust Parallel I/O
Data Dissemination and Management (2) Lecture 10
Presentation transcript:

A Novel Video Layout Strategy for Near-Video-on- Demand Servers Shenze Chen & Manu Thapar Hewlett-Packard Labs 1501 Page Mill Rd. Palo Alto, CA 94304

Table of Contents Introduction Data Layout Strategy Matching Disk Bandwidth with Application Requirement Disk Optimization Strategies Conclusion

Introduction TVoD allocates each client a dedicated channels for video streaming. For NVoD system, the number of channels needed is significantly smaller. The cost of TVoD system is much higher than that of NVoD NVoD requires a much smaller number of video channels Usually, no VCR control is provided for NVoD system. Scalability is no longer the problem (with multicast /broadcast), instead disk throughput may now be the bottleneck.

Data Layout Strategy Movie is broken down in to segment or logical block. The segments are placed on the disk as in the following diagram.

Data Layout Strategy Movie is not placed across a disk array. By using this layout, The disk head can read continuously track by track without any seek within a period. Disk seeks are eliminated, except for the seeks from the innermost to the outermost track between sweeps. When a disk fails, only one movie is out of air, other movie storing on other disks are not affected.

Matching Disk Bandwidth with Application Requirement Placing Multiple Movies on a Single Disk In most cases, the disk bandwidth is much more than that of the video playback rate To utilize these bandwidth, we can put multiple movies on a single disk. The data rates of the movies must be identical. However, the size of the movies need not be the same, approximately the same is already ok.  movies need not to be of same length.

Matching Disk Bandwidth with Application Requirement The following diagram illustrates the placement of 3 movies on a single disk.

Disk Optimization strategies With zoning in disk, the disk is divided into multiple zones with different sizes and transfer rates.

Disk Optimization strategies When doing deterministic performance analysis, we are limited to use the lower data rate at the inner zone for calculation. Thus the deterministic performance greatly reduced. Two strategies are developed to deal with this problem.

The Segment-Group-Pairing (SGP) Strategy This strategy is based on track-pairing scheme. In track pairing scheme, an outer track is paired with an inner track so as to average out the discrepancy in transfer rate. However, since the each retrieval of data block involve a seek, the performance of the disk is greatly reduced. SGP is devised to tackle this problem.

The Segment-Group-Pairing (SGP) Strategy In SGP, Instead of pairing an outer track with an inner track, we pair an outer zone with an inner zone. Data to be retrieved in a service round is broken down into two segments, one is placed in the outer zone, and the other is placed in the inner zone. Advantages: Larger block size and longer service round can be used. Only one seek is involved in a single service round. Data rate of the disk is averaged out. The deterministic performance of the disk is improved.

The Disk Pairing (DP) Strategy A similar approaches to average out the data rates of zones. Suppose we have movies of different data rates to be placed in n disk. In DP, Every movie is divided into n parts If movie A is of highest data rate, then each part of movie A is placed in the outer zones of the disks. If movie B is of second highest data rate, then after the data of movie A is allocated on disk, B will be allocated on the unused highest data rate zones remaining on the disks.

The Disk Pairing (DP) Strategy Playback time of the movies are staggered by Tr/n. where Tr is the period of the transmission. This architecture also enable load balancing between the disk because at each time instant, every disk is scheduling the channels for a movie only.

The Disk Pairing (DP) Strategy Example: suppose we have 2 disk and 2 movies. Movie A and B are divided into 2 parts, according to the Data Layout Strategy. First part of movie A is stored on outer zone of disk 1; First part of movie B is stored on the inner zone of disk 1; Second part of movie A is stored on outer zone of disk 2; Second part of movie B is stored on the inner zone of disk 2;

The Disk Pairing (DP) Strategy Movies are divided “horizontally”.

The Disk Pairing (DP) Strategy By the time when the first part of movie A in disk 1 is serving the channels, the second part of movie A in disk 2 should be idle. By the time when the first part of movie B in disk 2 is serving the channels, the second part of movie B in disk 1 should be idle. Perfect Load Balancing can be achieved. Movies with higher data rate can utilize the higher data rate zones in the disk  performance improve.

Conclusion In this paper, a disk layout strategy is proposed. According to the proposed disk layout strategy, two disk optimization techniques can be applied. Segment Group Pairing (SGP) Disk Pairing (DP) In SGP, the deterministic performance is improved by average out the discrepancy of data rate in different zones. In DP, movies with higher data rate are allocated to zone with higher throughput, thus improving the deterministic performance.