CS 414 – Multimedia Systems Design Lecture 40 – Final Exam Review SessionAdministrative (1)Administrative (2)Administrative (3)Administrative (4)Final Exams FactFinal Exam TopicsNetworksNetworksMedia ServersMultimedia CPU SchedulingBuffer ManagementSynchronizationP2P StreamingApplications - major conceptsSample ProblemsBuffer ManagementSchedulingSlide 19Other questionsConclusionCS 414 - Spring 2011CS 414 – Multimedia Systems Design Lecture 40 – Final Exam Review Session Klara Nahrstedt Spring 2011Administrative (1) Homework 2 is posted Due Monday, May 9, 11:59pm via compass or slide paper form of homework under the door of the office 3104 SCOffice hours for HW2 assistanceTuesday, May 3, 11-12 in TA officeHomework 2 re-grading periodWednesday, May 11 and Thursday, May 12via email to TACS 414 - Spring 2011Administrative (2) Wednesday, May 4 - No CLASS – Class cancelled Wednesday, May 4 – No office hours of instructor between 9-10amCS 414 - Spring 2011Administrative (3)Peer evaluation Friday, May 6, 5pm via email ([email protected])Peer evaluation form is on the class website under “Grading Policies”Office hours for final exam assistanceWednesday, May 11, 10-12 in Instructor’s office - Room 3104 SCCS 414 - Spring 2011Administrative (4) Final Grades for the class will be posted latest by May 14 in Banner and Compass systemsRe-grading requests for final exam You can come and see you exam in my office - arrange meeting via email (either in May or in Fall 2011)CS 414 - Spring 2011Final Exams Fact May 13, 8-11am, two rooms 1302 SC and 1304 SCDivision of students between classrooms: Students with last names starting with letters A-J go to room 1302 SCStudents with last names starting with letters K-Z go to room 1304 SCClosed book and closed notes exam You are allowed calculatorYou are allowed a A4-size sheet with class material information (both sides)CS 414 - Spring 2011Final Exam TopicsReading List – Lectures Slides from Lectures 15-38Reading List – Multimedia Systems BookMPs – questions from MPs CS 414 - Spring 2011Networks Chapter 2 – QoS All topics except QoS routingChapter 55.1 Service and Network requirementsChapter 66.1 requirements and constraints6.2.1-6.2.2 IPv4 and IPv6 CS 414 - Spring 2011NetworksChapter 66.3 Traditional protocols and their support of MM 6.3.1 TCP6.3.2 UDP6.4.3, 6.4.4 RSVP, IntServ, and 6.4.6 DiffServ6.5.2 RTP/RTCPChapter 7 7.4 Session Management7.5.1 SDP/SAP/SIP/RTSPCS 414 - Spring 2011Media ServersChapter 4 4.1 Architecture4.2 Storage Devices4.3 Disk Controller 4.4 Storage Management 4.4.1 disk management4.4.3 multimedia disk scheduling4.4.4 admission control 4.6.1-4.6.4 Memory Management CS 414 - Spring 2011Multimedia CPU Scheduling Chapter 33.1.1-3.1.5 requirements, model of RT scheduling, scheduling policiesRate monotonic scheduling and EDF Comparison between RMS and EDFCS 414 - Spring 2011Buffer Management Chapter 33.3.1-3.3.3 buffer management techniques, buffer management for client-server systemsConditions of buffer management (starvation and overflow)CS 414 - Spring 2011Synchronization Chapter 8 8.1 introduction, basic concepts of open and closed LDU, intra and inter-synchronization, 8.2 requirements in synchronization, lip sync, 8.5 synchronization types,8.7 reference models for multimedia synchronization, 8.9 specification methods for multimedia synchronizationInterval-based, time-based, hierarchical, event-basedCS 414 - Spring 2011P2P StreamingM. Castro, P. Druschel, A-M. Kermarrec, A. Nandi, A. Rowstron and A.Singh, "SplitStream: High-bandwidth multicast in a cooperative environment ", SOSP'03,Lake Bolton, New York, October, 2003. H. Deshpande, M. Bawa, H. Garcia-Molina. "Streaming Live Media over Peers." Technical Report, Stanford InfoLab, 2002.N. Magharei, R. Rejaie. "PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming." INFOCOM 2007.N. Magharei, R. Rejaie, Y. Guo. "Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches." INFOCOM 2007.CS 414 - Spring 2011Applications - major concepts S. Baset, H. Schulzrinne, "An Analasis of the Skype Peer-to-Peer Internet Telephony Protocol", 2004Liu et al. "Opportunities and challenges of peer-to-peer Internet video broadcast." IEEE Special Issue on Recent Advances in Distributed Multimedia Communications, 2007.CS 414 - Spring 2011Sample Problems Buffer Management Consider a multimedia file system. In this system, data for client requests are retrieved in cycles P ( P refers to the common time period of the whole system, e.g., data for client are retrieved every P=100 ms). If a client ‘i’ has the consumption rate fi (in bits per second) and there are k bits in the buffer at the start of a cycle, then the admission controller checks at the start of each cycle if k ≥ P x fi. With this admission test, what does the admission controller ensures? Explain. CS 414 - Spring 2011Buffer ManagementLet us assume Video-on-Demand (VOD ) service with one client and one server. Let us assume that the server sends the Motion JPEG video at 20 frames per second and the client receives 20 frames per second. Let us assume that the end-to-end delay between client and server is 50 ms (in both directions) including the computational overheads on client and server side. Let us assume that the movie in fast forward (FF) mode uses step-skipping method and step is equal to 5 (e.g. if FF mode is triggered from the beginning, only frames will be played: 1st, 6th, 11th, 16th, etc). Under the above assumption, consider the following scenario: The client receives streaming video and plays it on the screen. Suddenly somewhere in the middle of the movie, the client switches to fast forward operation. What is the minimal buffer size (in number of frames) at the client side for this scenario, so that the movie in fast forward mode will continue to play the FF frames at the rate of 20 frames per second? CS 414 - Spring 2011Scheduling Let us assume retrieval of three MPEG-2 videos with the following Group of Pictures (GOP) IPBBP… Note that each movie is stored with the same GOP pattern at the media server. The processing time ‘e’ of the individual frames fluctuates as follows: e(I) = 10ms +/- 2 ms, e(P) = 5 ms +/- 1ms, e(B) = 2ms
View Full Document
Unlocking...