Debian Codegraph @

rfc1889.html

raw
1 <pre>Network Working Group Audio-Video Transport Working Group
2 Request for Comments: 1889 H. Schulzrinne
3 Category: Standards Track GMD Fokus
4 S. Casner
5 Precept Software, Inc.
6 R. Frederick
7 Xerox Palo Alto Research Center
8 V. Jacobson
9 Lawrence Berkeley National Laboratory
10 January 1996
11
12
13 <span class="h1">RTP: A Transport Protocol for Real-Time Applications</span>
14
15 Status of this Memo
16
17 This document specifies an Internet standards track protocol for the
18 Internet community, and requests discussion and suggestions for
19 improvements. Please refer to the current edition of the "Internet
20 Official Protocol Standards" (STD 1) for the standardization state
21 and status of this protocol. Distribution of this memo is unlimited.
22
23 Abstract
24
25 This memorandum describes RTP, the real-time transport protocol. RTP
26 provides end-to-end network transport functions suitable for
27 applications transmitting real-time data, such as audio, video or
28 simulation data, over multicast or unicast network services. RTP does
29 not address resource reservation and does not guarantee quality-of-
30 service for real-time services. The data transport is augmented by a
31 control protocol (RTCP) to allow monitoring of the data delivery in a
32 manner scalable to large multicast networks, and to provide minimal
33 control and identification functionality. RTP and RTCP are designed
34 to be independent of the underlying transport and network layers. The
35 protocol supports the use of RTP-level translators and mixers.
36
37 Table of Contents
38
39 <a href="#section-1">1</a>. Introduction ........................................ <a href="#page-3">3</a>
40 <a href="#section-2">2</a>. RTP Use Scenarios ................................... <a href="#page-5">5</a>
41 <a href="#section-2.1">2.1</a> Simple Multicast Audio Conference ................... <a href="#page-5">5</a>
42 <a href="#section-2.2">2.2</a> Audio and Video Conference .......................... <a href="#page-6">6</a>
43 <a href="#section-2.3">2.3</a> Mixers and Translators .............................. <a href="#page-6">6</a>
44 <a href="#section-3">3</a>. Definitions ......................................... <a href="#page-7">7</a>
45 <a href="#section-4">4</a>. Byte Order, Alignment, and Time Format .............. <a href="#page-9">9</a>
46 <a href="#section-5">5</a>. RTP Data Transfer Protocol .......................... <a href="#page-10">10</a>
47 <a href="#section-5.1">5.1</a> RTP Fixed Header Fields ............................. <a href="#page-10">10</a>
48 <a href="#section-5.2">5.2</a> Multiplexing RTP Sessions ........................... <a href="#page-13">13</a>
49
50
51
52 <span class="grey">Schulzrinne, et al Standards Track [Page 1]</span></pre>
53 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
54 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
55
56
57 <a href="#section-5.3">5.3</a> Profile-Specific Modifications to the RTP Header..... <a href="#page-14">14</a>
58 <a href="#section-5.3.1">5.3.1</a> RTP Header Extension ................................ <a href="#page-14">14</a>
59 <a href="#section-6">6</a>. RTP Control Protocol -- RTCP ........................ <a href="#page-15">15</a>
60 <a href="#section-6.1">6.1</a> RTCP Packet Format .................................. <a href="#page-17">17</a>
61 <a href="#section-6.2">6.2</a> RTCP Transmission Interval .......................... <a href="#page-19">19</a>
62 <a href="#section-6.2.1">6.2.1</a> Maintaining the number of session members ........... <a href="#page-21">21</a>
63 <a href="#section-6.2.2">6.2.2</a> Allocation of source description bandwidth .......... <a href="#page-21">21</a>
64 <a href="#section-6.3">6.3</a> Sender and Receiver Reports ......................... <a href="#page-22">22</a>
65 <a href="#section-6.3.1">6.3.1</a> SR: Sender report RTCP packet ....................... <a href="#page-23">23</a>
66 <a href="#section-6.3.2">6.3.2</a> RR: Receiver report RTCP packet ..................... <a href="#page-28">28</a>
67 <a href="#section-6.3.3">6.3.3</a> Extending the sender and receiver reports ........... <a href="#page-29">29</a>
68 <a href="#section-6.3.4">6.3.4</a> Analyzing sender and receiver reports ............... <a href="#page-29">29</a>
69 <a href="#section-6.4">6.4</a> SDES: Source description RTCP packet ................ <a href="#page-31">31</a>
70 <a href="#section-6.4.1">6.4.1</a> CNAME: Canonical end-point identifier SDES item ..... <a href="#page-32">32</a>
71 <a href="#section-6.4.2">6.4.2</a> NAME: User name SDES item ........................... <a href="#page-34">34</a>
72 <a href="#section-6.4.3">6.4.3</a> EMAIL: Electronic mail address SDES item ............ <a href="#page-34">34</a>
73 <a href="#section-6.4.4">6.4.4</a> PHONE: Phone number SDES item ....................... <a href="#page-34">34</a>
74 <a href="#section-6.4.5">6.4.5</a> LOC: Geographic user location SDES item ............. <a href="#page-35">35</a>
75 <a href="#section-6.4.6">6.4.6</a> TOOL: Application or tool name SDES item ............ <a href="#page-35">35</a>
76 <a href="#section-6.4.7">6.4.7</a> NOTE: Notice/status SDES item ....................... <a href="#page-35">35</a>
77 <a href="#section-6.4.8">6.4.8</a> PRIV: Private extensions SDES item .................. <a href="#page-36">36</a>
78 <a href="#section-6.5">6.5</a> BYE: Goodbye RTCP packet ............................ <a href="#page-37">37</a>
79 <a href="#section-6.6">6.6</a> APP: Application-defined RTCP packet ................ <a href="#page-38">38</a>
80 <a href="#section-7">7</a>. RTP Translators and Mixers .......................... <a href="#page-39">39</a>
81 <a href="#section-7.1">7.1</a> General Description ................................. <a href="#page-39">39</a>
82 <a href="#section-7.2">7.2</a> RTCP Processing in Translators ...................... <a href="#page-41">41</a>
83 <a href="#section-7.3">7.3</a> RTCP Processing in Mixers ........................... <a href="#page-43">43</a>
84 <a href="#section-7.4">7.4</a> Cascaded Mixers ..................................... <a href="#page-44">44</a>
85 <a href="#section-8">8</a>. SSRC Identifier Allocation and Use .................. <a href="#page-44">44</a>
86 <a href="#section-8.1">8.1</a> Probability of Collision ............................ <a href="#page-44">44</a>
87 <a href="#section-8.2">8.2</a> Collision Resolution and Loop Detection ............. <a href="#page-45">45</a>
88 <a href="#section-9">9</a>. Security ............................................ <a href="#page-49">49</a>
89 <a href="#section-9.1">9.1</a> Confidentiality ..................................... <a href="#page-49">49</a>
90 <a href="#section-9.2">9.2</a> Authentication and Message Integrity ................ <a href="#page-50">50</a>
91 <a href="#section-10">10</a>. RTP over Network and Transport Protocols ............ <a href="#page-51">51</a>
92 <a href="#section-11">11</a>. Summary of Protocol Constants ....................... <a href="#page-51">51</a>
93 <a href="#section-11.1">11.1</a> RTCP packet types ................................... <a href="#page-52">52</a>
94 <a href="#section-11.2">11.2</a> SDES types .......................................... <a href="#page-52">52</a>
95 <a href="#section-12">12</a>. RTP Profiles and Payload Format Specifications ...... <a href="#page-53">53</a>
96 <a href="#appendix-A">A</a>. Algorithms .......................................... <a href="#page-56">56</a>
97 <a href="#appendix-A.1">A.1</a> RTP Data Header Validity Checks ..................... <a href="#page-59">59</a>
98 <a href="#appendix-A.2">A.2</a> RTCP Header Validity Checks ......................... <a href="#page-63">63</a>
99 A.3 Determining the Number of RTP Packets Expected and
100 Lost ................................................ <a href="#page-63">63</a>
101 <a href="#appendix-A.4">A.4</a> Generating SDES RTCP Packets ........................ <a href="#page-64">64</a>
102 <a href="#appendix-A.5">A.5</a> Parsing RTCP SDES Packets ........................... <a href="#page-65">65</a>
103 <a href="#appendix-A.6">A.6</a> Generating a Random 32-bit Identifier ............... <a href="#page-66">66</a>
104 <a href="#appendix-A.7">A.7</a> Computing the RTCP Transmission Interval ............ <a href="#page-68">68</a>
105
106
107
108 <span class="grey">Schulzrinne, et al Standards Track [Page 2]</span></pre>
109 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
110 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
111
112
113 <a href="#appendix-A.8">A.8</a> Estimating the Interarrival Jitter .................. <a href="#page-71">71</a>
114 <a href="#appendix-B">B</a>. Security Considerations ............................. <a href="#page-72">72</a>
115 <a href="#appendix-C">C</a>. Addresses of Authors ................................ <a href="#page-72">72</a>
116 <a href="#appendix-D">D</a>. Bibliography ........................................ <a href="#page-73">73</a>
117
118 <span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
119
120 This memorandum specifies the real-time transport protocol (RTP),
121 which provides end-to-end delivery services for data with real-time
122 characteristics, such as interactive audio and video. Those services
123 include payload type identification, sequence numbering, timestamping
124 and delivery monitoring. Applications typically run RTP on top of UDP
125 to make use of its multiplexing and checksum services; both protocols
126 contribute parts of the transport protocol functionality. However,
127 RTP may be used with other suitable underlying network or transport
128 protocols (see <a href="#section-10">Section 10</a>). RTP supports data transfer to multiple
129 destinations using multicast distribution if provided by the
130 underlying network.
131
132 Note that RTP itself does not provide any mechanism to ensure timely
133 delivery or provide other quality-of-service guarantees, but relies
134 on lower-layer services to do so. It does not guarantee delivery or
135 prevent out-of-order delivery, nor does it assume that the underlying
136 network is reliable and delivers packets in sequence. The sequence
137 numbers included in RTP allow the receiver to reconstruct the
138 sender's packet sequence, but sequence numbers might also be used to
139 determine the proper location of a packet, for example in video
140 decoding, without necessarily decoding packets in sequence.
141
142 While RTP is primarily designed to satisfy the needs of multi-
143 participant multimedia conferences, it is not limited to that
144 particular application. Storage of continuous data, interactive
145 distributed simulation, active badge, and control and measurement
146 applications may also find RTP applicable.
147
148 This document defines RTP, consisting of two closely-linked parts:
149
150 o the real-time transport protocol (RTP), to carry data that has
151 real-time properties.
152
153 o the RTP control protocol (RTCP), to monitor the quality of
154 service and to convey information about the participants in an
155 on-going session. The latter aspect of RTCP may be sufficient
156 for "loosely controlled" sessions, i.e., where there is no
157 explicit membership control and set-up, but it is not
158 necessarily intended to support all of an application's control
159 communication requirements. This functionality may be fully or
160 partially subsumed by a separate session control protocol,
161
162
163
164 <span class="grey">Schulzrinne, et al Standards Track [Page 3]</span></pre>
165 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
166 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
167
168
169 which is beyond the scope of this document.
170
171 RTP represents a new style of protocol following the principles of
172 application level framing and integrated layer processing proposed by
173 Clark and Tennenhouse [<a href="#ref-1" title="&quot;Architectural considerations for a new generation of protocols,&quot;">1</a>]. That is, RTP is intended to be malleable
174 to provide the information required by a particular application and
175 will often be integrated into the application processing rather than
176 being implemented as a separate layer. RTP is a protocol framework
177 that is deliberately not complete. This document specifies those
178 functions expected to be common across all the applications for which
179 RTP would be appropriate. Unlike conventional protocols in which
180 additional functions might be accommodated by making the protocol
181 more general or by adding an option mechanism that would require
182 parsing, RTP is intended to be tailored through modifications and/or
183 additions to the headers as needed. Examples are given in Sections
184 5.3 and 6.3.3.
185
186 Therefore, in addition to this document, a complete specification of
187 RTP for a particular application will require one or more companion
188 documents (see <a href="#section-12">Section 12</a>):
189
190 o a profile specification document, which defines a set of
191 payload type codes and their mapping to payload formats (e.g.,
192 media encodings). A profile may also define extensions or
193 modifications to RTP that are specific to a particular class of
194 applications. Typically an application will operate under only
195 one profile. A profile for audio and video data may be found in
196 the companion RFC TBD.
197
198 o payload format specification documents, which define how a
199 particular payload, such as an audio or video encoding, is to
200 be carried in RTP.
201
202 A discussion of real-time services and algorithms for their
203 implementation as well as background discussion on some of the RTP
204 design decisions can be found in [<a href="#ref-2" title="&quot;Issues in designing a transport protocol for audio and video conferences and other multiparticipant real-time applications&quot;">2</a>].
205
206 Several RTP applications, both experimental and commercial, have
207 already been implemented from draft specifications. These
208 applications include audio and video tools along with diagnostic
209 tools such as traffic monitors. Users of these tools number in the
210 thousands. However, the current Internet cannot yet support the full
211 potential demand for real-time services. High-bandwidth services
212 using RTP, such as video, can potentially seriously degrade the
213 quality of service of other network services. Thus, implementors
214 should take appropriate precautions to limit accidental bandwidth
215 usage. Application documentation should clearly outline the
216 limitations and possible operational impact of high-bandwidth real-
217
218
219
220 <span class="grey">Schulzrinne, et al Standards Track [Page 4]</span></pre>
221 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
222 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
223
224
225 time services on the Internet and other network services.
226
227 <span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. RTP Use Scenarios</span>
228
229 The following sections describe some aspects of the use of RTP. The
230 examples were chosen to illustrate the basic operation of
231 applications using RTP, not to limit what RTP may be used for. In
232 these examples, RTP is carried on top of IP and UDP, and follows the
233 conventions established by the profile for audio and video specified
234 in the companion Internet-Draft <a href="./draft-ietf-avt-profile">draft-ietf-avt-profile</a>
235
236 <span class="h3"><a class="selflink" id="section-2.1" href="#section-2.1">2.1</a> Simple Multicast Audio Conference</span>
237
238 A working group of the IETF meets to discuss the latest protocol
239 draft, using the IP multicast services of the Internet for voice
240 communications. Through some allocation mechanism the working group
241 chair obtains a multicast group address and pair of ports. One port
242 is used for audio data, and the other is used for control (RTCP)
243 packets. This address and port information is distributed to the
244 intended participants. If privacy is desired, the data and control
245 packets may be encrypted as specified in <a href="#section-9.1">Section 9.1</a>, in which case
246 an encryption key must also be generated and distributed. The exact
247 details of these allocation and distribution mechanisms are beyond
248 the scope of RTP.
249
250 The audio conferencing application used by each conference
251 participant sends audio data in small chunks of, say, 20 ms duration.
252 Each chunk of audio data is preceded by an RTP header; RTP header and
253 data are in turn contained in a UDP packet. The RTP header indicates
254 what type of audio encoding (such as PCM, ADPCM or LPC) is contained
255 in each packet so that senders can change the encoding during a
256 conference, for example, to accommodate a new participant that is
257 connected through a low-bandwidth link or react to indications of
258 network congestion.
259
260 The Internet, like other packet networks, occasionally loses and
261 reorders packets and delays them by variable amounts of time. To cope
262 with these impairments, the RTP header contains timing information
263 and a sequence number that allow the receivers to reconstruct the
264 timing produced by the source, so that in this example, chunks of
265 audio are contiguously played out the speaker every 20 ms. This
266 timing reconstruction is performed separately for each source of RTP
267 packets in the conference. The sequence number can also be used by
268 the receiver to estimate how many packets are being lost.
269
270 Since members of the working group join and leave during the
271 conference, it is useful to know who is participating at any moment
272 and how well they are receiving the audio data. For that purpose,
273
274
275
276 <span class="grey">Schulzrinne, et al Standards Track [Page 5]</span></pre>
277 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
278 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
279
280
281 each instance of the audio application in the conference periodically
282 multicasts a reception report plus the name of its user on the RTCP
283 (control) port. The reception report indicates how well the current
284 speaker is being received and may be used to control adaptive
285 encodings. In addition to the user name, other identifying
286 information may also be included subject to control bandwidth limits.
287 A site sends the RTCP BYE packet (<a href="#section-6.5">Section 6.5</a>) when it leaves the
288 conference.
289
290 <span class="h3"><a class="selflink" id="section-2.2" href="#section-2.2">2.2</a> Audio and Video Conference</span>
291
292 If both audio and video media are used in a conference, they are
293 transmitted as separate RTP sessions RTCP packets are transmitted for
294 each medium using two different UDP port pairs and/or multicast
295 addresses. There is no direct coupling at the RTP level between the
296 audio and video sessions, except that a user participating in both
297 sessions should use the same distinguished (canonical) name in the
298 RTCP packets for both so that the sessions can be associated.
299
300 One motivation for this separation is to allow some participants in
301 the conference to receive only one medium if they choose. Further
302 explanation is given in <a href="#section-5.2">Section 5.2</a>. Despite the separation,
303 synchronized playback of a source's audio and video can be achieved
304 using timing information carried in the RTCP packets for both
305 sessions.
306
307 <span class="h3"><a class="selflink" id="section-2.3" href="#section-2.3">2.3</a> Mixers and Translators</span>
308
309 So far, we have assumed that all sites want to receive media data in
310 the same format. However, this may not always be appropriate.
311 Consider the case where participants in one area are connected
312 through a low-speed link to the majority of the conference
313 participants who enjoy high-speed network access. Instead of forcing
314 everyone to use a lower-bandwidth, reduced-quality audio encoding, an
315 RTP-level relay called a mixer may be placed near the low-bandwidth
316 area. This mixer resynchronizes incoming audio packets to reconstruct
317 the constant 20 ms spacing generated by the sender, mixes these
318 reconstructed audio streams into a single stream, translates the
319 audio encoding to a lower-bandwidth one and forwards the lower-
320 bandwidth packet stream across the low-speed link. These packets
321 might be unicast to a single recipient or multicast on a different
322 address to multiple recipients. The RTP header includes a means for
323 mixers to identify the sources that contributed to a mixed packet so
324 that correct talker indication can be provided at the receivers.
325
326 Some of the intended participants in the audio conference may be
327 connected with high bandwidth links but might not be directly
328 reachable via IP multicast. For example, they might be behind an
329
330
331
332 <span class="grey">Schulzrinne, et al Standards Track [Page 6]</span></pre>
333 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
334 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
335
336
337 application-level firewall that will not let any IP packets pass. For
338 these sites, mixing may not be necessary, in which case another type
339 of RTP-level relay called a translator may be used. Two translators
340 are installed, one on either side of the firewall, with the outside
341 one funneling all multicast packets received through a secure
342 connection to the translator inside the firewall. The translator
343 inside the firewall sends them again as multicast packets to a
344 multicast group restricted to the site's internal network.
345
346 Mixers and translators may be designed for a variety of purposes. An
347 example is a video mixer that scales the images of individual people
348 in separate video streams and composites them into one video stream
349 to simulate a group scene. Other examples of translation include the
350 connection of a group of hosts speaking only IP/UDP to a group of
351 hosts that understand only ST-II, or the packet-by-packet encoding
352 translation of video streams from individual sources without
353 resynchronization or mixing. Details of the operation of mixers and
354 translators are given in <a href="#section-7">Section 7</a>.
355
356 <span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Definitions</span>
357
358 RTP payload: The data transported by RTP in a packet, for example
359 audio samples or compressed video data. The payload format and
360 interpretation are beyond the scope of this document.
361
362 RTP packet: A data packet consisting of the fixed RTP header, a
363 possibly empty list of contributing sources (see below), and the
364 payload data. Some underlying protocols may require an
365 encapsulation of the RTP packet to be defined. Typically one
366 packet of the underlying protocol contains a single RTP packet,
367 but several RTP packets may be contained if permitted by the
368 encapsulation method (see <a href="#section-10">Section 10</a>).
369
370 RTCP packet: A control packet consisting of a fixed header part
371 similar to that of RTP data packets, followed by structured
372 elements that vary depending upon the RTCP packet type. The
373 formats are defined in <a href="#section-6">Section 6</a>. Typically, multiple RTCP
374 packets are sent together as a compound RTCP packet in a single
375 packet of the underlying protocol; this is enabled by the length
376 field in the fixed header of each RTCP packet.
377
378 Port: The "abstraction that transport protocols use to distinguish
379 among multiple destinations within a given host computer. TCP/IP
380 protocols identify ports using small positive integers." [<a href="#ref-3" title="Internetworking with TCP/IP">3</a>] The
381 transport selectors (TSEL) used by the OSI transport layer are
382 equivalent to ports. RTP depends upon the lower-layer protocol
383 to provide some mechanism such as ports to multiplex the RTP and
384 RTCP packets of a session.
385
386
387
388 <span class="grey">Schulzrinne, et al Standards Track [Page 7]</span></pre>
389 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
390 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
391
392
393 Transport address: The combination of a network address and port that
394 identifies a transport-level endpoint, for example an IP address
395 and a UDP port. Packets are transmitted from a source transport
396 address to a destination transport address.
397
398 RTP session: The association among a set of participants
399 communicating with RTP. For each participant, the session is
400 defined by a particular pair of destination transport addresses
401 (one network address plus a port pair for RTP and RTCP). The
402 destination transport address pair may be common for all
403 participants, as in the case of IP multicast, or may be
404 different for each, as in the case of individual unicast network
405 addresses plus a common port pair. In a multimedia session,
406 each medium is carried in a separate RTP session with its own
407 RTCP packets. The multiple RTP sessions are distinguished by
408 different port number pairs and/or different multicast
409 addresses.
410
411 Synchronization source (SSRC): The source of a stream of RTP packets,
412 identified by a 32-bit numeric SSRC identifier carried in the
413 RTP header so as not to be dependent upon the network address.
414 All packets from a synchronization source form part of the same
415 timing and sequence number space, so a receiver groups packets
416 by synchronization source for playback. Examples of
417 synchronization sources include the sender of a stream of
418 packets derived from a signal source such as a microphone or a
419 camera, or an RTP mixer (see below). A synchronization source
420 may change its data format, e.g., audio encoding, over time. The
421 SSRC identifier is a randomly chosen value meant to be globally
422 unique within a particular RTP session (see <a href="#section-8">Section 8</a>). A
423 participant need not use the same SSRC identifier for all the
424 RTP sessions in a multimedia session; the binding of the SSRC
425 identifiers is provided through RTCP (see <a href="#section-6.4.1">Section 6.4.1</a>). If a
426 participant generates multiple streams in one RTP session, for
427 example from separate video cameras, each must be identified as
428 a different SSRC.
429
430 Contributing source (CSRC): A source of a stream of RTP packets that
431 has contributed to the combined stream produced by an RTP mixer
432 (see below). The mixer inserts a list of the SSRC identifiers of
433 the sources that contributed to the generation of a particular
434 packet into the RTP header of that packet. This list is called
435 the CSRC list. An example application is audio conferencing
436 where a mixer indicates all the talkers whose speech was
437 combined to produce the outgoing packet, allowing the receiver
438 to indicate the current talker, even though all the audio
439 packets contain the same SSRC identifier (that of the mixer).
440
441
442
443
444 <span class="grey">Schulzrinne, et al Standards Track [Page 8]</span></pre>
445 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
446 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
447
448
449 End system: An application that generates the content to be sent in
450 RTP packets and/or consumes the content of received RTP packets.
451 An end system can act as one or more synchronization sources in
452 a particular RTP session, but typically only one.
453
454 Mixer: An intermediate system that receives RTP packets from one or
455 more sources, possibly changes the data format, combines the
456 packets in some manner and then forwards a new RTP packet. Since
457 the timing among multiple input sources will not generally be
458 synchronized, the mixer will make timing adjustments among the
459 streams and generate its own timing for the combined stream.
460 Thus, all data packets originating from a mixer will be
461 identified as having the mixer as their synchronization source.
462
463 Translator: An intermediate system that forwards RTP packets with
464 their synchronization source identifier intact. Examples of
465 translators include devices that convert encodings without
466 mixing, replicators from multicast to unicast, and application-
467 level filters in firewalls.
468
469 Monitor: An application that receives RTCP packets sent by
470 participants in an RTP session, in particular the reception
471 reports, and estimates the current quality of service for
472 distribution monitoring, fault diagnosis and long-term
473 statistics. The monitor function is likely to be built into the
474 application(s) participating in the session, but may also be a
475 separate application that does not otherwise participate and
476 does not send or receive the RTP data packets. These are called
477 third party monitors.
478
479 Non-RTP means: Protocols and mechanisms that may be needed in
480 addition to RTP to provide a usable service. In particular, for
481 multimedia conferences, a conference control application may
482 distribute multicast addresses and keys for encryption,
483 negotiate the encryption algorithm to be used, and define
484 dynamic mappings between RTP payload type values and the payload
485 formats they represent for formats that do not have a predefined
486 payload type value. For simple applications, electronic mail or
487 a conference database may also be used. The specification of
488 such protocols and mechanisms is outside the scope of this
489 document.
490
491 <span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Byte Order, Alignment, and Time Format</span>
492
493 All integer fields are carried in network byte order, that is, most
494 significant byte (octet) first. This byte order is commonly known as
495 big-endian. The transmission order is described in detail in [<a href="#ref-4" title="&quot;Internet Protocol&quot;">4</a>].
496 Unless otherwise noted, numeric constants are in decimal (base 10).
497
498
499
500 <span class="grey">Schulzrinne, et al Standards Track [Page 9]</span></pre>
501 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
502 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
503
504
505 All header data is aligned to its natural length, i.e., 16-bit fields
506 are aligned on even offsets, 32-bit fields are aligned at offsets
507 divisible by four, etc. Octets designated as padding have the value
508 zero.
509
510 Wallclock time (absolute time) is represented using the timestamp
511 format of the Network Time Protocol (NTP), which is in seconds
512 relative to 0h UTC on 1 January 1900 [<a href="#ref-5" title="&quot;Network Time Protocol Version 3&quot;">5</a>]. The full resolution NTP
513 timestamp is a 64-bit unsigned fixed-point number with the integer
514 part in the first 32 bits and the fractional part in the last 32
515 bits. In some fields where a more compact representation is
516 appropriate, only the middle 32 bits are used; that is, the low 16
517 bits of the integer part and the high 16 bits of the fractional part.
518 The high 16 bits of the integer part must be determined
519 independently.
520
521 <span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. RTP Data Transfer Protocol</span>
522
523 <span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a> RTP Fixed Header Fields</span>
524
525 The RTP header has the following format:
526
527 0 1 2 3
528 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
529 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
530 |V=2|P|X| CC |M| PT | sequence number |
531 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
532 | timestamp |
533 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
534 | synchronization source (SSRC) identifier |
535 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
536 | contributing source (CSRC) identifiers |
537 | .... |
538 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
539
540 The first twelve octets are present in every RTP packet, while the
541 list of CSRC identifiers is present only when inserted by a mixer.
542 The fields have the following meaning:
543
544 version (V): 2 bits
545 This field identifies the version of RTP. The version defined by
546 this specification is two (2). (The value 1 is used by the first
547 draft version of RTP and the value 0 is used by the protocol
548 initially implemented in the "vat" audio tool.)
549
550 padding (P): 1 bit
551 If the padding bit is set, the packet contains one or more
552 additional padding octets at the end which are not part of the
553
554
555
556 <span class="grey">Schulzrinne, et al Standards Track [Page 10]</span></pre>
557 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span>
558 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
559
560
561 payload. The last octet of the padding contains a count of how
562 many padding octets should be ignored. Padding may be needed by
563 some encryption algorithms with fixed block sizes or for
564 carrying several RTP packets in a lower-layer protocol data
565 unit.
566
567 extension (X): 1 bit
568 If the extension bit is set, the fixed header is followed by
569 exactly one header extension, with a format defined in <a href="#section-5.3.1">Section</a>
570 <a href="#section-5.3.1">5.3.1</a>.
571
572 CSRC count (CC): 4 bits
573 The CSRC count contains the number of CSRC identifiers that
574 follow the fixed header.
575
576 marker (M): 1 bit
577 The interpretation of the marker is defined by a profile. It is
578 intended to allow significant events such as frame boundaries to
579 be marked in the packet stream. A profile may define additional
580 marker bits or specify that there is no marker bit by changing
581 the number of bits in the payload type field (see <a href="#section-5.3">Section 5.3</a>).
582
583 payload type (PT): 7 bits
584 This field identifies the format of the RTP payload and
585 determines its interpretation by the application. A profile
586 specifies a default static mapping of payload type codes to
587 payload formats. Additional payload type codes may be defined
588 dynamically through non-RTP means (see <a href="#section-3">Section 3</a>). An initial
589 set of default mappings for audio and video is specified in the
590 companion profile Internet-Draft <a href="./draft-ietf-avt-profile">draft-ietf-avt-profile</a>, and
591 may be extended in future editions of the Assigned Numbers RFC
592 [<a href="#ref-6" title="&quot;Assigned Numbers&quot;">6</a>]. An RTP sender emits a single RTP payload type at any given
593 time; this field is not intended for multiplexing separate media
594 streams (see <a href="#section-5.2">Section 5.2</a>).
595
596 sequence number: 16 bits
597 The sequence number increments by one for each RTP data packet
598 sent, and may be used by the receiver to detect packet loss and
599 to restore packet sequence. The initial value of the sequence
600 number is random (unpredictable) to make known-plaintext attacks
601 on encryption more difficult, even if the source itself does not
602 encrypt, because the packets may flow through a translator that
603 does. Techniques for choosing unpredictable numbers are
604 discussed in [<a href="#ref-7" title="&quot;Randomness Recommendations for Security&quot;">7</a>].
605
606 timestamp: 32 bits
607 The timestamp reflects the sampling instant of the first octet
608 in the RTP data packet. The sampling instant must be derived
609
610
611
612 <span class="grey">Schulzrinne, et al Standards Track [Page 11]</span></pre>
613 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span>
614 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
615
616
617 from a clock that increments monotonically and linearly in time
618 to allow synchronization and jitter calculations (see <a href="#section-6.3.1">Section</a>
619 <a href="#section-6.3.1">6.3.1</a>). The resolution of the clock must be sufficient for the
620 desired synchronization accuracy and for measuring packet
621 arrival jitter (one tick per video frame is typically not
622 sufficient). The clock frequency is dependent on the format of
623 data carried as payload and is specified statically in the
624 profile or payload format specification that defines the format,
625 or may be specified dynamically for payload formats defined
626 through non-RTP means. If RTP packets are generated
627 periodically, the nominal sampling instant as determined from
628 the sampling clock is to be used, not a reading of the system
629 clock. As an example, for fixed-rate audio the timestamp clock
630 would likely increment by one for each sampling period. If an
631 audio application reads blocks covering 160 sampling periods
632 from the input device, the timestamp would be increased by 160
633 for each such block, regardless of whether the block is
634 transmitted in a packet or dropped as silent.
635
636 The initial value of the timestamp is random, as for the sequence
637 number. Several consecutive RTP packets may have equal timestamps if
638 they are (logically) generated at once, e.g., belong to the same
639 video frame. Consecutive RTP packets may contain timestamps that are
640 not monotonic if the data is not transmitted in the order it was
641 sampled, as in the case of MPEG interpolated video frames. (The
642 sequence numbers of the packets as transmitted will still be
643 monotonic.)
644
645 SSRC: 32 bits
646 The SSRC field identifies the synchronization source. This
647 identifier is chosen randomly, with the intent that no two
648 synchronization sources within the same RTP session will have
649 the same SSRC identifier. An example algorithm for generating a
650 random identifier is presented in <a href="#appendix-A.6">Appendix A.6</a>. Although the
651 probability of multiple sources choosing the same identifier is
652 low, all RTP implementations must be prepared to detect and
653 resolve collisions. <a href="#section-8">Section 8</a> describes the probability of
654 collision along with a mechanism for resolving collisions and
655 detecting RTP-level forwarding loops based on the uniqueness of
656 the SSRC identifier. If a source changes its source transport
657 address, it must also choose a new SSRC identifier to avoid
658 being interpreted as a looped source.
659
660 CSRC list: 0 to 15 items, 32 bits each
661 The CSRC list identifies the contributing sources for the
662 payload contained in this packet. The number of identifiers is
663 given by the CC field. If there are more than 15 contributing
664 sources, only 15 may be identified. CSRC identifiers are
665
666
667
668 <span class="grey">Schulzrinne, et al Standards Track [Page 12]</span></pre>
669 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span>
670 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
671
672
673 inserted by mixers, using the SSRC identifiers of contributing
674 sources. For example, for audio packets the SSRC identifiers of
675 all sources that were mixed together to create a packet are
676 listed, allowing correct talker indication at the receiver.
677
678 <span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a> Multiplexing RTP Sessions</span>
679
680 For efficient protocol processing, the number of multiplexing points
681 should be minimized, as described in the integrated layer processing
682 design principle [<a href="#ref-1" title="&quot;Architectural considerations for a new generation of protocols,&quot;">1</a>]. In RTP, multiplexing is provided by the
683 destination transport address (network address and port number) which
684 define an RTP session. For example, in a teleconference composed of
685 audio and video media encoded separately, each medium should be
686 carried in a separate RTP session with its own destination transport
687 address. It is not intended that the audio and video be carried in a
688 single RTP session and demultiplexed based on the payload type or
689 SSRC fields. Interleaving packets with different payload types but
690 using the same SSRC would introduce several problems:
691
692 1. If one payload type were switched during a session, there
693 would be no general means to identify which of the old
694 values the new one replaced.
695
696 2. An SSRC is defined to identify a single timing and sequence
697 number space. Interleaving multiple payload types would
698 require different timing spaces if the media clock rates
699 differ and would require different sequence number spaces
700 to tell which payload type suffered packet loss.
701
702 3. The RTCP sender and receiver reports (see <a href="#section-6.3">Section 6.3</a>) can
703 only describe one timing and sequence number space per SSRC
704 and do not carry a payload type field.
705
706 4. An RTP mixer would not be able to combine interleaved
707 streams of incompatible media into one stream.
708
709 5. Carrying multiple media in one RTP session precludes: the
710 use of different network paths or network resource
711 allocations if appropriate; reception of a subset of the
712 media if desired, for example just audio if video would
713 exceed the available bandwidth; and receiver
714 implementations that use separate processes for the
715 different media, whereas using separate RTP sessions
716 permits either single- or multiple-process implementations.
717
718 Using a different SSRC for each medium but sending them in the same
719 RTP session would avoid the first three problems but not the last
720 two.
721
722
723
724 <span class="grey">Schulzrinne, et al Standards Track [Page 13]</span></pre>
725 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span>
726 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
727
728
729 <span class="h3"><a class="selflink" id="section-5.3" href="#section-5.3">5.3</a> Profile-Specific Modifications to the RTP Header</span>
730
731 The existing RTP data packet header is believed to be complete for
732 the set of functions required in common across all the application
733 classes that RTP might support. However, in keeping with the ALF
734 design principle, the header may be tailored through modifications or
735 additions defined in a profile specification while still allowing
736 profile-independent monitoring and recording tools to function.
737
738 o The marker bit and payload type field carry profile-specific
739 information, but they are allocated in the fixed header since
740 many applications are expected to need them and might otherwise
741 have to add another 32-bit word just to hold them. The octet
742 containing these fields may be redefined by a profile to suit
743 different requirements, for example with a more or fewer marker
744 bits. If there are any marker bits, one should be located in
745 the most significant bit of the octet since profile-independent
746 monitors may be able to observe a correlation between packet
747 loss patterns and the marker bit.
748
749 o Additional information that is required for a particular
750 payload format, such as a video encoding, should be carried in
751 the payload section of the packet. This might be in a header
752 that is always present at the start of the payload section, or
753 might be indicated by a reserved value in the data pattern.
754
755 o If a particular class of applications needs additional
756 functionality independent of payload format, the profile under
757 which those applications operate should define additional fixed
758 fields to follow immediately after the SSRC field of the
759 existing fixed header. Those applications will be able to
760 quickly and directly access the additional fields while
761 profile-independent monitors or recorders can still process the
762 RTP packets by interpreting only the first twelve octets.
763
764 If it turns out that additional functionality is needed in common
765 across all profiles, then a new version of RTP should be defined to
766 make a permanent change to the fixed header.
767
768 <span class="h4"><a class="selflink" id="section-5.3.1" href="#section-5.3.1">5.3.1</a> RTP Header Extension</span>
769
770 An extension mechanism is provided to allow individual
771 implementations to experiment with new payload-format-independent
772 functions that require additional information to be carried in the
773 RTP data packet header. This mechanism is designed so that the header
774 extension may be ignored by other interoperating implementations that
775 have not been extended.
776
777
778
779
780 <span class="grey">Schulzrinne, et al Standards Track [Page 14]</span></pre>
781 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span>
782 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
783
784
785 Note that this header extension is intended only for limited use.
786 Most potential uses of this mechanism would be better done another
787 way, using the methods described in the previous section. For
788 example, a profile-specific extension to the fixed header is less
789 expensive to process because it is not conditional nor in a variable
790 location. Additional information required for a particular payload
791 format should not use this header extension, but should be carried in
792 the payload section of the packet.
793
794 0 1 2 3
795 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
796 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
797 | defined by profile | length |
798 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
799 | header extension |
800 | .... |
801
802
803 If the X bit in the RTP header is one, a variable-length header
804 extension is appended to the RTP header, following the CSRC list if
805 present. The header extension contains a 16-bit length field that
806 counts the number of 32-bit words in the extension, excluding the
807 four-octet extension header (therefore zero is a valid length). Only
808 a single extension may be appended to the RTP data header. To allow
809 multiple interoperating implementations to each experiment
810 independently with different header extensions, or to allow a
811 particular implementation to experiment with more than one type of
812 header extension, the first 16 bits of the header extension are left
813 open for distinguishing identifiers or parameters. The format of
814 these 16 bits is to be defined by the profile specification under
815 which the implementations are operating. This RTP specification does
816 not define any header extensions itself.
817
818 <span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. RTP Control Protocol -- RTCP</span>
819
820 The RTP control protocol (RTCP) is based on the periodic transmission
821 of control packets to all participants in the session, using the same
822 distribution mechanism as the data packets. The underlying protocol
823 must provide multiplexing of the data and control packets, for
824 example using separate port numbers with UDP. RTCP performs four
825 functions:
826
827 1. The primary function is to provide feedback on the quality
828 of the data distribution. This is an integral part of the
829 RTP's role as a transport protocol and is related to the
830 flow and congestion control functions of other transport
831 protocols. The feedback may be directly useful for control
832 of adaptive encodings [<a href="#ref-8" title="&quot;Scalable feedback control for multicast video distribution in the internet,&quot;">8</a>,<a href="#ref-9" title="&quot;Dynamic QoS control of multimedia applications based on RTP,&quot;">9</a>], but experiments with IP
833
834
835
836 <span class="grey">Schulzrinne, et al Standards Track [Page 15]</span></pre>
837 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span>
838 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
839
840
841 multicasting have shown that it is also critical to get
842 feedback from the receivers to diagnose faults in the
843 distribution. Sending reception feedback reports to all
844 participants allows one who is observing problems to
845 evaluate whether those problems are local or global. With a
846 distribution mechanism like IP multicast, it is also
847 possible for an entity such as a network service provider
848 who is not otherwise involved in the session to receive the
849 feedback information and act as a third-party monitor to
850 diagnose network problems. This feedback function is
851 performed by the RTCP sender and receiver reports,
852 described below in <a href="#section-6.3">Section 6.3</a>.
853
854 2. RTCP carries a persistent transport-level identifier for an
855 RTP source called the canonical name or CNAME, <a href="#section-6.4.1">Section</a>
856 <a href="#section-6.4.1">6.4.1</a>. Since the SSRC identifier may change if a conflict
857 is discovered or a program is restarted, receivers require
858 the CNAME to keep track of each participant. Receivers also
859 require the CNAME to associate multiple data streams from a
860 given participant in a set of related RTP sessions, for
861 example to synchronize audio and video.
862
863 3. The first two functions require that all participants send
864 RTCP packets, therefore the rate must be controlled in
865 order for RTP to scale up to a large number of
866 participants. By having each participant send its control
867 packets to all the others, each can independently observe
868 the number of participants. This number is used to
869 calculate the rate at which the packets are sent, as
870 explained in <a href="#section-6.2">Section 6.2</a>.
871
872 4. A fourth, optional function is to convey minimal session
873 control information, for example participant identification
874 to be displayed in the user interface. This is most likely
875 to be useful in "loosely controlled" sessions where
876 participants enter and leave without membership control or
877 parameter negotiation. RTCP serves as a convenient channel
878 to reach all the participants, but it is not necessarily
879 expected to support all the control communication
880 requirements of an application. A higher-level session
881 control protocol, which is beyond the scope of this
882 document, may be needed.
883
884 Functions 1-3 are mandatory when RTP is used in the IP multicast
885 environment, and are recommended for all environments. RTP
886 application designers are advised to avoid mechanisms that can only
887 work in unicast mode and will not scale to larger numbers.
888
889
890
891
892 <span class="grey">Schulzrinne, et al Standards Track [Page 16]</span></pre>
893 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span>
894 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
895
896
897 <span class="h3"><a class="selflink" id="section-6.1" href="#section-6.1">6.1</a> RTCP Packet Format</span>
898
899 This specification defines several RTCP packet types to carry a
900 variety of control information:
901
902 SR: Sender report, for transmission and reception statistics from
903 participants that are active senders
904
905 RR: Receiver report, for reception statistics from participants that
906 are not active senders
907
908 SDES: Source description items, including CNAME
909
910 BYE: Indicates end of participation
911
912 APP: Application specific functions
913
914 Each RTCP packet begins with a fixed part similar to that of RTP data
915 packets, followed by structured elements that may be of variable
916 length according to the packet type but always end on a 32-bit
917 boundary. The alignment requirement and a length field in the fixed
918 part are included to make RTCP packets "stackable". Multiple RTCP
919 packets may be concatenated without any intervening separators to
920 form a compound RTCP packet that is sent in a single packet of the
921 lower layer protocol, for example UDP. There is no explicit count of
922 individual RTCP packets in the compound packet since the lower layer
923 protocols are expected to provide an overall length to determine the
924 end of the compound packet.
925
926 Each individual RTCP packet in the compound packet may be processed
927 independently with no requirements upon the order or combination of
928 packets. However, in order to perform the functions of the protocol,
929 the following constraints are imposed:
930
931 o Reception statistics (in SR or RR) should be sent as often as
932 bandwidth constraints will allow to maximize the resolution of
933 the statistics, therefore each periodically transmitted
934 compound RTCP packet should include a report packet.
935
936 o New receivers need to receive the CNAME for a source as soon
937 as possible to identify the source and to begin associating
938 media for purposes such as lip-sync, so each compound RTCP
939 packet should also include the SDES CNAME.
940
941 o The number of packet types that may appear first in the
942 compound packet should be limited to increase the number of
943 constant bits in the first word and the probability of
944 successfully validating RTCP packets against misaddressed RTP
945
946
947
948 <span class="grey">Schulzrinne, et al Standards Track [Page 17]</span></pre>
949 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span>
950 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
951
952
953 data packets or other unrelated packets.
954
955 Thus, all RTCP packets must be sent in a compound packet of at least
956 two individual packets, with the following format recommended:
957
958 Encryption prefix: If and only if the compound packet is to be
959 encrypted, it is prefixed by a random 32-bit quantity redrawn
960 for every compound packet transmitted.
961
962 SR or RR: The first RTCP packet in the compound packet must always
963 be a report packet to facilitate header validation as described
964 in <a href="#appendix-A.2">Appendix A.2</a>. This is true even if no data has been sent nor
965 received, in which case an empty RR is sent, and even if the
966 only other RTCP packet in the compound packet is a BYE.
967
968 Additional RRs: If the number of sources for which reception
969 statistics are being reported exceeds 31, the number that will
970 fit into one SR or RR packet, then additional RR packets should
971 follow the initial report packet.
972
973 SDES: An SDES packet containing a CNAME item must be included in
974 each compound RTCP packet. Other source description items may
975 optionally be included if required by a particular application,
976 subject to bandwidth constraints (see <a href="#section-6.2.2">Section 6.2.2</a>).
977
978 BYE or APP: Other RTCP packet types, including those yet to be
979 defined, may follow in any order, except that BYE should be the
980 last packet sent with a given SSRC/CSRC. Packet types may appear
981 more than once.
982
983 It is advisable for translators and mixers to combine individual RTCP
984 packets from the multiple sources they are forwarding into one
985 compound packet whenever feasible in order to amortize the packet
986 overhead (see <a href="#section-7">Section 7</a>). An example RTCP compound packet as might be
987 produced by a mixer is shown in Fig. 1. If the overall length of a
988 compound packet would exceed the maximum transmission unit (MTU) of
989 the network path, it may be segmented into multiple shorter compound
990 packets to be transmitted in separate packets of the underlying
991 protocol. Note that each of the compound packets must begin with an
992 SR or RR packet.
993
994 An implementation may ignore incoming RTCP packets with types unknown
995 to it. Additional RTCP packet types may be registered with the
996 Internet Assigned Numbers Authority (IANA).
997
998
999
1000
1001
1002
1003
1004 <span class="grey">Schulzrinne, et al Standards Track [Page 18]</span></pre>
1005 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span>
1006 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1007
1008
1009 <span class="h3"><a class="selflink" id="section-6.2" href="#section-6.2">6.2</a> RTCP Transmission Interval</span>
1010
1011 if encrypted: random 32-bit integer
1012 |
1013 |[------- packet -------][----------- packet -----------][-packet-]
1014 |
1015 | receiver reports chunk chunk
1016 V item item item item
1017 --------------------------------------------------------------------
1018 |R[SR|# sender #site#site][SDES|# CNAME PHONE |#CNAME LOC][BYE##why]
1019 |R[ |# report # 1 # 2 ][ |# |# ][ ## ]
1020 |R[ |# # # ][ |# |# ][ ## ]
1021 |R[ |# # # ][ |# |# ][ ## ]
1022 --------------------------------------------------------------------
1023 |&lt;------------------ UDP packet (compound packet) ---------------&gt;|
1024
1025 #: SSRC/CSRC
1026
1027 Figure 1: Example of an RTCP compound packet
1028
1029 RTP is designed to allow an application to scale automatically over
1030 session sizes ranging from a few participants to thousands. For
1031 example, in an audio conference the data traffic is inherently self-
1032 limiting because only one or two people will speak at a time, so with
1033 multicast distribution the data rate on any given link remains
1034 relatively constant independent of the number of participants.
1035 However, the control traffic is not self-limiting. If the reception
1036 reports from each participant were sent at a constant rate, the
1037 control traffic would grow linearly with the number of participants.
1038 Therefore, the rate must be scaled down.
1039
1040 For each session, it is assumed that the data traffic is subject to
1041 an aggregate limit called the "session bandwidth" to be divided among
1042 the participants. This bandwidth might be reserved and the limit
1043 enforced by the network, or it might just be a reasonable share. The
1044 session bandwidth may be chosen based or some cost or a priori
1045 knowledge of the available network bandwidth for the session. It is
1046 somewhat independent of the media encoding, but the encoding choice
1047 may be limited by the session bandwidth. The session bandwidth
1048 parameter is expected to be supplied by a session management
1049 application when it invokes a media application, but media
1050 applications may also set a default based on the single-sender data
1051 bandwidth for the encoding selected for the session. The application
1052 may also enforce bandwidth limits based on multicast scope rules or
1053 other criteria.
1054
1055
1056
1057
1058
1059
1060 <span class="grey">Schulzrinne, et al Standards Track [Page 19]</span></pre>
1061 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span>
1062 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1063
1064
1065 Bandwidth calculations for control and data traffic include lower-
1066 layer transport and network protocols (e.g., UDP and IP) since that
1067 is what the resource reservation system would need to know. The
1068 application can also be expected to know which of these protocols are
1069 in use. Link level headers are not included in the calculation since
1070 the packet will be encapsulated with different link level headers as
1071 it travels.
1072
1073 The control traffic should be limited to a small and known fraction
1074 of the session bandwidth: small so that the primary function of the
1075 transport protocol to carry data is not impaired; known so that the
1076 control traffic can be included in the bandwidth specification given
1077 to a resource reservation protocol, and so that each participant can
1078 independently calculate its share. It is suggested that the fraction
1079 of the session bandwidth allocated to RTCP be fixed at 5%. While the
1080 value of this and other constants in the interval calculation is not
1081 critical, all participants in the session must use the same values so
1082 the same interval will be calculated. Therefore, these constants
1083 should be fixed for a particular profile.
1084
1085 The algorithm described in <a href="#appendix-A.7">Appendix A.7</a> was designed to meet the
1086 goals outlined above. It calculates the interval between sending
1087 compound RTCP packets to divide the allowed control traffic bandwidth
1088 among the participants. This allows an application to provide fast
1089 response for small sessions where, for example, identification of all
1090 participants is important, yet automatically adapt to large sessions.
1091 The algorithm incorporates the following characteristics:
1092
1093 o Senders are collectively allocated at least 1/4 of the control
1094 traffic bandwidth so that in sessions with a large number of
1095 receivers but a small number of senders, newly joining
1096 participants will more quickly receive the CNAME for the
1097 sending sites.
1098
1099 o The calculated interval between RTCP packets is required to be
1100 greater than a minimum of 5 seconds to avoid having bursts of
1101 RTCP packets exceed the allowed bandwidth when the number of
1102 participants is small and the traffic isn't smoothed according
1103 to the law of large numbers.
1104
1105 o The interval between RTCP packets is varied randomly over the
1106 range [0.5,1.5] times the calculated interval to avoid
1107 unintended synchronization of all participants [<a href="#ref-10" title="&quot;The synchronization of periodic routing messages,&quot;">10</a>]. The first
1108 RTCP packet sent after joining a session is also delayed by a
1109 random variation of half the minimum RTCP interval in case the
1110 application is started at multiple sites simultaneously, for
1111 example as initiated by a session announcement.
1112
1113
1114
1115
1116 <span class="grey">Schulzrinne, et al Standards Track [Page 20]</span></pre>
1117 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span>
1118 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1119
1120
1121 o A dynamic estimate of the average compound RTCP packet size is
1122 calculated, including all those received and sent, to
1123 automatically adapt to changes in the amount of control
1124 information carried.
1125
1126 This algorithm may be used for sessions in which all participants are
1127 allowed to send. In that case, the session bandwidth parameter is the
1128 product of the individual sender's bandwidth times the number of
1129 participants, and the RTCP bandwidth is 5% of that.
1130
1131 <span class="h4"><a class="selflink" id="section-6.2.1" href="#section-6.2.1">6.2.1</a> Maintaining the number of session members</span>
1132
1133 Calculation of the RTCP packet interval depends upon an estimate of
1134 the number of sites participating in the session. New sites are added
1135 to the count when they are heard, and an entry for each is created in
1136 a table indexed by the SSRC or CSRC identifier (see <a href="#section-8.2">Section 8.2</a>) to
1137 keep track of them. New entries may not be considered valid until
1138 multiple packets carrying the new SSRC have been received (see
1139 <a href="#appendix-A.1">Appendix A.1</a>). Entries may be deleted from the table when an RTCP BYE
1140 packet with the corresponding SSRC identifier is received.
1141
1142 A participant may mark another site inactive, or delete it if not yet
1143 valid, if no RTP or RTCP packet has been received for a small number
1144 of RTCP report intervals (5 is suggested). This provides some
1145 robustness against packet loss. All sites must calculate roughly the
1146 same value for the RTCP report interval in order for this timeout to
1147 work properly.
1148
1149 Once a site has been validated, then if it is later marked inactive
1150 the state for that site should still be retained and the site should
1151 continue to be counted in the total number of sites sharing RTCP
1152 bandwidth for a period long enough to span typical network
1153 partitions. This is to avoid excessive traffic, when the partition
1154 heals, due to an RTCP report interval that is too small. A timeout of
1155 30 minutes is suggested. Note that this is still larger than 5 times
1156 the largest value to which the RTCP report interval is expected to
1157 usefully scale, about 2 to 5 minutes.
1158
1159 <span class="h4"><a class="selflink" id="section-6.2.2" href="#section-6.2.2">6.2.2</a> Allocation of source description bandwidth</span>
1160
1161 This specification defines several source description (SDES) items in
1162 addition to the mandatory CNAME item, such as NAME (personal name)
1163 and EMAIL (email address). It also provides a means to define new
1164 application-specific RTCP packet types. Applications should exercise
1165 caution in allocating control bandwidth to this additional
1166 information because it will slow down the rate at which reception
1167 reports and CNAME are sent, thus impairing the performance of the
1168 protocol. It is recommended that no more than 20% of the RTCP
1169
1170
1171
1172 <span class="grey">Schulzrinne, et al Standards Track [Page 21]</span></pre>
1173 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span>
1174 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1175
1176
1177 bandwidth allocated to a single participant be used to carry the
1178 additional information. Furthermore, it is not intended that all
1179 SDES items should be included in every application. Those that are
1180 included should be assigned a fraction of the bandwidth according to
1181 their utility. Rather than estimate these fractions dynamically, it
1182 is recommended that the percentages be translated statically into
1183 report interval counts based on the typical length of an item.
1184
1185 For example, an application may be designed to send only CNAME, NAME
1186 and EMAIL and not any others. NAME might be given much higher
1187 priority than EMAIL because the NAME would be displayed continuously
1188 in the application's user interface, whereas EMAIL would be displayed
1189 only when requested. At every RTCP interval, an RR packet and an SDES
1190 packet with the CNAME item would be sent. For a small session
1191 operating at the minimum interval, that would be every 5 seconds on
1192 the average. Every third interval (15 seconds), one extra item would
1193 be included in the SDES packet. Seven out of eight times this would
1194 be the NAME item, and every eighth time (2 minutes) it would be the
1195 EMAIL item.
1196
1197 When multiple applications operate in concert using cross-application
1198 binding through a common CNAME for each participant, for example in a
1199 multimedia conference composed of an RTP session for each medium, the
1200 additional SDES information might be sent in only one RTP session.
1201 The other sessions would carry only the CNAME item.
1202
1203 <span class="h3"><a class="selflink" id="section-6.3" href="#section-6.3">6.3</a> Sender and Receiver Reports</span>
1204
1205 RTP receivers provide reception quality feedback using RTCP report
1206 packets which may take one of two forms depending upon whether or not
1207 the receiver is also a sender. The only difference between the sender
1208 report (SR) and receiver report (RR) forms, besides the packet type
1209 code, is that the sender report includes a 20-byte sender information
1210 section for use by active senders. The SR is issued if a site has
1211 sent any data packets during the interval since issuing the last
1212 report or the previous one, otherwise the RR is issued.
1213
1214 Both the SR and RR forms include zero or more reception report
1215 blocks, one for each of the synchronization sources from which this
1216 receiver has received RTP data packets since the last report. Reports
1217 are not issued for contributing sources listed in the CSRC list. Each
1218 reception report block provides statistics about the data received
1219 from the particular source indicated in that block. Since a maximum
1220 of 31 reception report blocks will fit in an SR or RR packet,
1221 additional RR packets may be stacked after the initial SR or RR
1222 packet as needed to contain the reception reports for all sources
1223 heard during the interval since the last report.
1224
1225
1226
1227
1228 <span class="grey">Schulzrinne, et al Standards Track [Page 22]</span></pre>
1229 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span>
1230 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1231
1232
1233 The next sections define the formats of the two reports, how they may
1234 be extended in a profile-specific manner if an application requires
1235 additional feedback information, and how the reports may be used.
1236 Details of reception reporting by translators and mixers is given in
1237 <a href="#section-7">Section 7</a>.
1238
1239 <span class="h4"><a class="selflink" id="section-6.3.1" href="#section-6.3.1">6.3.1</a> SR: Sender report RTCP packet</span>
1240
1241 0 1 2 3
1242 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1243 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1244 |V=2|P| RC | PT=SR=200 | length | header
1245 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1246 | SSRC of sender |
1247 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1248 | NTP timestamp, most significant word | sender
1249 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ info
1250 | NTP timestamp, least significant word |
1251 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1252 | RTP timestamp |
1253 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1254 | sender's packet count |
1255 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1256 | sender's octet count |
1257 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1258 | SSRC_1 (SSRC of first source) | report
1259 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ block
1260 | fraction lost | cumulative number of packets lost | 1
1261 -+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1262 | extended highest sequence number received |
1263 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1264 | interarrival jitter |
1265 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1266 | last SR (LSR) |
1267 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1268 | delay since last SR (DLSR) |
1269 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1270 | SSRC_2 (SSRC of second source) | report
1271 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ block
1272 : ... : 2
1273 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1274 | profile-specific extensions |
1275 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1276
1277 The sender report packet consists of three sections, possibly
1278 followed by a fourth profile-specific extension section if defined.
1279 The first section, the header, is 8 octets long. The fields have the
1280 following meaning:
1281
1282
1283
1284 <span class="grey">Schulzrinne, et al Standards Track [Page 23]</span></pre>
1285 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-24" ></span>
1286 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1287
1288
1289 version (V): 2 bits
1290 Identifies the version of RTP, which is the same in RTCP packets
1291 as in RTP data packets. The version defined by this
1292 specification is two (2).
1293
1294 padding (P): 1 bit
1295 If the padding bit is set, this RTCP packet contains some
1296 additional padding octets at the end which are not part of the
1297 control information. The last octet of the padding is a count of
1298 how many padding octets should be ignored. Padding may be needed
1299 by some encryption algorithms with fixed block sizes. In a
1300 compound RTCP packet, padding should only be required on the
1301 last individual packet because the compound packet is encrypted
1302 as a whole.
1303
1304 reception report count (RC): 5 bits
1305 The number of reception report blocks contained in this packet.
1306 A value of zero is valid.
1307
1308 packet type (PT): 8 bits
1309 Contains the constant 200 to identify this as an RTCP SR packet.
1310
1311 length: 16 bits
1312 The length of this RTCP packet in 32-bit words minus one,
1313 including the header and any padding. (The offset of one makes
1314 zero a valid length and avoids a possible infinite loop in
1315 scanning a compound RTCP packet, while counting 32-bit words
1316 avoids a validity check for a multiple of 4.)
1317
1318 SSRC: 32 bits
1319 The synchronization source identifier for the originator of this
1320 SR packet.
1321
1322 The second section, the sender information, is 20 octets long and is
1323 present in every sender report packet. It summarizes the data
1324 transmissions from this sender. The fields have the following
1325 meaning:
1326
1327 NTP timestamp: 64 bits
1328 Indicates the wallclock time when this report was sent so that
1329 it may be used in combination with timestamps returned in
1330 reception reports from other receivers to measure round-trip
1331 propagation to those receivers. Receivers should expect that the
1332 measurement accuracy of the timestamp may be limited to far less
1333 than the resolution of the NTP timestamp. The measurement
1334 uncertainty of the timestamp is not indicated as it may not be
1335 known. A sender that can keep track of elapsed time but has no
1336 notion of wallclock time may use the elapsed time since joining
1337
1338
1339
1340 <span class="grey">Schulzrinne, et al Standards Track [Page 24]</span></pre>
1341 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-25" ></span>
1342 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1343
1344
1345 the session instead. This is assumed to be less than 68 years,
1346 so the high bit will be zero. It is permissible to use the
1347 sampling clock to estimate elapsed wallclock time. A sender that
1348 has no notion of wallclock or elapsed time may set the NTP
1349 timestamp to zero.
1350
1351 RTP timestamp: 32 bits
1352 Corresponds to the same time as the NTP timestamp (above), but
1353 in the same units and with the same random offset as the RTP
1354 timestamps in data packets. This correspondence may be used for
1355 intra- and inter-media synchronization for sources whose NTP
1356 timestamps are synchronized, and may be used by media-
1357 independent receivers to estimate the nominal RTP clock
1358 frequency. Note that in most cases this timestamp will not be
1359 equal to the RTP timestamp in any adjacent data packet. Rather,
1360 it is calculated from the corresponding NTP timestamp using the
1361 relationship between the RTP timestamp counter and real time as
1362 maintained by periodically checking the wallclock time at a
1363 sampling instant.
1364
1365 sender's packet count: 32 bits
1366 The total number of RTP data packets transmitted by the sender
1367 since starting transmission up until the time this SR packet was
1368 generated. The count is reset if the sender changes its SSRC
1369 identifier.
1370
1371 sender's octet count: 32 bits
1372 The total number of payload octets (i.e., not including header
1373 or padding) transmitted in RTP data packets by the sender since
1374 starting transmission up until the time this SR packet was
1375 generated. The count is reset if the sender changes its SSRC
1376 identifier. This field can be used to estimate the average
1377 payload data rate.
1378
1379 The third section contains zero or more reception report blocks
1380 depending on the number of other sources heard by this sender since
1381 the last report. Each reception report block conveys statistics on
1382 the reception of RTP packets from a single synchronization source.
1383 Receivers do not carry over statistics when a source changes its SSRC
1384 identifier due to a collision. These statistics are:
1385
1386 SSRC_n (source identifier): 32 bits
1387 The SSRC identifier of the source to which the information in
1388 this reception report block pertains.
1389
1390 fraction lost: 8 bits
1391 The fraction of RTP data packets from source SSRC_n lost since
1392 the previous SR or RR packet was sent, expressed as a fixed
1393
1394
1395
1396 <span class="grey">Schulzrinne, et al Standards Track [Page 25]</span></pre>
1397 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-26" ></span>
1398 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1399
1400
1401 point number with the binary point at the left edge of the
1402 field. (That is equivalent to taking the integer part after
1403 multiplying the loss fraction by 256.) This fraction is defined
1404 to be the number of packets lost divided by the number of
1405 packets expected, as defined in the next paragraph. An
1406 implementation is shown in <a href="#appendix-A.3">Appendix A.3</a>. If the loss is negative
1407 due to duplicates, the fraction lost is set to zero. Note that a
1408 receiver cannot tell whether any packets were lost after the
1409 last one received, and that there will be no reception report
1410 block issued for a source if all packets from that source sent
1411 during the last reporting interval have been lost.
1412
1413 cumulative number of packets lost: 24 bits
1414 The total number of RTP data packets from source SSRC_n that
1415 have been lost since the beginning of reception. This number is
1416 defined to be the number of packets expected less the number of
1417 packets actually received, where the number of packets received
1418 includes any which are late or duplicates. Thus packets that
1419 arrive late are not counted as lost, and the loss may be
1420 negative if there are duplicates. The number of packets
1421 expected is defined to be the extended last sequence number
1422 received, as defined next, less the initial sequence number
1423 received. This may be calculated as shown in <a href="#appendix-A.3">Appendix A.3</a>.
1424
1425 extended highest sequence number received: 32 bits
1426 The low 16 bits contain the highest sequence number received in
1427 an RTP data packet from source SSRC_n, and the most significant
1428 16 bits extend that sequence number with the corresponding count
1429 of sequence number cycles, which may be maintained according to
1430 the algorithm in <a href="#appendix-A.1">Appendix A.1</a>. Note that different receivers
1431 within the same session will generate different extensions to
1432 the sequence number if their start times differ significantly.
1433
1434 interarrival jitter: 32 bits
1435 An estimate of the statistical variance of the RTP data packet
1436 interarrival time, measured in timestamp units and expressed as
1437 an unsigned integer. The interarrival jitter J is defined to be
1438 the mean deviation (smoothed absolute value) of the difference D
1439 in packet spacing at the receiver compared to the sender for a
1440 pair of packets. As shown in the equation below, this is
1441 equivalent to the difference in the "relative transit time" for
1442 the two packets; the relative transit time is the difference
1443 between a packet's RTP timestamp and the receiver's clock at the
1444 time of arrival, measured in the same units.
1445
1446
1447
1448
1449
1450
1451
1452 <span class="grey">Schulzrinne, et al Standards Track [Page 26]</span></pre>
1453 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-27" ></span>
1454 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1455
1456
1457 If Si is the RTP timestamp from packet i, and Ri is the time of
1458 arrival in RTP timestamp units for packet i, then for two packets i
1459 and j, D may be expressed as
1460
1461 D(i,j)=(Rj-Ri)-(Sj-Si)=(Rj-Sj)-(Ri-Si)
1462
1463 The interarrival jitter is calculated continuously as each data
1464 packet i is received from source SSRC_n, using this difference D for
1465 that packet and the previous packet i-1 in order of arrival (not
1466 necessarily in sequence), according to the formula
1467
1468 J=J+(|D(i-1,i)|-J)/16
1469
1470 Whenever a reception report is issued, the current value of J is
1471 sampled.
1472
1473 The jitter calculation is prescribed here to allow profile-
1474 independent monitors to make valid interpretations of reports coming
1475 from different implementations. This algorithm is the optimal first-
1476 order estimator and the gain parameter 1/16 gives a good noise
1477 reduction ratio while maintaining a reasonable rate of convergence
1478 [<a href="#ref-11" title="New York: Macmillan">11</a>]. A sample implementation is shown in <a href="#appendix-A.8">Appendix A.8</a>.
1479
1480 last SR timestamp (LSR): 32 bits
1481 The middle 32 bits out of 64 in the NTP timestamp (as explained
1482 in <a href="#section-4">Section 4</a>) received as part of the most recent RTCP sender
1483 report (SR) packet from source SSRC_n. If no SR has been
1484 received yet, the field is set to zero.
1485
1486 delay since last SR (DLSR): 32 bits
1487 The delay, expressed in units of 1/65536 seconds, between
1488 receiving the last SR packet from source SSRC_n and sending this
1489 reception report block. If no SR packet has been received yet
1490 from SSRC_n, the DLSR field is set to zero.
1491
1492 Let SSRC_r denote the receiver issuing this receiver report. Source
1493 SSRC_n can compute the round propagation delay to SSRC_r by recording
1494 the time A when this reception report block is received. It
1495 calculates the total round-trip time A-LSR using the last SR
1496 timestamp (LSR) field, and then subtracting this field to leave the
1497 round-trip propagation delay as (A- LSR - DLSR). This is illustrated
1498 in Fig. 2.
1499
1500 This may be used as an approximate measure of distance to cluster
1501 receivers, although some links have very asymmetric delays.
1502
1503
1504
1505
1506
1507
1508 <span class="grey">Schulzrinne, et al Standards Track [Page 27]</span></pre>
1509 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-28" ></span>
1510 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1511
1512
1513 <span class="h4"><a class="selflink" id="section-6.3.2" href="#section-6.3.2">6.3.2</a> RR: Receiver report RTCP packet</span>
1514
1515 [10 Nov 1995 11:33:25.125] [10 Nov 1995 11:33:36.5]
1516 n SR(n) A=b710:8000 (46864.500 s)
1517 ----------------------------------------------------------------&gt;
1518 v ^
1519 ntp_sec =0xb44db705 v ^ dlsr=0x0005.4000 ( 5.250s)
1520 ntp_frac=0x20000000 v ^ lsr =0xb705:2000 (46853.125s)
1521 (3024992016.125 s) v ^
1522 r v ^ RR(n)
1523 ----------------------------------------------------------------&gt;
1524 |&lt;-DLSR-&gt;|
1525 (5.250 s)
1526
1527 A 0xb710:8000 (46864.500 s)
1528 DLSR -0x0005:4000 ( 5.250 s)
1529 LSR -0xb705:2000 (46853.125 s)
1530 -------------------------------
1531 delay 0x 6:2000 ( 6.125 s)
1532
1533 Figure 2: Example for round-trip time computation
1534
1535 0 1 2 3
1536 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1537 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1538 |V=2|P| RC | PT=RR=201 | length | header
1539 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1540 | SSRC of packet sender |
1541 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1542 | SSRC_1 (SSRC of first source) | report
1543 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ block
1544 | fraction lost | cumulative number of packets lost | 1
1545 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1546 | extended highest sequence number received |
1547 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1548 | interarrival jitter |
1549 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1550 | last SR (LSR) |
1551 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1552 | delay since last SR (DLSR) |
1553 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1554 | SSRC_2 (SSRC of second source) | report
1555 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ block
1556 : ... : 2
1557 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1558 | profile-specific extensions |
1559 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1560
1561
1562
1563
1564 <span class="grey">Schulzrinne, et al Standards Track [Page 28]</span></pre>
1565 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-29" ></span>
1566 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1567
1568
1569 The format of the receiver report (RR) packet is the same as that of
1570 the SR packet except that the packet type field contains the constant
1571 201 and the five words of sender information are omitted (these are
1572 the NTP and RTP timestamps and sender's packet and octet counts). The
1573 remaining fields have the same meaning as for the SR packet.
1574
1575 An empty RR packet (RC = 0) is put at the head of a compound RTCP
1576 packet when there is no data transmission or reception to report.
1577
1578 <span class="h4"><a class="selflink" id="section-6.3.3" href="#section-6.3.3">6.3.3</a> Extending the sender and receiver reports</span>
1579
1580 A profile should define profile- or application-specific extensions
1581 to the sender report and receiver if there is additional information
1582 that should be reported regularly about the sender or receivers. This
1583 method should be used in preference to defining another RTCP packet
1584 type because it requires less overhead:
1585
1586 o fewer octets in the packet (no RTCP header or SSRC field);
1587
1588 o simpler and faster parsing because applications running under
1589 that profile would be programmed to always expect the extension
1590 fields in the directly accessible location after the reception
1591 reports.
1592
1593 If additional sender information is required, it should be included
1594 first in the extension for sender reports, but would not be present
1595 in receiver reports. If information about receivers is to be
1596 included, that data may be structured as an array of blocks parallel
1597 to the existing array of reception report blocks; that is, the number
1598 of blocks would be indicated by the RC field.
1599
1600 <span class="h4"><a class="selflink" id="section-6.3.4" href="#section-6.3.4">6.3.4</a> Analyzing sender and receiver reports</span>
1601
1602 It is expected that reception quality feedback will be useful not
1603 only for the sender but also for other receivers and third-party
1604 monitors. The sender may modify its transmissions based on the
1605 feedback; receivers can determine whether problems are local,
1606 regional or global; network managers may use profile-independent
1607 monitors that receive only the RTCP packets and not the corresponding
1608 RTP data packets to evaluate the performance of their networks for
1609 multicast distribution.
1610
1611 Cumulative counts are used in both the sender information and
1612 receiver report blocks so that differences may be calculated between
1613 any two reports to make measurements over both short and long time
1614 periods, and to provide resilience against the loss of a report. The
1615 difference between the last two reports received can be used to
1616 estimate the recent quality of the distribution. The NTP timestamp is
1617
1618
1619
1620 <span class="grey">Schulzrinne, et al Standards Track [Page 29]</span></pre>
1621 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-30" ></span>
1622 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1623
1624
1625 included so that rates may be calculated from these differences over
1626 the interval between two reports. Since that timestamp is independent
1627 of the clock rate for the data encoding, it is possible to implement
1628 encoding- and profile-independent quality monitors.
1629
1630 An example calculation is the packet loss rate over the interval
1631 between two reception reports. The difference in the cumulative
1632 number of packets lost gives the number lost during that interval.
1633 The difference in the extended last sequence numbers received gives
1634 the number of packets expected during the interval. The ratio of
1635 these two is the packet loss fraction over the interval. This ratio
1636 should equal the fraction lost field if the two reports are
1637 consecutive, but otherwise not. The loss rate per second can be
1638 obtained by dividing the loss fraction by the difference in NTP
1639 timestamps, expressed in seconds. The number of packets received is
1640 the number of packets expected minus the number lost. The number of
1641 packets expected may also be used to judge the statistical validity
1642 of any loss estimates. For example, 1 out of 5 packets lost has a
1643 lower significance than 200 out of 1000.
1644
1645 From the sender information, a third-party monitor can calculate the
1646 average payload data rate and the average packet rate over an
1647 interval without receiving the data. Taking the ratio of the two
1648 gives the average payload size. If it can be assumed that packet loss
1649 is independent of packet size, then the number of packets received by
1650 a particular receiver times the average payload size (or the
1651 corresponding packet size) gives the apparent throughput available to
1652 that receiver.
1653
1654 In addition to the cumulative counts which allow long-term packet
1655 loss measurements using differences between reports, the fraction
1656 lost field provides a short-term measurement from a single report.
1657 This becomes more important as the size of a session scales up enough
1658 that reception state information might not be kept for all receivers
1659 or the interval between reports becomes long enough that only one
1660 report might have been received from a particular receiver.
1661
1662 The interarrival jitter field provides a second short-term measure of
1663 network congestion. Packet loss tracks persistent congestion while
1664 the jitter measure tracks transient congestion. The jitter measure
1665 may indicate congestion before it leads to packet loss. Since the
1666 interarrival jitter field is only a snapshot of the jitter at the
1667 time of a report, it may be necessary to analyze a number of reports
1668 from one receiver over time or from multiple receivers, e.g., within
1669 a single network.
1670
1671
1672
1673
1674
1675
1676 <span class="grey">Schulzrinne, et al Standards Track [Page 30]</span></pre>
1677 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-31" ></span>
1678 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1679
1680
1681 <span class="h3"><a class="selflink" id="section-6.4" href="#section-6.4">6.4</a> SDES: Source description RTCP packet</span>
1682
1683 0 1 2 3
1684 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1685 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1686 |V=2|P| SC | PT=SDES=202 | length | header
1687 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1688 | SSRC/CSRC_1 | chunk
1689 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 1
1690 | SDES items |
1691 | ... |
1692 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1693 | SSRC/CSRC_2 | chunk
1694 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 2
1695 | SDES items |
1696 | ... |
1697 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
1698
1699 The SDES packet is a three-level structure composed of a header and
1700 zero or more chunks, each of of which is composed of items describing
1701 the source identified in that chunk. The items are described
1702 individually in subsequent sections.
1703
1704 version (V), padding (P), length:
1705 As described for the SR packet (see <a href="#section-6.3.1">Section 6.3.1</a>).
1706
1707 packet type (PT): 8 bits
1708 Contains the constant 202 to identify this as an RTCP SDES
1709 packet.
1710
1711 source count (SC): 5 bits
1712 The number of SSRC/CSRC chunks contained in this SDES packet. A
1713 value of zero is valid but useless.
1714
1715 Each chunk consists of an SSRC/CSRC identifier followed by a list of
1716 zero or more items, which carry information about the SSRC/CSRC. Each
1717 chunk starts on a 32-bit boundary. Each item consists of an 8-bit
1718 type field, an 8-bit octet count describing the length of the text
1719 (thus, not including this two-octet header), and the text itself.
1720 Note that the text can be no longer than 255 octets, but this is
1721 consistent with the need to limit RTCP bandwidth consumption.
1722
1723 The text is encoded according to the UTF-2 encoding specified in
1724 Annex F of ISO standard 10646 [<a href="#ref-12" title="&quot;ISO/IEC DIS 10646-1:1993 information technology -- universal multiple-octet coded character set (UCS) -- part I: Architecture and basic multilingual plane,&quot;">12</a>,<a href="#ref-13" title="The Unicode Standard New York">13</a>]. This encoding is also known as
1725 UTF-8 or UTF-FSS. It is described in "File System Safe UCS
1726 Transformation Format (FSS_UTF)", X/Open Preliminary Specification,
1727 Document Number P316 and Unicode Technical Report #4. US-ASCII is a
1728 subset of this encoding and requires no additional encoding. The
1729
1730
1731
1732 <span class="grey">Schulzrinne, et al Standards Track [Page 31]</span></pre>
1733 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-32" ></span>
1734 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1735
1736
1737 presence of multi-octet encodings is indicated by setting the most
1738 significant bit of a character to a value of one.
1739
1740 Items are contiguous, i.e., items are not individually padded to a
1741 32-bit boundary. Text is not null terminated because some multi-octet
1742 encodings include null octets. The list of items in each chunk is
1743 terminated by one or more null octets, the first of which is
1744 interpreted as an item type of zero to denote the end of the list,
1745 and the remainder as needed to pad until the next 32-bit boundary. A
1746 chunk with zero items (four null octets) is valid but useless.
1747
1748 End systems send one SDES packet containing their own source
1749 identifier (the same as the SSRC in the fixed RTP header). A mixer
1750 sends one SDES packet containing a chunk for each contributing source
1751 from which it is receiving SDES information, or multiple complete
1752 SDES packets in the format above if there are more than 31 such
1753 sources (see <a href="#section-7">Section 7</a>).
1754
1755 The SDES items currently defined are described in the next sections.
1756 Only the CNAME item is mandatory. Some items shown here may be useful
1757 only for particular profiles, but the item types are all assigned
1758 from one common space to promote shared use and to simplify profile-
1759 independent applications. Additional items may be defined in a
1760 profile by registering the type numbers with IANA.
1761
1762 <span class="h4"><a class="selflink" id="section-6.4.1" href="#section-6.4.1">6.4.1</a> CNAME: Canonical end-point identifier SDES item</span>
1763
1764 0 1 2 3
1765 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1766 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1767 | CNAME=1 | length | user and domain name ...
1768 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1769
1770 The CNAME identifier has the following properties:
1771
1772 o Because the randomly allocated SSRC identifier may change if a
1773 conflict is discovered or if a program is restarted, the CNAME
1774 item is required to provide the binding from the SSRC
1775 identifier to an identifier for the source that remains
1776 constant.
1777
1778 o Like the SSRC identifier, the CNAME identifier should also be
1779 unique among all participants within one RTP session.
1780
1781 o To provide a binding across multiple media tools used by one
1782 participant in a set of related RTP sessions, the CNAME should
1783 be fixed for that participant.
1784
1785
1786
1787
1788 <span class="grey">Schulzrinne, et al Standards Track [Page 32]</span></pre>
1789 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-33" ></span>
1790 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1791
1792
1793 o To facilitate third-party monitoring, the CNAME should be
1794 suitable for either a program or a person to locate the source.
1795
1796 Therefore, the CNAME should be derived algorithmically and not
1797 entered manually, when possible. To meet these requirements, the
1798 following format should be used unless a profile specifies an
1799 alternate syntax or semantics. The CNAME item should have the format
1800 "user@host", or "host" if a user name is not available as on single-
1801 user systems. For both formats, "host" is either the fully qualified
1802 domain name of the host from which the real-time data originates,
1803 formatted according to the rules specified in <a href="./rfc1034">RFC 1034</a> [<a href="#ref-14" title="&quot;Domain Names - Concepts and Facilities&quot;">14</a>], <a href="./rfc1035">RFC 1035</a>
1804 [<a href="#ref-15" title="&quot;Domain Names - Implementation and Specification&quot;">15</a>] and <a href="./rfc1123#section-2.1">Section&nbsp;2.1 of RFC 1123</a> [<a href="#ref-16" title="&quot;Requirements for Internet Hosts - Application and Support&quot;">16</a>]; or the standard ASCII
1805 representation of the host's numeric address on the interface used
1806 for the RTP communication. For example, the standard ASCII
1807 representation of an IP Version 4 address is "dotted decimal", also
1808 known as dotted quad. Other address types are expected to have ASCII
1809 representations that are mutually unique. The fully qualified domain
1810 name is more convenient for a human observer and may avoid the need
1811 to send a NAME item in addition, but it may be difficult or
1812 impossible to obtain reliably in some operating environments.
1813 Applications that may be run in such environments should use the
1814 ASCII representation of the address instead.
1815
1816 Examples are "[email protected]" or "[email protected]" for a
1817 multi-user system. On a system with no user name, examples would be
1818 "sleepy.megacorp.com" or "192.0.2.89".
1819
1820 The user name should be in a form that a program such as "finger" or
1821 "talk" could use, i.e., it typically is the login name rather than
1822 the personal name. The host name is not necessarily identical to the
1823 one in the participant's electronic mail address.
1824
1825 This syntax will not provide unique identifiers for each source if an
1826 application permits a user to generate multiple sources from one
1827 host. Such an application would have to rely on the SSRC to further
1828 identify the source, or the profile for that application would have
1829 to specify additional syntax for the CNAME identifier.
1830
1831 If each application creates its CNAME independently, the resulting
1832 CNAMEs may not be identical as would be required to provide a binding
1833 across multiple media tools belonging to one participant in a set of
1834 related RTP sessions. If cross-media binding is required, it may be
1835 necessary for the CNAME of each tool to be externally configured with
1836 the same value by a coordination tool.
1837
1838 Application writers should be aware that private network address
1839 assignments such as the Net-10 assignment proposed in <a href="./rfc1597">RFC 1597</a> [<a href="#ref-17" title="&quot;Address Allocation for Private Internets&quot;">17</a>]
1840 may create network addresses that are not globally unique. This would
1841
1842
1843
1844 <span class="grey">Schulzrinne, et al Standards Track [Page 33]</span></pre>
1845 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-34" ></span>
1846 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1847
1848
1849 lead to non-unique CNAMEs if hosts with private addresses and no
1850 direct IP connectivity to the public Internet have their RTP packets
1851 forwarded to the public Internet through an RTP-level translator.
1852 (See also <a href="./rfc1627">RFC 1627</a> [<a href="#ref-18" title="&quot;Network 10 Considered Harmful (Some Practices Shouldn't be Codified)&quot;">18</a>].) To handle this case, applications may
1853 provide a means to configure a unique CNAME, but the burden is on the
1854 translator to translate CNAMEs from private addresses to public
1855 addresses if necessary to keep private addresses from being exposed.
1856
1857 <span class="h4"><a class="selflink" id="section-6.4.2" href="#section-6.4.2">6.4.2</a> NAME: User name SDES item</span>
1858
1859 0 1 2 3
1860 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1861 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1862 | NAME=2 | length | common name of source ...
1863 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1864
1865 This is the real name used to describe the source, e.g., "John Doe,
1866 Bit Recycler, Megacorp". It may be in any form desired by the user.
1867 For applications such as conferencing, this form of name may be the
1868 most desirable for display in participant lists, and therefore might
1869 be sent most frequently of those items other than CNAME. Profiles may
1870 establish such priorities. The NAME value is expected to remain
1871 constant at least for the duration of a session. It should not be
1872 relied upon to be unique among all participants in the session.
1873
1874 <span class="h4"><a class="selflink" id="section-6.4.3" href="#section-6.4.3">6.4.3</a> EMAIL: Electronic mail address SDES item</span>
1875
1876 0 1 2 3
1877 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1878 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1879 | EMAIL=3 | length | email address of source ...
1880 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1881
1882 The email address is formatted according to <a href="./rfc822">RFC 822</a> [<a href="#ref-19" title="&quot;Standard for the Format of ARPA Internet Text Messages&quot;">19</a>], for
1883 example, "[email protected]". The EMAIL value is expected to
1884 remain constant for the duration of a session.
1885
1886 <span class="h4"><a class="selflink" id="section-6.4.4" href="#section-6.4.4">6.4.4</a> PHONE: Phone number SDES item</span>
1887
1888 0 1 2 3
1889 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1890 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1891 | PHONE=4 | length | phone number of source ...
1892 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1893
1894 The phone number should be formatted with the plus sign replacing the
1895 international access code. For example, "+1 908 555 1212" for a
1896 number in the United States.
1897
1898
1899
1900 <span class="grey">Schulzrinne, et al Standards Track [Page 34]</span></pre>
1901 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-35" ></span>
1902 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1903
1904
1905 <span class="h4"><a class="selflink" id="section-6.4.5" href="#section-6.4.5">6.4.5</a> LOC: Geographic user location SDES item</span>
1906
1907 0 1 2 3
1908 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1909 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1910 | LOC=5 | length | geographic location of site ...
1911 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1912
1913 Depending on the application, different degrees of detail are
1914 appropriate for this item. For conference applications, a string like
1915 "Murray Hill, New Jersey" may be sufficient, while, for an active
1916 badge system, strings like "Room 2A244, AT&amp;T BL MH" might be
1917 appropriate. The degree of detail is left to the implementation
1918 and/or user, but format and content may be prescribed by a profile.
1919 The LOC value is expected to remain constant for the duration of a
1920 session, except for mobile hosts.
1921
1922 <span class="h4"><a class="selflink" id="section-6.4.6" href="#section-6.4.6">6.4.6</a> TOOL: Application or tool name SDES item</span>
1923
1924 0 1 2 3
1925 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1926 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1927 | TOOL=6 | length | name/version of source appl. ...
1928 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1929
1930 A string giving the name and possibly version of the application
1931 generating the stream, e.g., "videotool 1.2". This information may be
1932 useful for debugging purposes and is similar to the Mailer or Mail-
1933 System-Version SMTP headers. The TOOL value is expected to remain
1934 constant for the duration of the session.
1935
1936 <span class="h4"><a class="selflink" id="section-6.4.7" href="#section-6.4.7">6.4.7</a> NOTE: Notice/status SDES item</span>
1937
1938 0 1 2 3
1939 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1940 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1941 | NOTE=7 | length | note about the source ...
1942 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1943
1944 The following semantics are suggested for this item, but these or
1945 other semantics may be explicitly defined by a profile. The NOTE item
1946 is intended for transient messages describing the current state of
1947 the source, e.g., "on the phone, can't talk". Or, during a seminar,
1948 this item might be used to convey the title of the talk. It should be
1949 used only to carry exceptional information and should not be included
1950 routinely by all participants because this would slow down the rate
1951 at which reception reports and CNAME are sent, thus impairing the
1952 performance of the protocol. In particular, it should not be included
1953
1954
1955
1956 <span class="grey">Schulzrinne, et al Standards Track [Page 35]</span></pre>
1957 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-36" ></span>
1958 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
1959
1960
1961 as an item in a user's configuration file nor automatically generated
1962 as in a quote-of-the-day.
1963
1964 Since the NOTE item may be important to display while it is active,
1965 the rate at which other non-CNAME items such as NAME are transmitted
1966 might be reduced so that the NOTE item can take that part of the RTCP
1967 bandwidth. When the transient message becomes inactive, the NOTE item
1968 should continue to be transmitted a few times at the same repetition
1969 rate but with a string of length zero to signal the receivers.
1970 However, receivers should also consider the NOTE item inactive if it
1971 is not received for a small multiple of the repetition rate, or
1972 perhaps 20-30 RTCP intervals.
1973
1974 <span class="h4"><a class="selflink" id="section-6.4.8" href="#section-6.4.8">6.4.8</a> PRIV: Private extensions SDES item</span>
1975
1976 0 1 2 3
1977 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
1978 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1979 | PRIV=8 | length | prefix length | prefix string...
1980 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1981 ... | value string ...
1982 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1983
1984 This item is used to define experimental or application-specific SDES
1985 extensions. The item contains a prefix consisting of a length-string
1986 pair, followed by the value string filling the remainder of the item
1987 and carrying the desired information. The prefix length field is 8
1988 bits long. The prefix string is a name chosen by the person defining
1989 the PRIV item to be unique with respect to other PRIV items this
1990 application might receive. The application creator might choose to
1991 use the application name plus an additional subtype identification if
1992 needed. Alternatively, it is recommended that others choose a name
1993 based on the entity they represent, then coordinate the use of the
1994 name within that entity.
1995
1996 Note that the prefix consumes some space within the item's total
1997 length of 255 octets, so the prefix should be kept as short as
1998 possible. This facility and the constrained RTCP bandwidth should not
1999 be overloaded; it is not intended to satisfy all the control
2000 communication requirements of all applications.
2001
2002 SDES PRIV prefixes will not be registered by IANA. If some form of
2003 the PRIV item proves to be of general utility, it should instead be
2004 assigned a regular SDES item type registered with IANA so that no
2005 prefix is required. This simplifies use and increases transmission
2006 efficiency.
2007
2008
2009
2010
2011
2012 <span class="grey">Schulzrinne, et al Standards Track [Page 36]</span></pre>
2013 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-37" ></span>
2014 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2015
2016
2017 <span class="h3"><a class="selflink" id="section-6.5" href="#section-6.5">6.5</a> BYE: Goodbye RTCP packet</span>
2018
2019 0 1 2 3
2020 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
2021 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2022 |V=2|P| SC | PT=BYE=203 | length |
2023 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2024 | SSRC/CSRC |
2025 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2026 : ... :
2027 +=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
2028 | length | reason for leaving ... (opt)
2029 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2030
2031 The BYE packet indicates that one or more sources are no longer
2032 active.
2033
2034 version (V), padding (P), length:
2035 As described for the SR packet (see <a href="#section-6.3.1">Section 6.3.1</a>).
2036
2037 packet type (PT): 8 bits
2038 Contains the constant 203 to identify this as an RTCP BYE
2039 packet.
2040
2041 source count (SC): 5 bits
2042 The number of SSRC/CSRC identifiers included in this BYE packet.
2043 A count value of zero is valid, but useless.
2044
2045 If a BYE packet is received by a mixer, the mixer forwards the BYE
2046 packet with the SSRC/CSRC identifier(s) unchanged. If a mixer shuts
2047 down, it should send a BYE packet listing all contributing sources it
2048 handles, as well as its own SSRC identifier. Optionally, the BYE
2049 packet may include an 8-bit octet count followed by that many octets
2050 of text indicating the reason for leaving, e.g., "camera malfunction"
2051 or "RTP loop detected". The string has the same encoding as that
2052 described for SDES. If the string fills the packet to the next 32-bit
2053 boundary, the string is not null terminated. If not, the BYE packet
2054 is padded with null octets.
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068 <span class="grey">Schulzrinne, et al Standards Track [Page 37]</span></pre>
2069 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-38" ></span>
2070 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2071
2072
2073 <span class="h3"><a class="selflink" id="section-6.6" href="#section-6.6">6.6</a> APP: Application-defined RTCP packet</span>
2074
2075 0 1 2 3
2076 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
2077 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2078 |V=2|P| subtype | PT=APP=204 | length |
2079 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2080 | SSRC/CSRC |
2081 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2082 | name (ASCII) |
2083 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2084 | application-dependent data ...
2085 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
2086
2087 The APP packet is intended for experimental use as new applications
2088 and new features are developed, without requiring packet type value
2089 registration. APP packets with unrecognized names should be ignored.
2090 After testing and if wider use is justified, it is recommended that
2091 each APP packet be redefined without the subtype and name fields and
2092 registered with the Internet Assigned Numbers Authority using an RTCP
2093 packet type.
2094
2095 version (V), padding (P), length:
2096 As described for the SR packet (see <a href="#section-6.3.1">Section 6.3.1</a>).
2097
2098 subtype: 5 bits
2099 May be used as a subtype to allow a set of APP packets to be
2100 defined under one unique name, or for any application-dependent
2101 data.
2102
2103 packet type (PT): 8 bits
2104 Contains the constant 204 to identify this as an RTCP APP
2105 packet.
2106
2107 name: 4 octets
2108 A name chosen by the person defining the set of APP packets to
2109 be unique with respect to other APP packets this application
2110 might receive. The application creator might choose to use the
2111 application name, and then coordinate the allocation of subtype
2112 values to others who want to define new packet types for the
2113 application. Alternatively, it is recommended that others
2114 choose a name based on the entity they represent, then
2115 coordinate the use of the name within that entity. The name is
2116 interpreted as a sequence of four ASCII characters, with
2117 uppercase and lowercase characters treated as distinct.
2118
2119
2120
2121
2122
2123
2124 <span class="grey">Schulzrinne, et al Standards Track [Page 38]</span></pre>
2125 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-39" ></span>
2126 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2127
2128
2129 application-dependent data: variable length
2130 Application-dependent data may or may not appear in an APP
2131 packet. It is interpreted by the application and not RTP itself.
2132 It must be a multiple of 32 bits long.
2133
2134 <span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. RTP Translators and Mixers</span>
2135
2136 In addition to end systems, RTP supports the notion of "translators"
2137 and "mixers", which could be considered as "intermediate systems" at
2138 the RTP level. Although this support adds some complexity to the
2139 protocol, the need for these functions has been clearly established
2140 by experiments with multicast audio and video applications in the
2141 Internet. Example uses of translators and mixers given in <a href="#section-2.3">Section 2.3</a>
2142 stem from the presence of firewalls and low bandwidth connections,
2143 both of which are likely to remain.
2144
2145 <span class="h3"><a class="selflink" id="section-7.1" href="#section-7.1">7.1</a> General Description</span>
2146
2147 An RTP translator/mixer connects two or more transport-level
2148 "clouds". Typically, each cloud is defined by a common network and
2149 transport protocol (e.g., IP/UDP), multicast address or pair of
2150 unicast addresses, and transport level destination port. (Network-
2151 level protocol translators, such as IP version 4 to IP version 6, may
2152 be present within a cloud invisibly to RTP.) One system may serve as
2153 a translator or mixer for a number of RTP sessions, but each is
2154 considered a logically separate entity.
2155
2156 In order to avoid creating a loop when a translator or mixer is
2157 installed, the following rules must be observed:
2158
2159 o Each of the clouds connected by translators and mixers
2160 participating in one RTP session either must be distinct from
2161 all the others in at least one of these parameters (protocol,
2162 address, port), or must be isolated at the network level from
2163 the others.
2164
2165 o A derivative of the first rule is that there must not be
2166 multiple translators or mixers connected in parallel unless by
2167 some arrangement they partition the set of sources to be
2168 forwarded.
2169
2170 Similarly, all RTP end systems that can communicate through one or
2171 more RTP translators or mixers share the same SSRC space, that is,
2172 the SSRC identifiers must be unique among all these end systems.
2173 <a href="#section-8.2">Section 8.2</a> describes the collision resolution algorithm by which
2174 SSRC identifiers are kept unique and loops are detected.
2175
2176
2177
2178
2179
2180 <span class="grey">Schulzrinne, et al Standards Track [Page 39]</span></pre>
2181 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-40" ></span>
2182 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2183
2184
2185 There may be many varieties of translators and mixers designed for
2186 different purposes and applications. Some examples are to add or
2187 remove encryption, change the encoding of the data or the underlying
2188 protocols, or replicate between a multicast address and one or more
2189 unicast addresses. The distinction between translators and mixers is
2190 that a translator passes through the data streams from different
2191 sources separately, whereas a mixer combines them to form one new
2192 stream:
2193
2194 Translator: Forwards RTP packets with their SSRC identifier intact;
2195 this makes it possible for receivers to identify individual
2196 sources even though packets from all the sources pass through
2197 the same translator and carry the translator's network source
2198 address. Some kinds of translators will pass through the data
2199 untouched, but others may change the encoding of the data and
2200 thus the RTP data payload type and timestamp. If multiple data
2201 packets are re-encoded into one, or vice versa, a translator
2202 must assign new sequence numbers to the outgoing packets. Losses
2203 in the incoming packet stream may induce corresponding gaps in
2204 the outgoing sequence numbers. Receivers cannot detect the
2205 presence of a translator unless they know by some other means
2206 what payload type or transport address was used by the original
2207 source.
2208
2209 Mixer: Receives streams of RTP data packets from one or more sources,
2210 possibly changes the data format, combines the streams in some
2211 manner and then forwards the combined stream. Since the timing
2212 among multiple input sources will not generally be synchronized,
2213 the mixer will make timing adjustments among the streams and
2214 generate its own timing for the combined stream, so it is the
2215 synchronization source. Thus, all data packets forwarded by a
2216 mixer will be marked with the mixer's own SSRC identifier. In
2217 order to preserve the identity of the original sources
2218 contributing to the mixed packet, the mixer should insert their
2219 SSRC identifiers into the CSRC identifier list following the
2220 fixed RTP header of the packet. A mixer that is also itself a
2221 contributing source for some packet should explicitly include
2222 its own SSRC identifier in the CSRC list for that packet.
2223
2224 For some applications, it may be acceptable for a mixer not to
2225 identify sources in the CSRC list. However, this introduces the
2226 danger that loops involving those sources could not be detected.
2227
2228 The advantage of a mixer over a translator for applications like
2229 audio is that the output bandwidth is limited to that of one source
2230 even when multiple sources are active on the input side. This may be
2231 important for low-bandwidth links. The disadvantage is that receivers
2232 on the output side don't have any control over which sources are
2233
2234
2235
2236 <span class="grey">Schulzrinne, et al Standards Track [Page 40]</span></pre>
2237 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-41" ></span>
2238 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2239
2240
2241 passed through or muted, unless some mechanism is implemented for
2242 remote control of the mixer. The regeneration of synchronization
2243 information by mixers also means that receivers can't do inter-media
2244 synchronization of the original streams. A multi-media mixer could do
2245 it.
2246
2247
2248 [<a id="ref-E1">E1</a>] [E6]
2249 | |
2250 E1:17 | E6:15 |
2251 | | E6:15
2252 V M1:48 (1,17) M1:48 (1,17) V M1:48 (1,17)
2253 (M1)-------------&gt;&lt;T1&gt;-----------------&gt;&lt;T2&gt;--------------&gt;[E7]
2254 ^ ^ E4:47 ^ E4:47
2255 E2:1 | E4:47 | | M3:89 (64,45)
2256 | | |
2257 [E2] [E4] M3:89 (64,45) |
2258 | legend:
2259 [E3] ---------&gt;(M2)-----------&gt;(M3)------------| [End system]
2260 E3:64 M2:12 (64) ^ (Mixer)
2261 | E5:45 &lt;Translator&gt;
2262 |
2263 [E5] source: SSRC (CSRCs)
2264 -------------------&gt;
2265
2266 Figure 3: Sample RTP network with end systems, mixers and translators
2267
2268 A collection of mixers and translators is shown in Figure 3 to
2269 illustrate their effect on SSRC and CSRC identifiers. In the figure,
2270 end systems are shown as rectangles (named E), translators as
2271 triangles (named T) and mixers as ovals (named M). The notation "M1:
2272 48(1,17)" designates a packet originating a mixer M1, identified with
2273 M1's (random) SSRC value of 48 and two CSRC identifiers, 1 and 17,
2274 copied from the SSRC identifiers of packets from E1 and E2.
2275
2276 <span class="h3"><a class="selflink" id="section-7.2" href="#section-7.2">7.2</a> RTCP Processing in Translators</span>
2277
2278 In addition to forwarding data packets, perhaps modified, translators
2279 and mixers must also process RTCP packets. In many cases, they will
2280 take apart the compound RTCP packets received from end systems to
2281 aggregate SDES information and to modify the SR or RR packets.
2282 Retransmission of this information may be triggered by the packet
2283 arrival or by the RTCP interval timer of the translator or mixer
2284 itself.
2285
2286 A translator that does not modify the data packets, for example one
2287 that just replicates between a multicast address and a unicast
2288 address, may simply forward RTCP packets unmodified as well. A
2289
2290
2291
2292 <span class="grey">Schulzrinne, et al Standards Track [Page 41]</span></pre>
2293 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-42" ></span>
2294 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2295
2296
2297 translator that transforms the payload in some way must make
2298 corresponding transformations in the SR and RR information so that it
2299 still reflects the characteristics of the data and the reception
2300 quality. These translators must not simply forward RTCP packets. In
2301 general, a translator should not aggregate SR and RR packets from
2302 different sources into one packet since that would reduce the
2303 accuracy of the propagation delay measurements based on the LSR and
2304 DLSR fields.
2305
2306 SR sender information: A translator does not generate its own sender
2307 information, but forwards the SR packets received from one cloud
2308 to the others. The SSRC is left intact but the sender
2309 information must be modified if required by the translation. If
2310 a translator changes the data encoding, it must change the
2311 "sender's byte count" field. If it also combines several data
2312 packets into one output packet, it must change the "sender's
2313 packet count" field. If it changes the timestamp frequency, it
2314 must change the "RTP timestamp" field in the SR packet.
2315
2316 SR/RR reception report blocks: A translator forwards reception
2317 reports received from one cloud to the others. Note that these
2318 flow in the direction opposite to the data. The SSRC is left
2319 intact. If a translator combines several data packets into one
2320 output packet, and therefore changes the sequence numbers, it
2321 must make the inverse manipulation for the packet loss fields
2322 and the "extended last sequence number" field. This may be
2323 complex. In the extreme case, there may be no meaningful way to
2324 translate the reception reports, so the translator may pass on
2325 no reception report at all or a synthetic report based on its
2326 own reception. The general rule is to do what makes sense for a
2327 particular translation.
2328
2329 A translator does not require an SSRC identifier of its own, but may
2330 choose to allocate one for the purpose of sending reports about what
2331 it has received. These would be sent to all the connected clouds,
2332 each corresponding to the translation of the data stream as sent to
2333 that cloud, since reception reports are normally multicast to all
2334 participants.
2335
2336 SDES: Translators typically forward without change the SDES
2337 information they receive from one cloud to the others, but may,
2338 for example, decide to filter non-CNAME SDES information if
2339 bandwidth is limited. The CNAMEs must be forwarded to allow SSRC
2340 identifier collision detection to work. A translator that
2341 generates its own RR packets must send SDES CNAME information
2342 about itself to the same clouds that it sends those RR packets.
2343
2344
2345
2346
2347
2348 <span class="grey">Schulzrinne, et al Standards Track [Page 42]</span></pre>
2349 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-43" ></span>
2350 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2351
2352
2353 BYE: Translators forward BYE packets unchanged. Translators with
2354 their own SSRC should generate BYE packets with that SSRC
2355 identifier if they are about to cease forwarding packets.
2356
2357 APP: Translators forward APP packets unchanged.
2358
2359 <span class="h3"><a class="selflink" id="section-7.3" href="#section-7.3">7.3</a> RTCP Processing in Mixers</span>
2360
2361 Since a mixer generates a new data stream of its own, it does not
2362 pass through SR or RR packets at all and instead generates new
2363 information for both sides.
2364
2365 SR sender information: A mixer does not pass through sender
2366 information from the sources it mixes because the
2367 characteristics of the source streams are lost in the mix. As a
2368 synchronization source, the mixer generates its own SR packets
2369 with sender information about the mixed data stream and sends
2370 them in the same direction as the mixed stream.
2371
2372 SR/RR reception report blocks: A mixer generates its own reception
2373 reports for sources in each cloud and sends them out only to the
2374 same cloud. It does not send these reception reports to the
2375 other clouds and does not forward reception reports from one
2376 cloud to the others because the sources would not be SSRCs there
2377 (only CSRCs).
2378
2379 SDES: Mixers typically forward without change the SDES information
2380 they receive from one cloud to the others, but may, for example,
2381 decide to filter non-CNAME SDES information if bandwidth is
2382 limited. The CNAMEs must be forwarded to allow SSRC identifier
2383 collision detection to work. (An identifier in a CSRC list
2384 generated by a mixer might collide with an SSRC identifier
2385 generated by an end system.) A mixer must send SDES CNAME
2386 information about itself to the same clouds that it sends SR or
2387 RR packets.
2388
2389 Since mixers do not forward SR or RR packets, they will typically be
2390 extracting SDES packets from a compound RTCP packet. To minimize
2391 overhead, chunks from the SDES packets may be aggregated into a
2392 single SDES packet which is then stacked on an SR or RR packet
2393 originating from the mixer. The RTCP packet rate may be different on
2394 each side of the mixer.
2395
2396 A mixer that does not insert CSRC identifiers may also refrain from
2397 forwarding SDES CNAMEs. In this case, the SSRC identifier spaces in
2398 the two clouds are independent. As mentioned earlier, this mode of
2399 operation creates a danger that loops can't be detected.
2400
2401
2402
2403
2404 <span class="grey">Schulzrinne, et al Standards Track [Page 43]</span></pre>
2405 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-44" ></span>
2406 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2407
2408
2409 BYE: Mixers need to forward BYE packets. They should generate BYE
2410 packets with their own SSRC identifiers if they are about to
2411 cease forwarding packets.
2412
2413 APP: The treatment of APP packets by mixers is application-specific.
2414
2415 <span class="h3"><a class="selflink" id="section-7.4" href="#section-7.4">7.4</a> Cascaded Mixers</span>
2416
2417 An RTP session may involve a collection of mixers and translators as
2418 shown in Figure 3. If two mixers are cascaded, such as M2 and M3 in
2419 the figure, packets received by a mixer may already have been mixed
2420 and may include a CSRC list with multiple identifiers. The second
2421 mixer should build the CSRC list for the outgoing packet using the
2422 CSRC identifiers from already-mixed input packets and the SSRC
2423 identifiers from unmixed input packets. This is shown in the output
2424 arc from mixer M3 labeled M3:89(64,45) in the figure. As in the case
2425 of mixers that are not cascaded, if the resulting CSRC list has more
2426 than 15 identifiers, the remainder cannot be included.
2427
2428 <span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. SSRC Identifier Allocation and Use</span>
2429
2430 The SSRC identifier carried in the RTP header and in various fields
2431 of RTCP packets is a random 32-bit number that is required to be
2432 globally unique within an RTP session. It is crucial that the number
2433 be chosen with care in order that participants on the same network or
2434 starting at the same time are not likely to choose the same number.
2435
2436 It is not sufficient to use the local network address (such as an
2437 IPv4 address) for the identifier because the address may not be
2438 unique. Since RTP translators and mixers enable interoperation among
2439 multiple networks with different address spaces, the allocation
2440 patterns for addresses within two spaces might result in a much
2441 higher rate of collision than would occur with random allocation.
2442
2443 Multiple sources running on one host would also conflict.
2444
2445 It is also not sufficient to obtain an SSRC identifier simply by
2446 calling random() without carefully initializing the state. An example
2447 of how to generate a random identifier is presented in <a href="#appendix-A.6">Appendix A.6</a>.
2448
2449 <span class="h3"><a class="selflink" id="section-8.1" href="#section-8.1">8.1</a> Probability of Collision</span>
2450
2451 Since the identifiers are chosen randomly, it is possible that two or
2452 more sources will choose the same number. Collision occurs with the
2453 highest probability when all sources are started simultaneously, for
2454 example when triggered automatically by some session management
2455 event. If N is the number of sources and L the length of the
2456 identifier (here, 32 bits), the probability that two sources
2457
2458
2459
2460 <span class="grey">Schulzrinne, et al Standards Track [Page 44]</span></pre>
2461 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-45" ></span>
2462 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2463
2464
2465 independently pick the same value can be approximated for large N
2466 [<a href="#ref-20" title="vol. 1. New York">20</a>] as 1 - exp(-N**2 / 2**(L+1)). For N=1000, the probability is
2467 roughly 10**-4.
2468
2469 The typical collision probability is much lower than the worst-case
2470 above. When one new source joins an RTP session in which all the
2471 other sources already have unique identifiers, the probability of
2472 collision is just the fraction of numbers used out of the space.
2473 Again, if N is the number of sources and L the length of the
2474 identifier, the probability of collision is N / 2**L. For N=1000, the
2475 probability is roughly 2*10**-7.
2476
2477 The probability of collision is further reduced by the opportunity
2478 for a new source to receive packets from other participants before
2479 sending its first packet (either data or control). If the new source
2480 keeps track of the other participants (by SSRC identifier), then
2481 before transmitting its first packet the new source can verify that
2482 its identifier does not conflict with any that have been received, or
2483 else choose again.
2484
2485 <span class="h3"><a class="selflink" id="section-8.2" href="#section-8.2">8.2</a> Collision Resolution and Loop Detection</span>
2486
2487 Although the probability of SSRC identifier collision is low, all RTP
2488 implementations must be prepared to detect collisions and take the
2489 appropriate actions to resolve them. If a source discovers at any
2490 time that another source is using the same SSRC identifier as its
2491 own, it must send an RTCP BYE packet for the old identifier and
2492 choose another random one. If a receiver discovers that two other
2493 sources are colliding, it may keep the packets from one and discard
2494 the packets from the other when this can be detected by different
2495 source transport addresses or CNAMEs. The two sources are expected to
2496 resolve the collision so that the situation doesn't last.
2497
2498 Because the random identifiers are kept globally unique for each RTP
2499 session, they can also be used to detect loops that may be introduced
2500 by mixers or translators. A loop causes duplication of data and
2501 control information, either unmodified or possibly mixed, as in the
2502 following examples:
2503
2504 o A translator may incorrectly forward a packet to the same
2505 multicast group from which it has received the packet, either
2506 directly or through a chain of translators. In that case, the
2507 same packet appears several times, originating from different
2508 network sources.
2509
2510 o Two translators incorrectly set up in parallel, i.e., with the
2511 same multicast groups on both sides, would both forward packets
2512 from one multicast group to the other. Unidirectional
2513
2514
2515
2516 <span class="grey">Schulzrinne, et al Standards Track [Page 45]</span></pre>
2517 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-46" ></span>
2518 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2519
2520
2521 translators would produce two copies; bidirectional translators
2522 would form a loop.
2523
2524 o A mixer can close a loop by sending to the same transport
2525 destination upon which it receives packets, either directly or
2526 through another mixer or translator. In this case a source
2527 might show up both as an SSRC on a data packet and a CSRC in a
2528 mixed data packet.
2529
2530 A source may discover that its own packets are being looped, or that
2531 packets from another source are being looped (a third-party loop).
2532
2533 Both loops and collisions in the random selection of a source
2534 identifier result in packets arriving with the same SSRC identifier
2535 but a different source transport address, which may be that of the
2536 end system originating the packet or an intermediate system.
2537 Consequently, if a source changes its source transport address, it
2538 must also choose a new SSRC identifier to avoid being interpreted as
2539 a looped source. Loops or collisions occurring on the far side of a
2540 translator or mixer cannot be detected using the source transport
2541 address if all copies of the packets go through the translator or
2542 mixer, however collisions may still be detected when chunks from two
2543 RTCP SDES packets contain the same SSRC identifier but different
2544 CNAMEs.
2545
2546 To detect and resolve these conflicts, an RTP implementation must
2547 include an algorithm similar to the one described below. It ignores
2548 packets from a new source or loop that collide with an established
2549 source. It resolves collisions with the participant's own SSRC
2550 identifier by sending an RTCP BYE for the old identifier and choosing
2551 a new one. However, when the collision was induced by a loop of the
2552 participant's own packets, the algorithm will choose a new identifier
2553 only once and thereafter ignore packets from the looping source
2554 transport address. This is required to avoid a flood of BYE packets.
2555
2556 This algorithm depends upon the source transport address being the
2557 same for both RTP and RTCP packets from a source. The algorithm would
2558 require modifications to support applications that don't meet this
2559 constraint.
2560
2561 This algorithm requires keeping a table indexed by source identifiers
2562 and containing the source transport address from which the identifier
2563 was (first) received, along with other state for that source. Each
2564 SSRC or CSRC identifier received in a data or control packet is
2565 looked up in this table in order to process that data or control
2566 information. For control packets, each element with its own SSRC,
2567 for example an SDES chunk, requires a separate lookup. (The SSRC in a
2568 reception report block is an exception.) If the SSRC or CSRC is not
2569
2570
2571
2572 <span class="grey">Schulzrinne, et al Standards Track [Page 46]</span></pre>
2573 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-47" ></span>
2574 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2575
2576
2577 found, a new entry is created. These table entries are removed when
2578 an RTCP BYE packet is received with the corresponding SSRC, or after
2579 no packets have arrived for a relatively long time (see <a href="#section-6.2.1">Section</a>
2580 <a href="#section-6.2.1">6.2.1</a>).
2581
2582 In order to track loops of the participant's own data packets, it is
2583 also necessary to keep a separate list of source transport addresses
2584 (not identifiers) that have been found to be conflicting. Note that
2585 this should be a short list, usually empty. Each element in this list
2586 stores the source address plus the time when the most recent
2587 conflicting packet was received. An element may be removed from the
2588 list when no conflicting packet has arrived from that source for a
2589 time on the order of 10 RTCP report intervals (see <a href="#section-6.2">Section 6.2</a>).
2590
2591 For the algorithm as shown, it is assumed that the participant's own
2592 source identifier and state are included in the source identifier
2593 table. The algorithm could be restructured to first make a separate
2594 comparison against the participant's own source identifier.
2595
2596 IF the SSRC or CSRC identifier is not found in the source
2597 identifier table:
2598 THEN create a new entry storing the source transport address
2599 and the SSRC or CSRC along with other state.
2600 CONTINUE with normal processing.
2601
2602 (identifier is found in the table)
2603
2604 IF the source transport address from the packet matches
2605 the one saved in the table entry for this identifier:
2606 THEN CONTINUE with normal processing.
2607
2608 (an identifier collision or a loop is indicated)
2609
2610 IF the source identifier is not the participant's own:
2611 THEN IF the source identifier is from an RTCP SDES chunk
2612 containing a CNAME item that differs from the CNAME
2613 in the table entry:
2614 THEN (optionally) count a third-party collision.
2615 ELSE (optionally) count a third-party loop.
2616 ABORT processing of data packet or control element.
2617
2618 (a collision or loop of the participant's own data)
2619
2620 IF the source transport address is found in the list of
2621 conflicting addresses:
2622 THEN IF the source identifier is not from an RTCP SDES chunk
2623 containing a CNAME item OR if that CNAME is the
2624 participant's own:
2625
2626
2627
2628 <span class="grey">Schulzrinne, et al Standards Track [Page 47]</span></pre>
2629 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-48" ></span>
2630 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2631
2632
2633 THEN (optionally) count occurrence of own traffic looped.
2634 mark current time in conflicting address list entry.
2635 ABORT processing of data packet or control element.
2636 log occurrence of a collision.
2637 create a new entry in the conflicting address list and
2638 mark current time.
2639 send an RTCP BYE packet with the old SSRC identifier.
2640 choose a new identifier.
2641 create a new entry in the source identifier table with the
2642 old SSRC plus the source transport address from the packet
2643 being processed.
2644 CONTINUE with normal processing.
2645
2646 In this algorithm, packets from a newly conflicting source address
2647 will be ignored and packets from the original source will be kept.
2648 (If the original source was through a mixer and later the same source
2649 is received directly, the receiver may be well advised to switch
2650 unless other sources in the mix would be lost.) If no packets arrive
2651 from the original source for an extended period, the table entry will
2652 be timed out and the new source will be able to take over. This might
2653 occur if the original source detects the collision and moves to a new
2654 source identifier, but in the usual case an RTCP BYE packet will be
2655 received from the original source to delete the state without having
2656 to wait for a timeout.
2657
2658 When a new SSRC identifier is chosen due to a collision, the
2659 candidate identifier should first be looked up in the source
2660 identifier table to see if it was already in use by some other
2661 source. If so, another candidate should be generated and the process
2662 repeated.
2663
2664 A loop of data packets to a multicast destination can cause severe
2665 network flooding. All mixers and translators are required to
2666 implement a loop detection algorithm like the one here so that they
2667 can break loops. This should limit the excess traffic to no more than
2668 one duplicate copy of the original traffic, which may allow the
2669 session to continue so that the cause of the loop can be found and
2670 fixed. However, in extreme cases where a mixer or translator does not
2671 properly break the loop and high traffic levels result, it may be
2672 necessary for end systems to cease transmitting data or control
2673 packets entirely. This decision may depend upon the application. An
2674 error condition should be indicated as appropriate. Transmission
2675 might be attempted again periodically after a long, random time (on
2676 the order of minutes).
2677
2678
2679
2680
2681
2682
2683
2684 <span class="grey">Schulzrinne, et al Standards Track [Page 48]</span></pre>
2685 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-49" ></span>
2686 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2687
2688
2689 <span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. Security</span>
2690
2691 Lower layer protocols may eventually provide all the security
2692 services that may be desired for applications of RTP, including
2693 authentication, integrity, and confidentiality. These services have
2694 recently been specified for IP. Since the need for a confidentiality
2695 service is well established in the initial audio and video
2696 applications that are expected to use RTP, a confidentiality service
2697 is defined in the next section for use with RTP and RTCP until lower
2698 layer services are available. The overhead on the protocol for this
2699 service is low, so the penalty will be minimal if this service is
2700 obsoleted by lower layer services in the future.
2701
2702 Alternatively, other services, other implementations of services and
2703 other algorithms may be defined for RTP in the future if warranted.
2704 The selection presented here is meant to simplify implementation of
2705 interoperable, secure applications and provide guidance to
2706 implementors. No claim is made that the methods presented here are
2707 appropriate for a particular security need. A profile may specify
2708 which services and algorithms should be offered by applications, and
2709 may provide guidance as to their appropriate use.
2710
2711 Key distribution and certificates are outside the scope of this
2712 document.
2713
2714 <span class="h3"><a class="selflink" id="section-9.1" href="#section-9.1">9.1</a> Confidentiality</span>
2715
2716 Confidentiality means that only the intended receiver(s) can decode
2717 the received packets; for others, the packet contains no useful
2718 information. Confidentiality of the content is achieved by
2719 encryption.
2720
2721 When encryption of RTP or RTCP is desired, all the octets that will
2722 be encapsulated for transmission in a single lower-layer packet are
2723 encrypted as a unit. For RTCP, a 32-bit random number is prepended to
2724 the unit before encryption to deter known plaintext attacks. For RTP,
2725 no prefix is required because the sequence number and timestamp
2726 fields are initialized with random offsets.
2727
2728 For RTCP, it is allowed to split a compound RTCP packet into two
2729 lower-layer packets, one to be encrypted and one to be sent in the
2730 clear. For example, SDES information might be encrypted while
2731 reception reports were sent in the clear to accommodate third-party
2732 monitors that are not privy to the encryption key. In this example,
2733 depicted in Fig. 4, the SDES information must be appended to an RR
2734 packet with no reports (and the encrypted) to satisfy the requirement
2735 that all compound RTCP packets begin with an SR or RR packet.
2736
2737
2738
2739
2740 <span class="grey">Schulzrinne, et al Standards Track [Page 49]</span></pre>
2741 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-50" ></span>
2742 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2743
2744
2745 UDP packet UDP packet
2746 ------------------------------------- -------------------------
2747 [32-bit ][ ][ # ] [ # sender # receiver]
2748 [random ][ RR ][SDES # CNAME, ...] [ SR # report # report ]
2749 [integer][(empty)][ # ] [ # # ]
2750 ------------------------------------- -------------------------
2751 encrypted not encrypted
2752
2753 #: SSRC
2754
2755 Figure 4: Encrypted and non-encrypted RTCP packets
2756
2757 The presence of encryption and the use of the correct key are
2758 confirmed by the receiver through header or payload validity checks.
2759 Examples of such validity checks for RTP and RTCP headers are given
2760 in Appendices A.1 and A.2.
2761
2762 The default encryption algorithm is the Data Encryption Standard
2763 (DES) algorithm in cipher block chaining (CBC) mode, as described in
2764 <a href="./rfc1423#section-1.1">Section&nbsp;1.1 of RFC 1423</a> [<a href="#ref-21" title="&quot;Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers&quot;">21</a>], except that padding to a multiple of 8
2765 octets is indicated as described for the P bit in <a href="#section-5.1">Section 5.1</a>. The
2766 initialization vector is zero because random values are supplied in
2767 the RTP header or by the random prefix for compound RTCP packets. For
2768 details on the use of CBC initialization vectors, see [<a href="#ref-22" title="&quot;Security mechanisms in high-level network protocols,&quot;">22</a>].
2769 Implementations that support encryption should always support the DES
2770 algorithm in CBC mode as the default to maximize interoperability.
2771 This method is chosen because it has been demonstrated to be easy and
2772 practical to use in experimental audio and video tools in operation
2773 on the Internet. Other encryption algorithms may be specified
2774 dynamically for a session by non-RTP means.
2775
2776 As an alternative to encryption at the RTP level as described above,
2777 profiles may define additional payload types for encrypted encodings.
2778 Those encodings must specify how padding and other aspects of the
2779 encryption should be handled. This method allows encrypting only the
2780 data while leaving the headers in the clear for applications where
2781 that is desired. It may be particularly useful for hardware devices
2782 that will handle both decryption and decoding.
2783
2784 <span class="h3"><a class="selflink" id="section-9.2" href="#section-9.2">9.2</a> Authentication and Message Integrity</span>
2785
2786 Authentication and message integrity are not defined in the current
2787 specification of RTP since these services would not be directly
2788 feasible without a key management infrastructure. It is expected that
2789 authentication and integrity services will be provided by lower layer
2790 protocols in the future.
2791
2792
2793
2794
2795
2796 <span class="grey">Schulzrinne, et al Standards Track [Page 50]</span></pre>
2797 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-51" ></span>
2798 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2799
2800
2801 <span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. RTP over Network and Transport Protocols</span>
2802
2803 This section describes issues specific to carrying RTP packets within
2804 particular network and transport protocols. The following rules apply
2805 unless superseded by protocol-specific definitions outside this
2806 specification.
2807
2808 RTP relies on the underlying protocol(s) to provide demultiplexing of
2809 RTP data and RTCP control streams. For UDP and similar protocols, RTP
2810 uses an even port number and the corresponding RTCP stream uses the
2811 next higher (odd) port number. If an application is supplied with an
2812 odd number for use as the RTP port, it should replace this number
2813 with the next lower (even) number.
2814
2815 RTP data packets contain no length field or other delineation,
2816 therefore RTP relies on the underlying protocol(s) to provide a
2817 length indication. The maximum length of RTP packets is limited only
2818 by the underlying protocols.
2819
2820 If RTP packets are to be carried in an underlying protocol that
2821 provides the abstraction of a continuous octet stream rather than
2822 messages (packets), an encapsulation of the RTP packets must be
2823 defined to provide a framing mechanism. Framing is also needed if the
2824 underlying protocol may contain padding so that the extent of the RTP
2825 payload cannot be determined. The framing mechanism is not defined
2826 here.
2827
2828 A profile may specify a framing method to be used even when RTP is
2829 carried in protocols that do provide framing in order to allow
2830 carrying several RTP packets in one lower-layer protocol data unit,
2831 such as a UDP packet. Carrying several RTP packets in one network or
2832 transport packet reduces header overhead and may simplify
2833 synchronization between different streams.
2834
2835 <span class="h2"><a class="selflink" id="section-11" href="#section-11">11</a>. Summary of Protocol Constants</span>
2836
2837 This section contains a summary listing of the constants defined in
2838 this specification.
2839
2840 The RTP payload type (PT) constants are defined in profiles rather
2841 than this document. However, the octet of the RTP header which
2842 contains the marker bit(s) and payload type must avoid the reserved
2843 values 200 and 201 (decimal) to distinguish RTP packets from the RTCP
2844 SR and RR packet types for the header validation procedure described
2845 in <a href="#appendix-A.1">Appendix A.1</a>. For the standard definition of one marker bit and a
2846 7-bit payload type field as shown in this specification, this
2847 restriction means that payload types 72 and 73 are reserved.
2848
2849
2850
2851
2852 <span class="grey">Schulzrinne, et al Standards Track [Page 51]</span></pre>
2853 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-52" ></span>
2854 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2855
2856
2857 <span class="h3"><a class="selflink" id="section-11.1" href="#section-11.1">11.1</a> RTCP packet types</span>
2858
2859 abbrev. name value
2860 SR sender report 200
2861 RR receiver report 201
2862 SDES source description 202
2863 BYE goodbye 203
2864 APP application-defined 204
2865
2866 These type values were chosen in the range 200-204 for improved
2867 header validity checking of RTCP packets compared to RTP packets or
2868 other unrelated packets. When the RTCP packet type field is compared
2869 to the corresponding octet of the RTP header, this range corresponds
2870 to the marker bit being 1 (which it usually is not in data packets)
2871 and to the high bit of the standard payload type field being 1 (since
2872 the static payload types are typically defined in the low half). This
2873 range was also chosen to be some distance numerically from 0 and 255
2874 since all-zeros and all-ones are common data patterns.
2875
2876 Since all compound RTCP packets must begin with SR or RR, these codes
2877 were chosen as an even/odd pair to allow the RTCP validity check to
2878 test the maximum number of bits with mask and value.
2879
2880 Other constants are assigned by IANA. Experimenters are encouraged to
2881 register the numbers they need for experiments, and then unregister
2882 those which prove to be unneeded.
2883
2884 <span class="h3"><a class="selflink" id="section-11.2" href="#section-11.2">11.2</a> SDES types</span>
2885
2886 abbrev. name value
2887 END end of SDES list 0
2888 CNAME canonical name 1
2889 NAME user name 2
2890 EMAIL user's electronic mail address 3
2891 PHONE user's phone number 4
2892 LOC geographic user location 5
2893 TOOL name of application or tool 6
2894 NOTE notice about the source 7
2895 PRIV private extensions 8
2896
2897 Other constants are assigned by IANA. Experimenters are encouraged to
2898 register the numbers they need for experiments, and then unregister
2899 those which prove to be unneeded.
2900
2901
2902
2903
2904
2905
2906
2907
2908 <span class="grey">Schulzrinne, et al Standards Track [Page 52]</span></pre>
2909 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-53" ></span>
2910 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2911
2912
2913 <span class="h2"><a class="selflink" id="section-12" href="#section-12">12</a>. RTP Profiles and Payload Format Specifications</span>
2914
2915 A complete specification of RTP for a particular application will
2916 require one or more companion documents of two types described here:
2917 profiles, and payload format specifications.
2918
2919 RTP may be used for a variety of applications with somewhat differing
2920 requirements. The flexibility to adapt to those requirements is
2921 provided by allowing multiple choices in the main protocol
2922 specification, then selecting the appropriate choices or defining
2923 extensions for a particular environment and class of applications in
2924 a separate profile document. Typically an application will operate
2925 under only one profile so there is no explicit indication of which
2926 profile is in use. A profile for audio and video applications may be
2927 found in the companion Internet-Draft <a href="./draft-ietf-avt-profile">draft-ietf-avt-profile</a> for
2928
2929 The second type of companion document is a payload format
2930 specification, which defines how a particular kind of payload data,
2931 such as H.261 encoded video, should be carried in RTP. These
2932 documents are typically titled "RTP Payload Format for XYZ
2933 Audio/Video Encoding". Payload formats may be useful under multiple
2934 profiles and may therefore be defined independently of any particular
2935 profile. The profile documents are then responsible for assigning a
2936 default mapping of that format to a payload type value if needed.
2937
2938 Within this specification, the following items have been identified
2939 for possible definition within a profile, but this list is not meant
2940 to be exhaustive:
2941
2942 RTP data header: The octet in the RTP data header that contains the
2943 marker bit and payload type field may be redefined by a profile
2944 to suit different requirements, for example with more or fewer
2945 marker bits (<a href="#section-5.3">Section 5.3</a>).
2946
2947 Payload types: Assuming that a payload type field is included, the
2948 profile will usually define a set of payload formats (e.g.,
2949 media encodings) and a default static mapping of those formats
2950 to payload type values. Some of the payload formats may be
2951 defined by reference to separate payload format specifications.
2952 For each payload type defined, the profile must specify the RTP
2953 timestamp clock rate to be used (<a href="#section-5.1">Section 5.1</a>).
2954
2955 RTP data header additions: Additional fields may be appended to the
2956 fixed RTP data header if some additional functionality is
2957 required across the profile's class of applications independent
2958 of payload type (<a href="#section-5.3">Section 5.3</a>).
2959
2960
2961
2962
2963
2964 <span class="grey">Schulzrinne, et al Standards Track [Page 53]</span></pre>
2965 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-54" ></span>
2966 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
2967
2968
2969 RTP data header extensions: The contents of the first 16 bits of the
2970 RTP data header extension structure must be defined if use of
2971 that mechanism is to be allowed under the profile for
2972 implementation-specific extensions (<a href="#section-5.3.1">Section 5.3.1</a>).
2973
2974 RTCP packet types: New application-class-specific RTCP packet types
2975 may be defined and registered with IANA.
2976
2977 RTCP report interval: A profile should specify that the values
2978 suggested in <a href="#section-6.2">Section 6.2</a> for the constants employed in the
2979 calculation of the RTCP report interval will be used. Those are
2980 the RTCP fraction of session bandwidth, the minimum report
2981 interval, and the bandwidth split between senders and receivers.
2982 A profile may specify alternate values if they have been
2983 demonstrated to work in a scalable manner.
2984
2985 SR/RR extension: An extension section may be defined for the RTCP SR
2986 and RR packets if there is additional information that should be
2987 reported regularly about the sender or receivers (<a href="#section-6.3.3">Section 6.3.3</a>).
2988
2989 SDES use: The profile may specify the relative priorities for RTCP
2990 SDES items to be transmitted or excluded entirely (<a href="#section-6.2.2">Section</a>
2991 <a href="#section-6.2.2">6.2.2</a>); an alternate syntax or semantics for the CNAME item
2992 (<a href="#section-6.4.1">Section 6.4.1</a>); the format of the LOC item (<a href="#section-6.4.5">Section 6.4.5</a>); the
2993 semantics and use of the NOTE item (<a href="#section-6.4.7">Section 6.4.7</a>); or new SDES
2994 item types to be registered with IANA.
2995
2996 Security: A profile may specify which security services and
2997 algorithms should be offered by applications, and may provide
2998 guidance as to their appropriate use (<a href="#section-9">Section 9</a>).
2999
3000 String-to-key mapping: A profile may specify how a user-provided
3001 password or pass phrase is mapped into an encryption key.
3002
3003 Underlying protocol: Use of a particular underlying network or
3004 transport layer protocol to carry RTP packets may be required.
3005
3006 Transport mapping: A mapping of RTP and RTCP to transport-level
3007 addresses, e.g., UDP ports, other than the standard mapping
3008 defined in <a href="#section-10">Section 10</a> may be specified.
3009
3010 Encapsulation: An encapsulation of RTP packets may be defined to
3011 allow multiple RTP data packets to be carried in one lower-layer
3012 packet or to provide framing over underlying protocols that do
3013 not already do so (<a href="#section-10">Section 10</a>).
3014
3015
3016
3017
3018
3019
3020 <span class="grey">Schulzrinne, et al Standards Track [Page 54]</span></pre>
3021 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-55" ></span>
3022 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3023
3024
3025 It is not expected that a new profile will be required for every
3026 application. Within one application class, it would be better to
3027 extend an existing profile rather than make a new one in order to
3028 facilitate interoperation among the applications since each will
3029 typically run under only one profile. Simple extensions such as the
3030 definition of additional payload type values or RTCP packet types may
3031 be accomplished by registering them through the Internet Assigned
3032 Numbers Authority and publishing their descriptions in an addendum to
3033 the profile or in a payload format specification.
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076 <span class="grey">Schulzrinne, et al Standards Track [Page 55]</span></pre>
3077 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-56" ></span>
3078 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3079
3080
3081 <span class="h2"><a class="selflink" id="appendix-A" href="#appendix-A">A</a>. Algorithms</span>
3082
3083 We provide examples of C code for aspects of RTP sender and receiver
3084 algorithms. There may be other implementation methods that are faster
3085 in particular operating environments or have other advantages. These
3086 implementation notes are for informational purposes only and are
3087 meant to clarify the RTP specification.
3088
3089 The following definitions are used for all examples; for clarity and
3090 brevity, the structure definitions are only valid for 32-bit big-
3091 endian (most significant octet first) architectures. Bit fields are
3092 assumed to be packed tightly in big-endian bit order, with no
3093 additional padding. Modifications would be required to construct a
3094 portable implementation.
3095
3096 /*
3097 * rtp.h -- RTP header file (RFC XXXX)
3098 */
3099 #include &lt;sys/types.h&gt;
3100
3101 /*
3102 * The type definitions below are valid for 32-bit architectures and
3103 * may have to be adjusted for 16- or 64-bit architectures.
3104 */
3105 typedef unsigned char u_int8;
3106 typedef unsigned short u_int16;
3107 typedef unsigned int u_int32;
3108 typedef short int16;
3109
3110 /*
3111 * Current protocol version.
3112 */
3113 #define RTP_VERSION 2
3114
3115 #define RTP_SEQ_MOD (1&lt;&lt;16)
3116 #define RTP_MAX_SDES 255 /* maximum text length for SDES */
3117
3118 typedef enum {
3119 RTCP_SR = 200,
3120 RTCP_RR = 201,
3121 RTCP_SDES = 202,
3122 RTCP_BYE = 203,
3123 RTCP_APP = 204
3124 } rtcp_type_t;
3125
3126 typedef enum {
3127 RTCP_SDES_END = 0,
3128 RTCP_SDES_CNAME = 1,
3129
3130
3131
3132 <span class="grey">Schulzrinne, et al Standards Track [Page 56]</span></pre>
3133 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-57" ></span>
3134 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3135
3136
3137 RTCP_SDES_NAME = 2,
3138 RTCP_SDES_EMAIL = 3,
3139 RTCP_SDES_PHONE = 4,
3140 RTCP_SDES_LOC = 5,
3141 RTCP_SDES_TOOL = 6,
3142 RTCP_SDES_NOTE = 7,
3143 RTCP_SDES_PRIV = 8
3144 } rtcp_sdes_type_t;
3145
3146 /*
3147 * RTP data header
3148 */
3149 typedef struct {
3150 unsigned int version:2; /* protocol version */
3151 unsigned int p:1; /* padding flag */
3152 unsigned int x:1; /* header extension flag */
3153 unsigned int cc:4; /* CSRC count */
3154 unsigned int m:1; /* marker bit */
3155 unsigned int pt:7; /* payload type */
3156 u_int16 seq; /* sequence number */
3157 u_int32 ts; /* timestamp */
3158 u_int32 ssrc; /* synchronization source */
3159 u_int32 csrc[1]; /* optional CSRC list */
3160 } rtp_hdr_t;
3161
3162 /*
3163 * RTCP common header word
3164 */
3165 typedef struct {
3166 unsigned int version:2; /* protocol version */
3167 unsigned int p:1; /* padding flag */
3168 unsigned int count:5; /* varies by packet type */
3169 unsigned int pt:8; /* RTCP packet type */
3170 u_int16 length; /* pkt len in words, w/o this word */
3171 } rtcp_common_t;
3172
3173 /*
3174 * Big-endian mask for version, padding bit and packet type pair
3175 */
3176 #define RTCP_VALID_MASK (0xc000 | 0x2000 | 0xfe)
3177 #define RTCP_VALID_VALUE ((RTP_VERSION &lt;&lt; 14) | RTCP_SR)
3178
3179 /*
3180 * Reception report block
3181 */
3182 typedef struct {
3183 u_int32 ssrc; /* data source being reported */
3184 unsigned int fraction:8; /* fraction lost since last SR/RR */
3185
3186
3187
3188 <span class="grey">Schulzrinne, et al Standards Track [Page 57]</span></pre>
3189 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-58" ></span>
3190 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3191
3192
3193 int lost:24; /* cumul. no. pkts lost (signed!) */
3194 u_int32 last_seq; /* extended last seq. no. received */
3195 u_int32 jitter; /* interarrival jitter */
3196 u_int32 lsr; /* last SR packet from this source */
3197 u_int32 dlsr; /* delay since last SR packet */
3198 } rtcp_rr_t;
3199
3200 /*
3201 * SDES item
3202 */
3203 typedef struct {
3204 u_int8 type; /* type of item (rtcp_sdes_type_t) */
3205 u_int8 length; /* length of item (in octets) */
3206 char data[1]; /* text, not null-terminated */
3207 } rtcp_sdes_item_t;
3208
3209 /*
3210 * One RTCP packet
3211 */
3212 typedef struct {
3213 rtcp_common_t common; /* common header */
3214 union {
3215 /* sender report (SR) */
3216 struct {
3217 u_int32 ssrc; /* sender generating this report */
3218 u_int32 ntp_sec; /* NTP timestamp */
3219 u_int32 ntp_frac;
3220 u_int32 rtp_ts; /* RTP timestamp */
3221 u_int32 psent; /* packets sent */
3222 u_int32 osent; /* octets sent */
3223 rtcp_rr_t rr[1]; /* variable-length list */
3224 } sr;
3225
3226 /* reception report (RR) */
3227 struct {
3228 u_int32 ssrc; /* receiver generating this report */
3229 rtcp_rr_t rr[1]; /* variable-length list */
3230 } rr;
3231
3232 /* source description (SDES) */
3233 struct rtcp_sdes {
3234 u_int32 src; /* first SSRC/CSRC */
3235 rtcp_sdes_item_t item[1]; /* list of SDES items */
3236 } sdes;
3237
3238 /* BYE */
3239 struct {
3240 u_int32 src[1]; /* list of sources */
3241
3242
3243
3244 <span class="grey">Schulzrinne, et al Standards Track [Page 58]</span></pre>
3245 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-59" ></span>
3246 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3247
3248
3249 /* can't express trailing text for reason */
3250 } bye;
3251 } r;
3252 } rtcp_t;
3253
3254 typedef struct rtcp_sdes rtcp_sdes_t;
3255
3256 /*
3257 * Per-source state information
3258 */
3259 typedef struct {
3260 u_int16 max_seq; /* highest seq. number seen */
3261 u_int32 cycles; /* shifted count of seq. number cycles */
3262 u_int32 base_seq; /* base seq number */
3263 u_int32 bad_seq; /* last 'bad' seq number + 1 */
3264 u_int32 probation; /* sequ. packets till source is valid */
3265 u_int32 received; /* packets received */
3266 u_int32 expected_prior; /* packet expected at last interval */
3267 u_int32 received_prior; /* packet received at last interval */
3268 u_int32 transit; /* relative trans time for prev pkt */
3269 u_int32 jitter; /* estimated jitter */
3270 /* ... */
3271 } source;
3272
3273 <span class="h3"><a class="selflink" id="appendix-A.1" href="#appendix-A.1">A.1</a> RTP Data Header Validity Checks</span>
3274
3275 An RTP receiver should check the validity of the RTP header on
3276 incoming packets since they might be encrypted or might be from a
3277 different application that happens to be misaddressed. Similarly, if
3278 encryption is enabled, the header validity check is needed to verify
3279 that incoming packets have been correctly decrypted, although a
3280 failure of the header validity check (e.g., unknown payload type) may
3281 not necessarily indicate decryption failure.
3282
3283 Only weak validity checks are possible on an RTP data packet from a
3284 source that has not been heard before:
3285
3286 o RTP version field must equal 2.
3287
3288 o The payload type must be known, in particular it must not be
3289 equal to SR or RR.
3290
3291 o If the P bit is set, then the last octet of the packet must
3292 contain a valid octet count, in particular, less than the total
3293 packet length minus the header size.
3294
3295 o The X bit must be zero if the profile does not specify that
3296 the header extension mechanism may be used. Otherwise, the
3297
3298
3299
3300 <span class="grey">Schulzrinne, et al Standards Track [Page 59]</span></pre>
3301 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-60" ></span>
3302 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3303
3304
3305 extension length field must be less than the total packet size
3306 minus the fixed header length and padding.
3307
3308 o The length of the packet must be consistent with CC and
3309 payload type (if payloads have a known length).
3310
3311 The last three checks are somewhat complex and not always possible,
3312 leaving only the first two which total just a few bits. If the SSRC
3313 identifier in the packet is one that has been received before, then
3314 the packet is probably valid and checking if the sequence number is
3315 in the expected range provides further validation. If the SSRC
3316 identifier has not been seen before, then data packets carrying that
3317 identifier may be considered invalid until a small number of them
3318 arrive with consecutive sequence numbers.
3319
3320 The routine update_seq shown below ensures that a source is declared
3321 valid only after MIN_SEQUENTIAL packets have been received in
3322 sequence. It also validates the sequence number seq of a newly
3323 received packet and updates the sequence state for the packet's
3324 source in the structure to which s points.
3325
3326 When a new source is heard for the first time, that is, its SSRC
3327 identifier is not in the table (see <a href="#section-8.2">Section 8.2</a>), and the per-source
3328 state is allocated for it, s-&gt;probation should be set to the number
3329 of sequential packets required before declaring a source valid
3330 (parameter MIN_SEQUENTIAL ) and s-&gt;max_seq initialized to seq-1 s-
3331 &gt;probation marks the source as not yet valid so the state may be
3332 discarded after a short timeout rather than a long one, as discussed
3333 in <a href="#section-6.2.1">Section 6.2.1</a>.
3334
3335 After a source is considered valid, the sequence number is considered
3336 valid if it is no more than MAX_DROPOUT ahead of s-&gt;max_seq nor more
3337 than MAX_MISORDER behind. If the new sequence number is ahead of
3338 max_seq modulo the RTP sequence number range (16 bits), but is
3339 smaller than max_seq , it has wrapped around and the (shifted) count
3340 of sequence number cycles is incremented. A value of one is returned
3341 to indicate a valid sequence number.
3342
3343 Otherwise, the value zero is returned to indicate that the validation
3344 failed, and the bad sequence number is stored. If the next packet
3345 received carries the next higher sequence number, it is considered
3346 the valid start of a new packet sequence presumably caused by an
3347 extended dropout or a source restart. Since multiple complete
3348 sequence number cycles may have been missed, the packet loss
3349 statistics are reset.
3350
3351 Typical values for the parameters are shown, based on a maximum
3352 misordering time of 2 seconds at 50 packets/second and a maximum
3353
3354
3355
3356 <span class="grey">Schulzrinne, et al Standards Track [Page 60]</span></pre>
3357 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-61" ></span>
3358 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3359
3360
3361 dropout of 1 minute. The dropout parameter MAX_DROPOUT should be a
3362 small fraction of the 16-bit sequence number space to give a
3363 reasonable probability that new sequence numbers after a restart will
3364 not fall in the acceptable range for sequence numbers from before the
3365 restart.
3366
3367 void init_seq(source *s, u_int16 seq)
3368 {
3369 s-&gt;base_seq = seq - 1;
3370 s-&gt;max_seq = seq;
3371 s-&gt;bad_seq = RTP_SEQ_MOD + 1;
3372 s-&gt;cycles = 0;
3373 s-&gt;received = 0;
3374 s-&gt;received_prior = 0;
3375 s-&gt;expected_prior = 0;
3376 /* other initialization */
3377 }
3378
3379 int update_seq(source *s, u_int16 seq)
3380 {
3381 u_int16 udelta = seq - s-&gt;max_seq;
3382 const int MAX_DROPOUT = 3000;
3383 const int MAX_MISORDER = 100;
3384 const int MIN_SEQUENTIAL = 2;
3385
3386 /*
3387 * Source is not valid until MIN_SEQUENTIAL packets with
3388 * sequential sequence numbers have been received.
3389 */
3390 if (s-&gt;probation) {
3391 /* packet is in sequence */
3392 if (seq == s-&gt;max_seq + 1) {
3393 s-&gt;probation--;
3394 s-&gt;max_seq = seq;
3395 if (s-&gt;probation == 0) {
3396 init_seq(s, seq);
3397 s-&gt;received++;
3398 return 1;
3399 }
3400 } else {
3401 s-&gt;probation = MIN_SEQUENTIAL - 1;
3402 s-&gt;max_seq = seq;
3403 }
3404 return 0;
3405 } else if (udelta &lt; MAX_DROPOUT) {
3406 /* in order, with permissible gap */
3407 if (seq &lt; s-&gt;max_seq) {
3408 /*
3409
3410
3411
3412 <span class="grey">Schulzrinne, et al Standards Track [Page 61]</span></pre>
3413 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-62" ></span>
3414 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3415
3416
3417 * Sequence number wrapped - count another 64K cycle.
3418 */
3419 s-&gt;cycles += RTP_SEQ_MOD;
3420 }
3421 s-&gt;max_seq = seq;
3422 } else if (udelta &lt;= RTP_SEQ_MOD - MAX_MISORDER) {
3423 /* the sequence number made a very large jump */
3424 if (seq == s-&gt;bad_seq) {
3425 /*
3426 * Two sequential packets -- assume that the other side
3427 * restarted without telling us so just re-sync
3428 * (i.e., pretend this was the first packet).
3429 */
3430 init_seq(s, seq);
3431 }
3432 else {
3433 s-&gt;bad_seq = (seq + 1) &amp; (RTP_SEQ_MOD-1);
3434 return 0;
3435 }
3436 } else {
3437 /* duplicate or reordered packet */
3438 }
3439 s-&gt;received++;
3440 return 1;
3441 }
3442
3443 The validity check can be made stronger requiring more than two
3444 packets in sequence. The disadvantages are that a larger number of
3445 initial packets will be discarded and that high packet loss rates
3446 could prevent validation. However, because the RTCP header validation
3447 is relatively strong, if an RTCP packet is received from a source
3448 before the data packets, the count could be adjusted so that only two
3449 packets are required in sequence. If initial data loss for a few
3450 seconds can be tolerated, an application could choose to discard all
3451 data packets from a source until a valid RTCP packet has been
3452 received from that source.
3453
3454 Depending on the application and encoding, algorithms may exploit
3455 additional knowledge about the payload format for further validation.
3456 For payload types where the timestamp increment is the same for all
3457 packets, the timestamp values can be predicted from the previous
3458 packet received from the same source using the sequence number
3459 difference (assuming no change in payload type).
3460
3461 A strong "fast-path" check is possible since with high probability
3462 the first four octets in the header of a newly received RTP data
3463 packet will be just the same as that of the previous packet from the
3464 same SSRC except that the sequence number will have increased by one.
3465
3466
3467
3468 <span class="grey">Schulzrinne, et al Standards Track [Page 62]</span></pre>
3469 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-63" ></span>
3470 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3471
3472
3473 Similarly, a single-entry cache may be used for faster SSRC lookups
3474 in applications where data is typically received from one source at a
3475 time.
3476
3477 <span class="h3"><a class="selflink" id="appendix-A.2" href="#appendix-A.2">A.2</a> RTCP Header Validity Checks</span>
3478
3479 The following checks can be applied to RTCP packets.
3480
3481 o RTP version field must equal 2.
3482
3483 o The payload type field of the first RTCP packet in a compound
3484 packet must be equal to SR or RR.
3485
3486 o The padding bit (P) should be zero for the first packet of a
3487 compound RTCP packet because only the last should possibly need
3488 padding.
3489
3490 o The length fields of the individual RTCP packets must total to
3491 the overall length of the compound RTCP packet as received.
3492 This is a fairly strong check.
3493
3494 The code fragment below performs all of these checks. The packet type
3495 is not checked for subsequent packets since unknown packet types may
3496 be present and should be ignored.
3497
3498 u_int32 len; /* length of compound RTCP packet in words */
3499 rtcp_t *r; /* RTCP header */
3500 rtcp_t *end; /* end of compound RTCP packet */
3501
3502 if ((*(u_int16 *)r &amp; RTCP_VALID_MASK) != RTCP_VALID_VALUE) {
3503 /* something wrong with packet format */
3504 }
3505 end = (rtcp_t *)((u_int32 *)r + len);
3506
3507 do r = (rtcp_t *)((u_int32 *)r + r-&gt;common.length + 1);
3508 while (r &lt; end &amp;&amp; r-&gt;common.version == 2);
3509
3510 if (r != end) {
3511 /* something wrong with packet format */
3512 }
3513
3514 <span class="h3"><a class="selflink" id="appendix-A.3" href="#appendix-A.3">A.3</a> Determining the Number of RTP Packets Expected and Lost</span>
3515
3516 In order to compute packet loss rates, the number of packets expected
3517 and actually received from each source needs to be known, using per-
3518 source state information defined in struct source referenced via
3519 pointer s in the code below. The number of packets received is simply
3520 the count of packets as they arrive, including any late or duplicate
3521
3522
3523
3524 <span class="grey">Schulzrinne, et al Standards Track [Page 63]</span></pre>
3525 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-64" ></span>
3526 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3527
3528
3529 packets. The number of packets expected can be computed by the
3530 receiver as the difference between the highest sequence number
3531 received ( s-&gt;max_seq ) and the first sequence number received ( s-
3532 &gt;base_seq ). Since the sequence number is only 16 bits and will wrap
3533 around, it is necessary to extend the highest sequence number with
3534 the (shifted) count of sequence number wraparounds ( s-&gt;cycles ).
3535 Both the received packet count and the count of cycles are maintained
3536 the RTP header validity check routine in <a href="#appendix-A.1">Appendix A.1</a>.
3537
3538 extended_max = s-&gt;cycles + s-&gt;max_seq;
3539 expected = extended_max - s-&gt;base_seq + 1;
3540
3541 The number of packets lost is defined to be the number of packets
3542 expected less the number of packets actually received:
3543
3544 lost = expected - s-&gt;received;
3545
3546 Since this number is carried in 24 bits, it should be clamped at
3547 0xffffff rather than wrap around to zero.
3548
3549 The fraction of packets lost during the last reporting interval
3550 (since the previous SR or RR packet was sent) is calculated from
3551 differences in the expected and received packet counts across the
3552 interval, where expected_prior and received_prior are the values
3553 saved when the previous reception report was generated:
3554
3555 expected_interval = expected - s-&gt;expected_prior;
3556 s-&gt;expected_prior = expected;
3557 received_interval = s-&gt;received - s-&gt;received_prior;
3558 s-&gt;received_prior = s-&gt;received;
3559 lost_interval = expected_interval - received_interval;
3560 if (expected_interval == 0 || lost_interval &lt;= 0) fraction = 0;
3561 else fraction = (lost_interval &lt;&lt; 8) / expected_interval;
3562
3563 The resulting fraction is an 8-bit fixed point number with the binary
3564 point at the left edge.
3565
3566 <span class="h3"><a class="selflink" id="appendix-A.4" href="#appendix-A.4">A.4</a> Generating SDES RTCP Packets</span>
3567
3568 This function builds one SDES chunk into buffer b composed of argc
3569 items supplied in arrays type , value and length b
3570
3571 char *rtp_write_sdes(char *b, u_int32 src, int argc,
3572 rtcp_sdes_type_t type[], char *value[],
3573 int length[])
3574 {
3575 rtcp_sdes_t *s = (rtcp_sdes_t *)b;
3576 rtcp_sdes_item_t *rsp;
3577
3578
3579
3580 <span class="grey">Schulzrinne, et al Standards Track [Page 64]</span></pre>
3581 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-65" ></span>
3582 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3583
3584
3585 int i;
3586 int len;
3587 int pad;
3588
3589 /* SSRC header */
3590 s-&gt;src = src;
3591 rsp = &amp;s-&gt;item[0];
3592
3593 /* SDES items */
3594 for (i = 0; i &lt; argc; i++) {
3595 rsp-&gt;type = type[i];
3596 len = length[i];
3597 if (len &gt; RTP_MAX_SDES) {
3598 /* invalid length, may want to take other action */
3599 len = RTP_MAX_SDES;
3600 }
3601 rsp-&gt;length = len;
3602 memcpy(rsp-&gt;data, value[i], len);
3603 rsp = (rtcp_sdes_item_t *)&amp;rsp-&gt;data[len];
3604 }
3605
3606 /* terminate with end marker and pad to next 4-octet boundary */
3607 len = ((char *) rsp) - b;
3608 pad = 4 - (len &amp; 0x3);
3609 b = (char *) rsp;
3610 while (pad--) *b++ = RTCP_SDES_END;
3611
3612 return b;
3613 }
3614
3615 <span class="h3"><a class="selflink" id="appendix-A.5" href="#appendix-A.5">A.5</a> Parsing RTCP SDES Packets</span>
3616
3617 This function parses an SDES packet, calling functions find_member()
3618 to find a pointer to the information for a session member given the
3619 SSRC identifier and member_sdes() to store the new SDES information
3620 for that member. This function expects a pointer to the header of the
3621 RTCP packet.
3622
3623 void rtp_read_sdes(rtcp_t *r)
3624 {
3625 int count = r-&gt;common.count;
3626 rtcp_sdes_t *sd = &amp;r-&gt;r.sdes;
3627 rtcp_sdes_item_t *rsp, *rspn;
3628 rtcp_sdes_item_t *end = (rtcp_sdes_item_t *)
3629 ((u_int32 *)r + r-&gt;common.length + 1);
3630 source *s;
3631
3632 while (--count &gt;= 0) {
3633
3634
3635
3636 <span class="grey">Schulzrinne, et al Standards Track [Page 65]</span></pre>
3637 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-66" ></span>
3638 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3639
3640
3641 rsp = &amp;sd-&gt;item[0];
3642 if (rsp &gt;= end) break;
3643 s = find_member(sd-&gt;src);
3644
3645 for (; rsp-&gt;type; rsp = rspn ) {
3646 rspn = (rtcp_sdes_item_t *)((char*)rsp+rsp-&gt;length+2);
3647 if (rspn &gt;= end) {
3648 rsp = rspn;
3649 break;
3650 }
3651 member_sdes(s, rsp-&gt;type, rsp-&gt;data, rsp-&gt;length);
3652 }
3653 sd = (rtcp_sdes_t *)
3654 ((u_int32 *)sd + (((char *)rsp - (char *)sd) &gt;&gt; 2)+1);
3655 }
3656 if (count &gt;= 0) {
3657 /* invalid packet format */
3658 }
3659 }
3660
3661 <span class="h3"><a class="selflink" id="appendix-A.6" href="#appendix-A.6">A.6</a> Generating a Random 32-bit Identifier</span>
3662
3663 The following subroutine generates a random 32-bit identifier using
3664 the MD5 routines published in <a href="./rfc1321">RFC 1321</a> [<a href="#ref-23" title="&quot;The MD5 Message-Digest Algorithm&quot;">23</a>]. The system routines may
3665 not be present on all operating systems, but they should serve as
3666 hints as to what kinds of information may be used. Other system calls
3667 that may be appropriate include
3668
3669 o getdomainname() ,
3670
3671 o getwd() , or
3672
3673 o getrusage()
3674
3675 "Live" video or audio samples are also a good source of random
3676 numbers, but care must be taken to avoid using a turned-off
3677 microphone or blinded camera as a source [<a href="#ref-7" title="&quot;Randomness Recommendations for Security&quot;">7</a>].
3678
3679 Use of this or similar routine is suggested to generate the initial
3680 seed for the random number generator producing the RTCP period (as
3681 shown in <a href="#appendix-A.7">Appendix A.7</a>), to generate the initial values for the
3682 sequence number and timestamp, and to generate SSRC values. Since
3683 this routine is likely to be CPU-intensive, its direct use to
3684 generate RTCP periods is inappropriate because predictability is not
3685 an issue. Note that this routine produces the same result on repeated
3686 calls until the value of the system clock changes unless different
3687 values are supplied for the type argument.
3688
3689
3690
3691
3692 <span class="grey">Schulzrinne, et al Standards Track [Page 66]</span></pre>
3693 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-67" ></span>
3694 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3695
3696
3697 /*
3698 * Generate a random 32-bit quantity.
3699 */
3700 #include &lt;sys/types.h&gt; /* u_long */
3701 #include &lt;sys/time.h&gt; /* gettimeofday() */
3702 #include &lt;unistd.h&gt; /* get..() */
3703 #include &lt;stdio.h&gt; /* printf() */
3704 #include &lt;time.h&gt; /* clock() */
3705 #include &lt;sys/utsname.h&gt; /* uname() */
3706 #include "global.h" /* from <a href="./rfc1321">RFC 1321</a> */
3707 #include "md5.h" /* from <a href="./rfc1321">RFC 1321</a> */
3708
3709 #define MD_CTX MD5_CTX
3710 #define MDInit MD5Init
3711 #define MDUpdate MD5Update
3712 #define MDFinal MD5Final
3713
3714 static u_long md_32(char *string, int length)
3715 {
3716 MD_CTX context;
3717 union {
3718 char c[16];
3719 u_long x[4];
3720 } digest;
3721 u_long r;
3722 int i;
3723
3724 MDInit (&amp;context);
3725 MDUpdate (&amp;context, string, length);
3726 MDFinal ((unsigned char *)&amp;digest, &amp;context);
3727 r = 0;
3728 for (i = 0; i &lt; 3; i++) {
3729 r ^= digest.x[i];
3730 }
3731 return r;
3732 } /* md_32 */
3733
3734
3735 /*
3736 * Return random unsigned 32-bit quantity. Use 'type' argument if you
3737 * need to generate several different values in close succession.
3738 */
3739 u_int32 random32(int type)
3740 {
3741 struct {
3742 int type;
3743 struct timeval tv;
3744 clock_t cpu;
3745
3746
3747
3748 <span class="grey">Schulzrinne, et al Standards Track [Page 67]</span></pre>
3749 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-68" ></span>
3750 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3751
3752
3753 pid_t pid;
3754 u_long hid;
3755 uid_t uid;
3756 gid_t gid;
3757 struct utsname name;
3758 } s;
3759
3760 gettimeofday(&amp;s.tv, 0);
3761 uname(&amp;s.name);
3762 s.type = type;
3763 s.cpu = clock();
3764 s.pid = getpid();
3765 s.hid = gethostid();
3766 s.uid = getuid();
3767 s.gid = getgid();
3768
3769 return md_32((char *)&amp;s, sizeof(s));
3770 } /* random32 */
3771
3772 <span class="h3"><a class="selflink" id="appendix-A.7" href="#appendix-A.7">A.7</a> Computing the RTCP Transmission Interval</span>
3773
3774 The following function returns the time between transmissions of RTCP
3775 packets, measured in seconds. It should be called after sending one
3776 compound RTCP packet to calculate the delay until the next should be
3777 sent. This function should also be called to calculate the delay
3778 before sending the first RTCP packet upon startup rather than send
3779 the packet immediately. This avoids any burst of RTCP packets if an
3780 application is started at many sites simultaneously, for example as a
3781 result of a session announcement.
3782
3783 The parameters have the following meaning:
3784
3785 rtcp_bw: The target RTCP bandwidth, i.e., the total bandwidth that
3786 will be used for RTCP packets by all members of this session, in
3787 octets per second. This should be 5% of the "session bandwidth"
3788 parameter supplied to the application at startup.
3789
3790 senders: Number of active senders since sending last report, known
3791 from construction of receiver reports for this RTCP packet.
3792 Includes ourselves, if we also sent during this interval.
3793
3794 members: The estimated number of session members, including
3795 ourselves. Incremented as we discover new session members from
3796 the receipt of RTP or RTCP packets, and decremented as session
3797 members leave (via RTCP BYE) or their state is timed out (30
3798 minutes is recommended). On the first call, this parameter
3799 should have the value 1.
3800
3801
3802
3803
3804 <span class="grey">Schulzrinne, et al Standards Track [Page 68]</span></pre>
3805 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-69" ></span>
3806 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3807
3808
3809 we_sent: Flag that is true if we have sent data during the last two
3810 RTCP intervals. If the flag is true, the compound RTCP packet
3811 just sent contained an SR packet.
3812
3813 packet_size: The size of the compound RTCP packet just sent, in
3814 octets, including the network encapsulation (e.g., 28 octets for
3815 UDP over IP).
3816
3817 avg_rtcp_size: Pointer to estimator for compound RTCP packet size;
3818 initialized and updated by this function for the packet just
3819 sent, and also updated by an identical line of code in the RTCP
3820 receive routine for every RTCP packet received from other
3821 participants in the session.
3822
3823 initial: Flag that is true for the first call upon startup to
3824 calculate the time until the first report should be sent.
3825
3826 #include &lt;math.h&gt;
3827
3828 double rtcp_interval(int members,
3829 int senders,
3830 double rtcp_bw,
3831 int we_sent,
3832 int packet_size,
3833 int *avg_rtcp_size,
3834 int initial)
3835 {
3836 /*
3837 * Minimum time between RTCP packets from this site (in seconds).
3838 * This time prevents the reports from `clumping' when sessions
3839 * are small and the law of large numbers isn't helping to smooth
3840 * out the traffic. It also keeps the report interval from
3841 * becoming ridiculously small during transient outages like a
3842 * network partition.
3843 */
3844 double const RTCP_MIN_TIME = 5.;
3845 /*
3846 * Fraction of the RTCP bandwidth to be shared among active
3847 * senders. (This fraction was chosen so that in a typical
3848 * session with one or two active senders, the computed report
3849 * time would be roughly equal to the minimum report time so that
3850 * we don't unnecessarily slow down receiver reports.) The
3851 * receiver fraction must be 1 - the sender fraction.
3852 */
3853 double const RTCP_SENDER_BW_FRACTION = 0.25;
3854 double const RTCP_RCVR_BW_FRACTION = (1-RTCP_SENDER_BW_FRACTION);
3855 /*
3856 * Gain (smoothing constant) for the low-pass filter that
3857
3858
3859
3860 <span class="grey">Schulzrinne, et al Standards Track [Page 69]</span></pre>
3861 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-70" ></span>
3862 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3863
3864
3865 * estimates the average RTCP packet size (see Cadzow reference).
3866 */
3867 double const RTCP_SIZE_GAIN = (1./16.);
3868
3869 double t; /* interval */
3870 double rtcp_min_time = RTCP_MIN_TIME;
3871 int n; /* no. of members for computation */
3872
3873 /*
3874 * Very first call at application start-up uses half the min
3875 * delay for quicker notification while still allowing some time
3876 * before reporting for randomization and to learn about other
3877 * sources so the report interval will converge to the correct
3878 * interval more quickly. The average RTCP size is initialized
3879 * to 128 octets which is conservative (it assumes everyone else
3880 * is generating SRs instead of RRs: 20 IP + 8 UDP + 52 SR + 48
3881 * SDES CNAME).
3882 */
3883 if (initial) {
3884 rtcp_min_time /= 2;
3885 *avg_rtcp_size = 128;
3886 }
3887
3888 /*
3889 * If there were active senders, give them at least a minimum
3890 * share of the RTCP bandwidth. Otherwise all participants share
3891 * the RTCP bandwidth equally.
3892 */
3893 n = members;
3894 if (senders &gt; 0 &amp;&amp; senders &lt; members * RTCP_SENDER_BW_FRACTION) {
3895 if (we_sent) {
3896 rtcp_bw *= RTCP_SENDER_BW_FRACTION;
3897 n = senders;
3898 } else {
3899 rtcp_bw *= RTCP_RCVR_BW_FRACTION;
3900 n -= senders;
3901 }
3902 }
3903
3904 /*
3905 * Update the average size estimate by the size of the report
3906 * packet we just sent.
3907 */
3908 *avg_rtcp_size += (packet_size - *avg_rtcp_size)*RTCP_SIZE_GAIN;
3909
3910 /*
3911 * The effective number of sites times the average packet size is
3912 * the total number of octets sent when each site sends a report.
3913
3914
3915
3916 <span class="grey">Schulzrinne, et al Standards Track [Page 70]</span></pre>
3917 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-71" ></span>
3918 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3919
3920
3921 * Dividing this by the effective bandwidth gives the time
3922 * interval over which those packets must be sent in order to
3923 * meet the bandwidth target, with a minimum enforced. In that
3924 * time interval we send one report so this time is also our
3925 * average time between reports.
3926 */
3927 t = (*avg_rtcp_size) * n / rtcp_bw;
3928 if (t &lt; rtcp_min_time) t = rtcp_min_time;
3929
3930 /*
3931 * To avoid traffic bursts from unintended synchronization with
3932 * other sites, we then pick our actual next report interval as a
3933 * random number uniformly distributed between 0.5*t and 1.5*t.
3934 */
3935 return t * (drand48() + 0.5);
3936 }
3937
3938 <span class="h3"><a class="selflink" id="appendix-A.8" href="#appendix-A.8">A.8</a> Estimating the Interarrival Jitter</span>
3939
3940 The code fragments below implement the algorithm given in <a href="#section-6.3.1">Section</a>
3941 <a href="#section-6.3.1">6.3.1</a> for calculating an estimate of the statistical variance of the
3942 RTP data interarrival time to be inserted in the interarrival jitter
3943 field of reception reports. The inputs are r-&gt;ts , the timestamp from
3944 the incoming packet, and arrival , the current time in the same
3945 units. Here s points to state for the source; s-&gt;transit holds the
3946 relative transit time for the previous packet, and s-&gt;jitter holds
3947 the estimated jitter. The jitter field of the reception report is
3948 measured in timestamp units and expressed as an unsigned integer, but
3949 the jitter estimate is kept in a floating point. As each data packet
3950 arrives, the jitter estimate is updated:
3951
3952 int transit = arrival - r-&gt;ts;
3953 int d = transit - s-&gt;transit;
3954 s-&gt;transit = transit;
3955 if (d &lt; 0) d = -d;
3956 s-&gt;jitter += (1./16.) * ((double)d - s-&gt;jitter);
3957
3958 When a reception report block (to which rr points) is generated for
3959 this member, the current jitter estimate is returned:
3960
3961 rr-&gt;jitter = (u_int32) s-&gt;jitter;
3962
3963 Alternatively, the jitter estimate can be kept as an integer, but
3964 scaled to reduce round-off error. The calculation is the same except
3965 for the last line:
3966
3967 s-&gt;jitter += d - ((s-&gt;jitter + 8) &gt;&gt; 4);
3968
3969
3970
3971
3972 <span class="grey">Schulzrinne, et al Standards Track [Page 71]</span></pre>
3973 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-72" ></span>
3974 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
3975
3976
3977 In this case, the estimate is sampled for the reception report as:
3978
3979 rr-&gt;jitter = s-&gt;jitter &gt;&gt; 4;
3980
3981
3982 <span class="h2"><a class="selflink" id="appendix-B" href="#appendix-B">B</a>. Security Considerations</span>
3983
3984 RTP suffers from the same security liabilities as the underlying
3985 protocols. For example, an impostor can fake source or destination
3986 network addresses, or change the header or payload. Within RTCP, the
3987 CNAME and NAME information may be used to impersonate another
3988 participant. In addition, RTP may be sent via IP multicast, which
3989 provides no direct means for a sender to know all the receivers of
3990 the data sent and therefore no measure of privacy. Rightly or not,
3991 users may be more sensitive to privacy concerns with audio and video
3992 communication than they have been with more traditional forms of
3993 network communication [<a href="#ref-24" title="&quot;Security services for multimedia conferencing,&quot;">24</a>]. Therefore, the use of security mechanisms
3994 with RTP is important. These mechanisms are discussed in <a href="#section-9">Section 9</a>.
3995
3996 RTP-level translators or mixers may be used to allow RTP traffic to
3997 reach hosts behind firewalls. Appropriate firewall security
3998 principles and practices, which are beyond the scope of this
3999 document, should be followed in the design and installation of these
4000 devices and in the admission of RTP applications for use behind the
4001 firewall.
4002
4003 <span class="h2"><a class="selflink" id="appendix-C" href="#appendix-C">C</a>. Authors' Addresses</span>
4004
4005 Henning Schulzrinne
4006 GMD Fokus
4007 Hardenbergplatz 2
4008 D-10623 Berlin
4009 Germany
4010
4011 EMail: [email protected]
4012
4013
4014 Stephen L. Casner
4015 Precept Software, Inc.
4016 21580 Stevens Creek Boulevard, Suite 207
4017 Cupertino, CA 95014
4018 United States
4019
4020 EMail: [email protected]
4021
4022
4023
4024
4025
4026
4027
4028 <span class="grey">Schulzrinne, et al Standards Track [Page 72]</span></pre>
4029 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-73" ></span>
4030 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
4031
4032
4033 Ron Frederick
4034 Xerox Palo Alto Research Center
4035 3333 Coyote Hill Road
4036 Palo Alto, CA 94304
4037 United States
4038
4039 EMail: [email protected]
4040
4041
4042 Van Jacobson
4043 MS 46a-1121
4044 Lawrence Berkeley National Laboratory
4045 Berkeley, CA 94720
4046 United States
4047
4048 EMail: [email protected]
4049
4050 Acknowledgments
4051
4052 This memorandum is based on discussions within the IETF Audio/Video
4053 Transport working group chaired by Stephen Casner. The current
4054 protocol has its origins in the Network Voice Protocol and the Packet
4055 Video Protocol (Danny Cohen and Randy Cole) and the protocol
4056 implemented by the vat application (Van Jacobson and Steve McCanne).
4057 Christian Huitema provided ideas for the random identifier generator.
4058
4059 <span class="h2"><a class="selflink" id="appendix-D" href="#appendix-D">D</a>. Bibliography</span>
4060
4061 [<a id="ref-1">1</a>] D. D. Clark and D. L. Tennenhouse, "Architectural considerations
4062 for a new generation of protocols," in SIGCOMM Symposium on
4063 Communications Architectures and Protocols , (Philadelphia,
4064 Pennsylvania), pp. 200--208, IEEE, Sept. 1990. Computer
4065 Communications Review, Vol. 20(4), Sept. 1990.
4066
4067 [<a id="ref-2">2</a>] H. Schulzrinne, "Issues in designing a transport protocol for
4068 audio and video conferences and other multiparticipant real-time
4069 applications", Work in Progress.
4070
4071 [<a id="ref-3">3</a>] D. E. Comer, Internetworking with TCP/IP , vol. 1. Englewood
4072 Cliffs, New Jersey: Prentice Hall, 1991.
4073
4074 [<a id="ref-4">4</a>] Postel, J., "Internet Protocol", STD 5, <a href="./rfc791">RFC 791</a>, USC/Information
4075 Sciences Institute, September 1981.
4076
4077 [<a id="ref-5">5</a>] Mills, D., "Network Time Protocol Version 3", <a href="./rfc1305">RFC 1305</a>, UDEL,
4078 March 1992.
4079
4080
4081
4082
4083
4084 <span class="grey">Schulzrinne, et al Standards Track [Page 73]</span></pre>
4085 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-74" ></span>
4086 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
4087
4088
4089 [<a id="ref-6">6</a>] Reynolds, J., and J. Postel, "Assigned Numbers", STD 2, <a href="./rfc1700">RFC 1700</a>,
4090 USC/Information Sciences Institute, October 1994.
4091
4092 [<a id="ref-7">7</a>] Eastlake, D., Crocker, S., and J. Schiller, "Randomness
4093 Recommendations for Security", <a href="./rfc1750">RFC 1750</a>, DEC, Cybercash, MIT,
4094 December 1994.
4095
4096 [<a id="ref-8">8</a>] J.-C. Bolot, T. Turletti, and I. Wakeman, "Scalable feedback
4097 control for multicast video distribution in the internet," in
4098 SIGCOMM Symposium on Communications Architectures and Protocols ,
4099 (London, England), pp. 58--67, ACM, Aug. 1994.
4100
4101 [<a id="ref-9">9</a>] I. Busse, B. Deffner, and H. Schulzrinne, "Dynamic QoS control of
4102 multimedia applications based on RTP," Computer Communications ,
4103 Jan. 1996.
4104
4105 [<a id="ref-10">10</a>] S. Floyd and V. Jacobson, "The synchronization of periodic
4106 routing messages," in SIGCOMM Symposium on Communications
4107 Architectures and Protocols (D. P. Sidhu, ed.), (San Francisco,
4108 California), pp. 33--44, ACM, Sept. 1993. also in [<a href="#ref-25" title="&quot;The synchronization of periodic routing messages,&quot;">25</a>].
4109
4110 [<a id="ref-11">11</a>] J. A. Cadzow, Foundations of digital signal processing and data
4111 analysis New York, New York: Macmillan, 1987.
4112
4113 [<a id="ref-12">12</a>] International Standards Organization, "ISO/IEC DIS 10646-1:1993
4114 information technology -- universal multiple-octet coded
4115 character set (UCS) -- part I: Architecture and basic
4116 multilingual plane," 1993.
4117
4118 [<a id="ref-13">13</a>] The Unicode Consortium, The Unicode Standard New York, New York:
4119 Addison-Wesley, 1991.
4120
4121 [<a id="ref-14">14</a>] Mockapetris, P., "Domain Names - Concepts and Facilities", STD
4122 13, <a href="./rfc1034">RFC 1034</a>, USC/Information Sciences Institute, November 1987.
4123
4124 [<a id="ref-15">15</a>] Mockapetris, P., "Domain Names - Implementation and
4125 Specification", STD 13, <a href="./rfc1035">RFC 1035</a>, USC/Information Sciences
4126 Institute, November 1987.
4127
4128 [<a id="ref-16">16</a>] Braden, R., "Requirements for Internet Hosts - Application and
4129 Support", STD 3, <a href="./rfc1123">RFC 1123</a>, Internet Engineering Task Force,
4130 October 1989.
4131
4132 [<a id="ref-17">17</a>] Rekhter, Y., Moskowitz, R., Karrenberg, D., and G. de Groot,
4133 "Address Allocation for Private Internets", <a href="./rfc1597">RFC 1597</a>, T.J. Watson
4134 Research Center, IBM Corp., Chrysler Corp., RIPE NCC, March 1994.
4135
4136
4137
4138
4139
4140 <span class="grey">Schulzrinne, et al Standards Track [Page 74]</span></pre>
4141 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-75" ></span>
4142 <span class="grey"><a href="./rfc1889">RFC 1889</a> RTP January 1996</span>
4143
4144
4145 [<a id="ref-18">18</a>] Lear, E., Fair, E., Crocker, D., and T. Kessler, "Network 10
4146 Considered Harmful (Some Practices Shouldn't be Codified)", <a href="./rfc1627">RFC</a>
4147 <a href="./rfc1627">1627</a>, Silicon Graphics, Inc., Apple Computer, Inc., Silicon
4148 Graphics, Inc., July 1994.
4149
4150 [<a id="ref-19">19</a>] Crocker, D., "Standard for the Format of ARPA Internet Text
4151 Messages", STD 11, <a href="./rfc822">RFC 822</a>, UDEL, August 1982.
4152
4153 [<a id="ref-20">20</a>] W. Feller, An Introduction to Probability Theory and its
4154 Applications, Volume 1 , vol. 1. New York, New York: John Wiley
4155 and Sons, third ed., 1968.
4156
4157 [<a id="ref-21">21</a>] Balenson, D., "Privacy Enhancement for Internet Electronic Mail:
4158 Part III: Algorithms, Modes, and Identifiers", <a href="./rfc1423">RFC 1423</a>, TIS, IAB
4159 IRTF PSRG, IETF PEM WG, February 1993.
4160
4161 [<a id="ref-22">22</a>] V. L. Voydock and S. T. Kent, "Security mechanisms in high-level
4162 network protocols," ACM Computing Surveys , vol. 15, pp. 135--
4163 171, June 1983.
4164
4165 [<a id="ref-23">23</a>] Rivest, R., "The MD5 Message-Digest Algorithm", <a href="./rfc1321">RFC 1321</a>, MIT
4166 Laboratory for Computer Science and RSA Data Security, Inc.,
4167 April 1992.
4168
4169 [<a id="ref-24">24</a>] S. Stubblebine, "Security services for multimedia conferencing,"
4170 in 16th National Computer Security Conference , (Baltimore,
4171 Maryland), pp. 391--395, Sept. 1993.
4172
4173 [<a id="ref-25">25</a>] S. Floyd and V. Jacobson, "The synchronization of periodic
4174 routing messages," IEEE/ACM Transactions on Networking , vol. 2,
4175 pp. 122-136, April 1994.
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196 Schulzrinne, et al Standards Track [Page 75]
4197 </pre>