1. Chapter 6 Multimedia Networking Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2002. A note on the use of these ppt slides: We’re making these slides freely available to all (faculty, students, readers). They’re in powerpoint form so you can add, modify, and delete slides (including this one) and slide content to suit your needs. They obviously represent a lot of work on our part. In return for use, we only ask the following:  If you use these slides (e.g., in a class) in substantially unaltered form, that you mention their source (after all, we’d like people to use our book!)  If you post any slides in substantially unaltered form on a www site, that you note that they are adapted from (or perhaps identical to) our slides, and note our copyright of this material. Thanks and enjoy! JFK / KWR All material copyright 1996-2002 J.F Kurose and K.W. Ross, All Rights Reserved

2. Chapter 6 outline r 6.1 Multimedia Networking Applications r 6.2 Streaming stored audio and video m RTSP r 6.3 Real-time, Interactivie Multimedia: Internet Phone Case Study r 6.4 Protocols for Real- Time Interactive Applications m RTP,RTCP m SIP r 6.5 Beyond Best Effort r 6.6 Scheduling and Policing Mechanisms r 6.7 Integrated Services r 6.8 RSVP r 6.9 Differentiated Services

3. Real-time interactive applications r PC-2-PC phone m instant messaging services are providing this r PC-2-phone m Dialpad m Net2phone r videoconference with Webcams Going to now look at a PC-2-PC Internet phone example in detail

4. Interactive Multimedia: Internet Phone Introduce Internet Phone by way of an example r speaker’s audio: alternating talk spurts, silent periods. m 64 kbps during talk spurt r pkts generated only during talk spurts m 20 msec chunks at 8 Kbytes/sec: 160 bytes data r application-layer header added to each chunk. r Chunk+header encapsulated into UDP segment. r application sends UDP segment into socket every 20 msec during talkspurt.

5. Internet Phone: Packet Loss and Delay r network loss: IP datagram lost due to network congestion (router buffer overflow) r delay loss: IP datagram arrives too late for playout at receiver m delays: processing, queueing in network; end-system (sender, receiver) delays m typical maximum tolerable delay: 400 ms r loss tolerance: depending on voice encoding, losses concealed, packet loss rates between 1% and 10% can be tolerated.

6. constant bit rate transmission Cumulative data time variable network delay (jitter) client reception constant bit rate playout at client client playout delay buffered data Delay Jitter r Consider the end-to-end delays of two consecutive packets: difference can be more or less than 20 msec

7. Internet Phone: Fixed Playout Delay r Receiver attempts to playout each chunk exactly q msecs after chunk was generated. m chunk has time stamp t: play out chunk at t+q. m chunk arrives after t+q: data arrives too late for playout, data “lost” r Tradeoff for q: m large q: less packet loss m small q: better interactive experience

8. Fixed Playout Delay Sender generates packets every 20 msec during talk spurt. First packet received at time r First playout schedule: begins at p Second playout schedule: begins at p’

9. Adaptive Playout Delay, I Dynamic estimate of average delay at receiver: where u is a fixed constant (e.g., u =.01). r Goal: minimize playout delay, keeping late loss rate low r Approach: adaptive playout delay adjustment: m Estimate network delay, adjust playout delay at beginning of each talk spurt. m Silent periods compressed and elongated. m Chunks still played out every 20 msec during talk spurt.

10. Adaptive playout delay II Also useful to estimate the average deviation of the delay, v i : The estimates d i and v i are calculated for every received packet, although they are only used at the beginning of a talk spurt. For first packet in talk spurt, playout time is: where K is a positive constant. Remaining packets in talkspurt are played out periodically

11. Adaptive Playout, III Q: How does receiver determine whether packet is first in a talkspurt? r If no loss, receiver looks at successive timestamps. m difference of successive stamps > 20 msec -->talk spurt begins. r With loss possible, receiver must look at both time stamps and sequence numbers. m difference of successive stamps > 20 msec and sequence numbers without gaps --> talk spurt begins.

12. Recovery from packet loss (1) forward error correction (FEC): simple scheme r for every group of n chunks create a redundant chunk by exclusive OR-ing the n original chunks r send out n+1 chunks, increasing the bandwidth by factor 1/n. r can reconstruct the original n chunks if there is at most one lost chunk from the n+1 chunks r Playout delay needs to be fixed to the time to receive all n+1 packets r Tradeoff: m increase n, less bandwidth waste m increase n, longer playout delay m increase n, higher probability that 2 or more chunks will be lost

13. Recovery from packet loss (2) 2nd FEC scheme “piggyback lower quality stream” send lower resolution audio stream as the redundant information for example, nominal stream PCM at 64 kbps and redundant stream GSM at 13 kbps. Whenever there is non-consecutive loss, the receiver can conceal the loss. Can also append (n-1)st and (n-2)nd low-bit rate chunk

14. Recovery from packet loss (3) Interleaving r chunks are broken up into smaller units r for example, 4 5 msec units per chunk r Packet contains small units from different chunks r if packet is lost, still have most of every chunk r has no redundancy overhead r but adds to playout delay

