Multimedia Transport (Part 1) : Klara Nahrstedt Spring 2014
Multimedia Transport (Part 1) : Klara Nahrstedt Spring 2014
Multimedia Transport (Part 1) : Klara Nahrstedt Spring 2014
Lecture 18
Multimedia Transport (Part 1)
Administrative
HW1 on due March 3 @ 11:59pm Midterm March 7 in class
Transmission
Audio Capture Compression Processing
Transmission
A/V Playback
Translation
Network AT&T
High Data Throughput need to support application data with stream-like behavior and in real time Fast data forwarding the faster the transport system can move packets the fewer packets have to be buffered Service Guarantees need appropriate resource management
Audio/video communication needs to be bounded by deadlines End-to-end jitter must be bounded End-to-end guarantees are required Synchronization mechanisms for different data streams are required Variable bit rate traffic support is required Services and protocols should make sure that no starvation occurs
CS 414 - Spring 2014
Connection Establishment
QoS parameters:
End-to-end delay, jitter, throughput, packet loss rate Application/user defines QoS parameters (e.g., video stream parameters) QoS parameters are distributed and negotiated among participating parties QoS parameters are translated between different layers QoS parameters are mapped to resource requirements Required resources are admitted, reserved and allocated along the path between sender and receiver(s)
negotiation and triangular negotiation (if service provider allows for negotiation)
Negotiation Protocol
(P2P Receiver-Initiated Negotiation Example1)
time
Setup Socket Communication
0 Wait
time
Requested Video rate (e.g.,20fps)
0
Setup Socket Communication Send User/Receiver requested QoS (video rate 20fps)
- Receive Requested rate -Check with Recorded rate -If requested > recorded Then decrease rate, else O.K. -Translate QoS param. -Perform Resource Admission/Reservation If admission O.K, else Decrease rate, redo Admission/reservation Wait - Send resulting rate
Wait
Resulting video rate (e.g.,10 fps)
Sender (Server)
CS 414 - Spring 2014
Negotiation Protocol
(P2P Receiver-Initiated Negotiation Example2)
time
Setup Socket Communication
time
Wait - Receive Requested rate -Check with Recorded rate -If requested > recorded Then decrease rate, else O.K. -Translate QoS param. -Perform Resource Admission/Reservation If admission O.K, else Decrease rate, redo Admission/reservation -Send resulting rate -Start streaming
Wait
Resulting video rate (e.g.,10 fps)
-Get QoS (video rate) from user - Translate QoS - Perform admission, if admission O.K., then reserve local resources, else decrease requested rate, redo admission/reservation
Sender (Server)
CS 414 - Spring 2014
Receiver (Client)
Negotiation Protocol
(P2P Sender-Initiated Negotiation - Example)
time
Setup Socket Comm, get movie name -Get recorded rate as the requested rate from the recorded video file -Perform admission, if admission O.K, reserve resources, else decrease rate - Send requested QoS (video rate 20fps)
time
0
Setup Socket Communication (also send server requested video file/movie name)
Wait
-Receive requested
Wait
Final video rate (20 fps)
rate -Translate QoS param. -Perform admission, If admission O.K, , then Reserve resources, else Decrease rate - Send agreed/final rate
Wait
Sender (Server)
Receiver (Client)
Example of Translation
Consider application QoS (frame size MA, frame rate RA) and network QoS (throughput BN, packet rate RN) Assume
MA = (320x240 pixels, 1 pixel = 8 bits), RA = 10 fps, packet size MN = 4KBytes BA = MA x RA = (320 x 240 x 8) x 10 = 6,144,000 bps
Application Throughput:
BN = MN x RN = 6,225,920 bps
CS 414 - Spring 2014
Consider
reserved bandwidth for the i connection Bmax maximal bandwidth at the network interface
bi
Admission test (if all connections declare their bandwidth requirements bi at the same time):
(i=1,n)
bi Bmax
CS 414 - Spring 2014
Bandwidth Admission
Admission Test (if requests come in iterative fashion) : Consider
bandwidth already admitted, allocated i and promised to connection i req b bandwidth requested by connection j j alloc Bavail = Bmax - bi , where i j
b
(i=1,..n)
alloc
Admission Test:
b
req j
Bavail
CS 414 - Spring 2014
Note
serve packet service time at the processors constant time due to hardware implementation q_in and q_out are queuing times q = N/ (Little Theorem) r service rate of the switch
Resource Reservation/Allocation
Bandwidth reservation
Pessimistic
reservation with maximal bandwidth allocation: Given (MN, RA, and MA)
if
i M A maxi1,...n (M A )
then
BN M N (M A / M N ) RA
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:
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
i M A (1 / n M A ) i 1 n
Then B M ( M A ) R N N A MN
CS 414 - Spring 2014
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
Conclusion
Multimedia System/networking designer must be clear about the requirements coming from the applications and users Multimedia system/networking designer must be also clear about the constraints, what underlying protocols, services and networks can and cannot do and promise whats possible to guarantee and deliver
ADDITIONAL SLIDES
Reservation Styles
IETF (Internet Engineering Task Force) standard defines three types of reservation styles
Wildcard
Allows receiver to create a single reservation along each link shared among all senders for the given session
Fixed
filter
Allows each receiver to create a single reservation from a particular sender whose packets it wants to receive
Dynamic
filter
Allows each receiver to create N reservations to carry flows from up to N different senders. This style allows the receiver to do channel switching (similar to TV channel switching)
CS 414 - Spring 2014
Reservation Styles