1 / 24

Klara Nahrstedt Spring 2014

CS 414 – Multimedia Systems Design Lecture 19 – Multimedia Transport Subsystem (Part 2) + Midterm Review. Klara Nahrstedt Spring 2014. Midterm. March 7 (Friday),1-1:50pm, 0216 SC Closed Book, Closed Notes You can bring calculator and 1 page cheat sheet. Covered Material.

markchambers
Download Presentation

Klara Nahrstedt Spring 2014

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 414 – Multimedia Systems DesignLecture 19 – Multimedia Transport Subsystem (Part 2) + Midterm Review Klara Nahrstedt Spring 2014 CS 414 - Spring 2014

  2. Midterm March 7 (Friday),1-1:50pm, 0216 SC Closed Book, Closed Notes You can bring calculator and 1 page cheat sheet CS 414 - Spring 2014

  3. Covered Material • Class Notes (Lectures 1-15) • MP1 • Book Chapters to read/study: • Media Coding and Content processing book • Chapter 2, • Chapter 3.1-3.2, 3.8, • Chapter 4.1-4.2.2.1, • Chapter 4.3 (as discussed in lecture) • Chapter 5, chapter 7.1-7.5, 7.7 CS 414 - Spring 2014

  4. Material • Audio Characteristics • Samples, frequency, Nyquist theorem • Perception, psychoacoustic effects, loudness, pitch, decibel, intensity • Sampling rate, quantization • Audio Characteristics • PCM, DPCM, signal-to-noise ratio CS 414 - Spring 2014

  5. Material • Image Characteristics • Sampling, quantization, pixels • Image properties: color CS 414 - Spring 2014

  6. Material • Video technology • Color perception: hue, brightness, saturation, • Visual representation: horizontal and vertical resolution, aspect ratio; depth perception, luminance, temporal resolution and motion • Flicker effect • Color coding: YUV, YIQ, RGB • NTSC vs HDTV formats CS 414 - Spring 2014

  7. Material • Basic Coding schemes • Run-length coding • Statistical coding • Huffman coding • Arithmetic coding • Hybrid codes • JPEG: image preparation, DCT transformation, Quantization, entropy coding, JPEG-2000 characteristics CS 414 - Spring 2014

  8. Material • Hybrid Coding • Video MPEG: image preparation, I, P, B frames characteristics, quantization, display vs processing/transmission order of frames • Audio MPEG: role of psychoacoustic effect, masking, steps of audio compression • MPEG-4: differences to MPEG-2/MPEG-1 • Audio-visual objects, layering • H.261, 263, 264, 265 CS 414 - Spring 2014

  9. Sample Problems • Consider the following alphabet {C,S,4,1}, with probabilities: P(C) = 0.3, P(S) = 0.2, P(4)= 0.25, P(1) = 0.25. • Encode the word CS414 using • Huffman coding and arithmetic coding • Compare which encoding requires less bits CS 414 - Spring 2014

  10. Sample Problems Describe briefly each step in MPEG-1 audio encoding. Specify the functionality, which is performed in each step. You don’t have to provide equations, only a clear explanation of the functionality that is performed inside each step. CS 414 - Spring 2014

  11. Sample Problems What is flicker effect and how to remove it? Provide five differences between MPEG-4 video encoding standard and the previous MPEG video encoding standards CS 414 - Spring 2014

  12. Covered Aspects of Multimedia Audio/Video Presentation Playback Image/Video Capture Audio/Video Perception/ Playback Image/Video Information Representation Transmission Transmission Compression Processing Audio Capture Media Server Storage Audio Information Representation A/V Playback CS 414 - Spring 2014

  13. We have discussed so far • Quality of Service • Multimedia Data Establishment Protocol • Negotiation and Translation of QoS CS 414 - Spring 2014

  14. What we will talk about today • Multimedia Call Establishment Protocol • Admission and Reservation Operations • Bandwidth Admission • Processing Admission • Data Streaming/Transmission Operations • Traffic Shaping CS 414 - Spring 2014

  15. Bandwidth Admission Test • Consider • bi – reserved bandwidth for the ‘i’ connection • Bmax– maximal bandwidth at the network interface • Admission test (if all connections declare their bandwidth requirements bi at the same time): • ∑(i=1,…n) bi ≤ Bmax • Example: • Bmax = 100 Mbps, • Bandwidth requirement of connection 1 b1 = 10 Mbps • Bandwidth requirement of connection 2 b2 = 20 Mbps • Admission Control Condition: b1 + b2 < Bmax • Step 1: if b1 < Bmax then admit b1, reserve b1, adjust Bmax to Bavail= Bmax – b1 • Step 2: if b2 < Bavail then admit b2, reserve b2, adjust Bavail to Bavail = Bavail – b2 CS 414 - Spring 2014

  16. Packet/Frame Scheduling Admission • Systems have queues • We need packet/frame scheduling policies for admitting new streams • We need frame/packet schedulability tests • Note that in networking only NON-PREEMPTIVE scheduling exists!!! CS 414 - Spring 2014

  17. Packet/Frame Scheduling Admission Control serve– packet/frame service time at the processors – constant time due to hardware implementation q_in and q_out are queuing times N – number of packets in queue λ – service rate q = N/λ (Little Theorem) r– service rate of the switch ei– processing of a packet ‘i’ in network node Admission Test: ei ≤ deadline ∑(i=1,…,n) servei/ (1/r) ≤ 1 1/r – packet/frame period on processor CS 414 - Spring 2014

  18. Resource Reservation/Allocation • Bandwidth reservation • Pessimistic reservation with maximal bandwidth allocation: Given (MN, RA, and MA) • if then CS 414 - Spring 2014

  19. Pessimistic Resource Reservation (Example) • Example: Consider sequence of MPEG video frames of size 80KB, 60 KB, 20KB, 20 KB, 60KB, 20 KB, 20 KB (Group of Pictures I, P, B, B, P, B, B ), • Pessimistic frame size calculation: • MA= max(80, 60, 20, 20, 60, 20, 20) = 80KB • Given video frame rate RA = 20 fps • If Given MN = 10 KB (network packet size, e.g., packet size for the transport layer like TCP/UDP), then need to consider bandwidth/ throughput reservation for • BN = 10KB x (8 network packets per application frame) x 20 application frames per second= 1600 KB/second = 12800 Kbps CS 414 - Spring 2014

  20. Optimistic Resource Reservation/Allocation • Optimistic reservation considers average bandwidth allocation • Given MA, RA, MN, where • Then CS 414 - Spring 2014

  21. Optimistic Resource Reservation (Example) • Example: Consider sequence of MPEG video frames of size 80KB, 60 KB, 20KB, 20 KB, 60KB, 20 KB, 20 KB (Group of Pictures I, P, B, B, P, B, B, ), • Optimistic frame size calculation: • MA = 280/7 = 40 KB • Given video frame rate RA = 20 fps • If Given MN = 10 KB (network packet size, e.g., packet size for the transport layer like TCP/UDP), then need to consider bandwidth/ throughput reservation for • BN = 10KB x (4 network packets per application frame) x 20 application frames per second= 800 KB/second = 6400 Kbps CS 414 - Spring 2014

  22. Sender-Oriented Reservation Protocol CS 414 - Spring 2014

  23. Receiver-Oriented Reservation Protocol CS 414 - Spring 2014

  24. Conclusion • Multimedia Call Establishment Protocol requires • QoS Parameter negotiation (exchange) • QoS Parameter translation • Admission Control of resources needed to provide QoS requirements • Bandwidth admission • Frame/Packet scheduling admission • Reservation of resources for admitted multimedia streams CS 414 - Spring 2014

More Related