15. Summary: Internet Multimedia: bag of tricks r use UDP to avoid TCP congestion control (delays) for time-sensitive traffic r client-side adaptive playout delay: to compensate for delay r server side matches stream bandwidth to available client-to-server path bandwidth m chose among pre-encoded stream rates m dynamic server encoding rate r error recovery (on top of UDP) m FEC, interleaving m retransmissions, time permitting m conceal errors: repeat nearby data

16. Chapter 6 outline r 6.1 Multimedia Networking Applications r 6.2 Streaming stored audio and video m RTSP r 6.3 Real-time, Interactivie Multimedia: Internet Phone Case Study r 6.4 Protocols for Real- Time Interactive Applications m RTP,RTCP m SIP r 6.5 Beyond Best Effort r 6.6 Scheduling and Policing Mechanisms r 6.7 Integrated Services r 6.8 RSVP r 6.9 Differentiated Services

17. Real-Time Protocol (RTP) r RTP specifies a packet structure for packets carrying audio and video data r RFC 1889 r RTP packet provides m payload type identification m packet sequence numbering m timestamping r RTP runs in the end systems. r RTP packets are encapsulated in UDP segments r Interoperability: If two Internet phone applications run RTP, then they may be able to work together

18. RTP runs on top of UDP RTP libraries provide a transport-layer interface that extend UDP: port numbers, IP addresses payload type identification packet sequence numbering time-stamping

19. RTP Example r Consider sending 64 kbps PCM-encoded voice over RTP. r Application collects the encoded data in chunks, e.g., every 20 msec = 160 bytes in a chunk. r The audio chunk along with the RTP header form the RTP packet, which is encapsulated into a UDP segment. r RTP header indicates type of audio encoding in each packet m sender can change encoding during a conference. r RTP header also contains sequence numbers and timestamps.

20. RTP more r RTP does not provide any mechanism to ensure timely delivery of data or provide other quality of service guarantees. r RTP encapsulation is only seen at the end systems: it is not recognized by routers as a special kind of datagram. m Routers providing best-effort service do not make any special effort to ensure that RTP packets arrive at the destination in a timely matter.  RTP allows for each voice or video device to have its own RTP stream  RTP supports unicast as well as multicast applications

21. RTP Header Payload Type (7 bits): Indicates type of encoding currently being used. If sender changes encoding in middle of conference, sender informs the receiver through this payload type field. Audio Payload Types: Payload type 0: PCM mu-law, 64 kbps Payload type 3, GSM, 13 kbps Payload type 7, LPC, 2.4 kbps Payload type 26, Motion JPEG Payload type 31. H.261 Payload type 33, MPEG2 video Sequence Number (16 bits): Increments by one for each RTP packet sent, and may be used to detect packet loss and to restore packet sequence. Video Payload Types: Payload type 26: Motion JPEG Payload type 31: H.261 Payload type 32: MPEG 1 Payload type 33: MPEG 2

22. RTP Header (2) r Timestamp field (32 bytes long). Reflects the sampling instant of the first byte in the RTP data packet. The clock frequency is dependent on the format of data carried as payload. m if application generates chunks of 160 encoded samples, then timestamp increases by 160 for each RTP packet when source is active. Timestamp clock continues to increase at constant rate when source is inactive. r SSRC field (32 bits long). Identifies the source of the RTP stream. Each stream in a RTP session should have a distinct SSRC.

23. Developing Software Apps with RTP r Two approaches: starting from scratch or using existing libraries m grab video frame, add RTP headers, create UDP addressed segments, send them to UDP socket m include RTP header fields r Using Java RTP class m RTP- part of transport layer m Java Media Framework has compete RTP implementation

24. Real-Time Control Protocol (RTCP) r Works in conjunction with RTP. r Each participant in RTP session periodically transmits RTCP control packets to all other participants. r Each RTCP packet contains sender and/or receiver reports m report statistics useful to application r Statistics include number of packets sent, number of packets lost, interarrival jitter, etc. r Feedback can be used to control performance m Sender may modify its transmissions based on feedback

25. RTCP - Continued - For an RTP session there is typically a single multicast address; all RTP and RTCP packets belonging to the session use the multicast address. - RTP and RTCP packets are distinguished from each other through the use of distinct port numbers (RTCP port= RTP port + 1). - To limit traffic, each participant reduces his RTCP traffic as the number of conference participants increases.

26. RTCP Packet Types Receiver reception report fields: SSRC of each stream received Fraction of packets lost Last sequence number in the stream Interarrival time between packets Sender transmission report fielfs: SSRC of the RTP stream Timespamp and “wall clock” time of most recent packet Number of packets sent Number of bytes sent  Each RTCP packet coming from sender or receiver is sent to the multicast tree that connects all participants

27. Synchronization of Streams r RTCP can synchronize different media streams using RTCP reports r Consider videoconferencing app for which each sender generates one RTP stream for video and one for audio. r Timestamps in RTP packets tied to the video and audio sampling clocks m not tied to the “real-time” clock r Each RTCP sender-report packet contains (for the most recently generated packet in the associated RTP stream): m timestamp of the RTP packet m wall-clock time for when packet was created. r Receivers can use this association to synchronize the playout of the audio and video streams.

28. RTCP Bandwidth Scaling Problem: Receivers and senders transmit RTCP packets into the multicast tree and RTCP transmission rate >> RTP tranmission rate Solution: r RTCP attempts to limit its traffic to 5% of the session bandwidth. Example r Suppose one sender, sending video at a rate of 2 Mbps. Then RTCP attempts to limit its traffic to 100 Kbps. r RTCP gives 75% of this rate to the receivers; remaining 25% to the sender r The 75 kbps is equally shared among receivers: m With R receivers, each receiver gets to send RTCP traffic at 75/R kbps. r Sender gets to send RTCP traffic at 25 kbps. r Participant determines RTCP packet transmission period by calculating avg RTCP packet size (across the entire session) and dividing it by its allocated rate.

29. SIP Long-term vision r All telephone calls and video conference calls take place over the Internet r People are identified by names or e-mail addresses, rather than by phone numbers. r You can reach the callee, no matter where the callee roams, no matter what IP device the callee is currently using. r Session Initiation Protocol r Defined in [RFC 3261]

30. SIP Services r Setting up a call m Provides mechanisms for caller to let callee know she wants to establish a call m Provides mechanisms so that caller and callee can agree on media type and encoding. m Provides mechanisms to end call. r Determine current IP address of callee. m Maps mnemonic identifier to current IP address r Call management m Add new media streams during call m Change encoding during call m Invite others m Transfer and hold calls

31. Setting up a call to a known IP address Alice’s SIP invite message indicates her port number & IP address. Indicates encoding that Alice prefers to receive (PCM μ -law) Bob’s 200 OK message indicates his port number, IP address & preferred encoding (GSM) SIP messages can be sent over TCP or UDP; here sent over RTP/UDP. Default SIP port number is 5060.

32. Setting up a call (more) r Codec negotiation: m Suppose Bob doesn’t have PCM μ- law encoder. m Bob will instead reply with 606 Not Acceptable Reply and list encoders he can use. m Alice can then send a new INVITE message, advertising an appropriate encoder. r Rejecting the call m Bob can reject with replies “busy,” “gone,” “payment required,” “forbidden”.

33. SIP characteristics r Out-of-bound protocol. r SIP messages are ASCII-readable and represent HTTP messages. r SIP requires all messages to be acknowledged -> runs over UDP or TCP.

34. Example of SIP message INVITE sip:bob@domain.com SIP/2.0 Via: SIP/2.0/UDP 167.180.112.24 From: sip:alice@hereway.com To: sip:bob@domain.com Call-ID: a2e3a@pigeon.hereway.com Content-Type: application/sdp Content-Length: 885 c=IN IP4 167.180.112.24 m=audio 38060 RTP/AVP r HTTP message syntax. r Header includes SIP version r Call-ID is unique.

35. Name translation and user locataion r Caller wants to call callee, but only has callee’s name or e-mail address. r Need to get IP address of callee’s current host: m user moves around m DHCP protocol m user has different IP devices (PC, PDA, car device) r Result can be based on: m time of day (work, home) m caller (don’t want boss to call you at home) m status of callee (calls sent to voicemail when callee is already talking to someone) Service provided by SIP servers: r SIP registrar server r SIP proxy server

36. SIP Registrar REGISTER sip:domain.com SIP/2.0 Via: SIP/2.0/UDP 193.64.210.89 From: sip:bob@domain.com To: sip:bob@domain.com Expires: 3600 r When Bob starts SIP client, client sends SIP REGISTER message (with its current IP address) to Bob’s registrar server Register Message:

37. SIP Proxy r Alice send’s invite message to her proxy server m contains address sip:bob@domain.com r Proxy responsible for routing SIP messages to callee m possibly through multiple proxies. r Callee sends response back through the same set of proxies. r Proxy returns SIP response message to Alice m contains Bob’s IP address

38. Example Caller jim@umass.edu places a call to keith@upenn.edu (1) Jim sends INVITE message to umass SIP proxy. (2) Proxy forwards request to upenn registrar server. (3) upenn server returns redirect response, indicating that it should try keith@eurecom.fr (4) umass proxy sends INVITE to eurecom registrar. (5) eurecom regristrar forwards INVITE to 197.87.54.21, which is running keith’s SIP client. (6-8) SIP response sent back (9) media sent directly between clients. http://www.cs.columbia.edu/~hgs/sip/

39. H.323 r H.323 is another signaling protocol for real-time audio and video conferencing among end systems. r H.323 is an umbrella specification r The Gatekeeper is a device similar to an SIP registrar Internet Gatekeeper Gateway Telephone Network

40. Comparison: SIP and H.323 r H.323 is a complete, vertically integrated suite of protocols for multimedia conferencing: signaling, registration, admission control, transport and codecs. r SIP is a single component (addresses only session initiation and management). Works with RTP, but does not mandate it. Can be combined with other protocols and services. r H.323 comes from the ITU (telephony). r SIP comes from IETF: Borrows much of its components from HTTP. SIP has a Web flavor, whereas H.323 has a telephony flavor. r H.323 is large and complex r SIP uses the KISS principle: Keep it simple stupid.