FecFrame V. Roca Internet-Draft M. Cunche Intended status: Standards Track INRIA Expires: January 14, 2010 J. Lacan A. Bouabdallah ISAE/LAAS-CNRS K. Matsuzono Keio University July 13, 2009 Reed-Solomon Forward Error Correction (FEC) Schemes for FECFRAME draft-roca-fecframe-rs-01 Status of this Memo This Internet-Draft is submitted to IETF in full conformance with the provisions of BCP 78 and BCP 79. This document may contain material from IETF Documents or IETF Contributions published or made publicly available before November 10, 2008. The person(s) controlling the copyright in some of this material may not have granted the IETF Trust the right to allow modifications of such material outside the IETF Standards Process. Without obtaining an adequate license from the person(s) controlling the copyright in such materials, this document may not be modified outside the IETF Standards Process, and derivative works of it may not be created outside the IETF Standards Process, except to format it for publication as an RFC or to translate it into languages other than English. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet- Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt. The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html. This Internet-Draft will expire on January 14, 2010. Copyright Notice Roca, et al. Expires January 14, 2010 [Page 1] Internet-Draft Reed-Solomon FEC Schemes July 2009 Copyright (c) 2009 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents in effect on the date of publication of this document (http://trustee.ietf.org/license-info). Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Abstract This document describes four fully-specified FEC schemes for Reed- Solomon codes that can be used to protect media streams along the lines defined by the FECFRAME framework. Reed-Solomon codes belong to the class of Maximum Distance Separable (MDS) codes which means they offer optimal protection against packet erasures. They are also systematic codes, which means that the source symbols are part of the encoding symbols. The price to pay is a limit on the maximum source block size, on the maximum number of encoding symbols, and a computational complexity higher than that of sparse parity check based FEC codes. However, this complexity remains compatible with software codecs. The first scheme is for Reed-Solomon codes over GF(2^^m), with m in {2..16}, a simple FEC encoding and arbitrary packet flows. The second scheme is for Reed-Solomon codes over GF(2^^8), the interleaved FEC encoding, and arbitrary packet flows. The third (resp. fourth) scheme is similar to the first (resp. second) scheme, with the exception that it is for a single sequenced flow. Roca, et al. Expires January 14, 2010 [Page 2] Internet-Draft Reed-Solomon FEC Schemes July 2009 Table of Contents 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 5 3. Definitions Notations and Abbreviations . . . . . . . . . . . 5 3.1. Definitions . . . . . . . . . . . . . . . . . . . . . . . 5 3.2. Notations . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3. Abbreviations . . . . . . . . . . . . . . . . . . . . . . 8 4. Common Procedures Related to the ADU Block and Source Block Creation . . . . . . . . . . . . . . . . . . . . . . . . 8 4.1. Problem Statement . . . . . . . . . . . . . . . . . . . . 8 4.2. Source Block Creation with the Simple FEC Encoding Strategy . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.3. Source Block Creation with the Interleaved FEC Encoding Strategy . . . . . . . . . . . . . . . . . . . . 11 5. Reed-Solomon Simple FEC Encoding Scheme over GF(2^^m) for Arbitrary ADU Flows . . . . . . . . . . . . . . . . . . . . . 13 5.1. Formats and Codes . . . . . . . . . . . . . . . . . . . . 14 5.1.1. FEC Framework Configuration Information . . . . . . . 14 5.1.2. Explicit Source FEC Payload ID . . . . . . . . . . . . 15 5.1.3. Repair FEC Payload ID . . . . . . . . . . . . . . . . 16 5.2. Procedures . . . . . . . . . . . . . . . . . . . . . . . . 17 5.3. FEC Code Specification . . . . . . . . . . . . . . . . . . 17 6. Reed-Solomon Interleaved FEC Encoding Scheme over GF(2^^8) for Arbitrary ADU Flows . . . . . . . . . . . . . . . . . . . 17 6.1. Formats and Codes . . . . . . . . . . . . . . . . . . . . 18 6.1.1. FEC Framework Configuration Information . . . . . . . 18 6.1.2. Explicit Source FEC Payload ID . . . . . . . . . . . . 18 6.1.3. Repair FEC Payload ID . . . . . . . . . . . . . . . . 19 6.2. Procedures . . . . . . . . . . . . . . . . . . . . . . . . 20 6.3. FEC Code Specification . . . . . . . . . . . . . . . . . . 22 7. Reed-Solomon Simple FEC Encoding Scheme over GF(2^^m) for a Single Sequenced ADU Flow . . . . . . . . . . . . . . . . . 22 8. Reed-Solomon Interleaved FEC Encoding Scheme over GF(2^^8) for a Single Sequenced ADU Flow . . . . . . . . . . . . . . . 22 9. Security Considerations . . . . . . . . . . . . . . . . . . . 22 9.1. Problem Statement . . . . . . . . . . . . . . . . . . . . 22 9.2. Attacks Against the Data Flow . . . . . . . . . . . . . . 22 9.2.1. Access to Confidential Objects . . . . . . . . . . . . 23 9.2.2. Content Corruption . . . . . . . . . . . . . . . . . . 23 9.3. Attacks Against the FEC Parameters . . . . . . . . . . . . 24 10. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 24 11. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 24 12. References . . . . . . . . . . . . . . . . . . . . . . . . . . 24 12.1. Normative References . . . . . . . . . . . . . . . . . . . 24 12.2. Informative References . . . . . . . . . . . . . . . . . . 25 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 26 Roca, et al. Expires January 14, 2010 [Page 3] Internet-Draft Reed-Solomon FEC Schemes July 2009 1. Introduction The use of Forward Error Correction (FEC) codes is a classic solution to improve the reliability of unicast, multicast and broadcast Content Delivery Protocols (CDP) and applications [RFC3453]. The [FECFRAME-FRAMEWORK] document describes a generic framework to use FEC schemes with media delivery applications, and for instance with real-time streaming media applications based on the RTP real-time protocol. Similarly the [RFC5052] document describes a generic framework to use FEC schemes with with objects (e.g., files) delivery applications based on the ALC [RMT-PI-ALC] and NORM [RMT-PI-NORM] reliable multicast transport protocols. More specifically, the [RFC5053] and [RFC5170] FEC schemes introduce erasure codes based on sparse parity check matrices for object delivery protocols like ALC and NORM. These codes are efficient in terms of processing but not optimal in terms of erasure recovery capabilities when dealing with "small" objects. The Reed-Solomon FEC codes described in this document belong to the class of Maximum Distance Separable (MDS) codes that are optimal in terms of erasure recovery capability. It means that a receiver can recover the k source symbols from any set of exactly k encoding symbols. These codes are also systematic codes, which means that the k source symbols are part of the encoding symbols. However they are limited in terms of maximum source block size and number of encoding symbols. Since the real-time constraints of media delivery applications usually limit the maximum source block size, this is not considered to be a major issue in the context of the FEC Framework for many (but not necessarily all) use-cases. Additionally, if the encoding/decoding complexity is higher with Reed-Solomon codes than it is with [RFC5053] or [RFC5170] codes, it remains reasonable for most use-cases, even in case of a software codec. Many applications dealing with reliable content transmission or content storage already rely on packet-based Reed-Solomon erasure recovery codes. In particular, many of them use the Reed-Solomon codec of Luigi Rizzo [RS-codec] [Rizzo97]. The goal of the present document is to specify Reed-Solomon schemes that are compatible with this codec. More specifically, the [RFC5510] document introduced such Reed- Solomon codes and several associated FEC schemes that are compatible with the [RFC5052] framework. The present document inherits from [RFC5510] the specification of the core Reed-Solomon codes based on Vandermonde matrices, and specifies FEC schemes that are compatible with the FECFRAME framework [FECFRAME-FRAMEWORK]. Therefore this document specifies only the information specific to the FECFRAME Roca, et al. Expires January 14, 2010 [Page 4] Internet-Draft Reed-Solomon FEC Schemes July 2009 context and refers to [RFC5510] for the core specifications of the codes. To that purpose, the present document introduces: o the Fully-Specified FEC Scheme with FEC Encoding ID XXX that specifies the use of Reed-Solomon codes over GF(2^^m), with m in {2..16}, with a simple FEC encoding for arbitrary packet flows; o the Fully-Specified FEC Scheme with FEC Encoding ID XXX that specifies the use of Reed-Solomon codes over GF(2^^8), with an interleaved FEC encoding for arbitrary packet flows; o the Fully-Specified FEC Scheme with FEC Encoding ID XXX is similar to Scheme XXX except that it is for a single sequenced flow; o the Fully-Specified FEC Scheme with FEC Encoding ID XXX is similar to Scheme XXX except that it is for a single sequenced flow; The distinction between FEC schemes with a simple FEC encoding and FEC schemes with the interleaved FEC encoding derives from the small block nature of Reed-Solomon codes over GF(2^^8), the default value. With the simple FEC encoding, a set of Application Data Units (or ADUs) coming from the media delivery application (e.g., a set of RTP packets), are grouped in a ADU block and FEC encoded as a whole. With Reed-Solomon codes over GF(2^^8), there is a strict limit over the number ADUs that can be protected together, since the number of encoded symbols, n, must be inferior or equal to 255. With the interleaved encoding we relax this constraint, and protecting a single set of ADUs, considered as a whole since they constitute a single ADU block, can require several independent FEC encodings. Here a dedicated interleaving solution is used to assign the various source symbols to the various source blocks in an optimal way, so as to guaranty the highest possible erasure recovery capabilities. 2. Terminology The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119 [RFC2119]. 3. Definitions Notations and Abbreviations 3.1. Definitions This document uses the following terms and definitions. Some of them are FEC scheme specific and are in line with [RFC5052]: Roca, et al. Expires January 14, 2010 [Page 5] Internet-Draft Reed-Solomon FEC Schemes July 2009 Source symbol: unit of data used during the encoding process. Encoding symbol: unit of data generated by the encoding process. With systematic codes, source symbols are part of the encoding symbols. Repair symbol: encoding symbol that is not a source symbol. Code rate: the k/n ratio, i.e., the ratio between the number of source symbols and the number of encoding symbols. By definition, the code rate is such that: 0 < code rate <= 1. A code rate close to 1 indicates that a small number of repair symbols have been produced during the encoding process. Systematic code: FEC code in which the source symbols are part of the encoding symbols. The Reed-Solomon codes introduced in this document are systematic. Source block: a block of k source symbols that are considered together for the encoding. Packet Erasure Channel: a communication path where packets are either dropped (e.g., by a congested router, or because the number of transmission errors exceeds the correction capabilities of the physical layer codes) or received. When a packet is received, it is assumed that this packet is not corrupted. Some of them are FECFRAME framework specific and are in line with [FECFRAME-FRAMEWORK]: Application Data Unit (ADU): a unit of data coming from (sender) or given to (receiver) the media delivery application. Depending on the use-case, an ADU can use an RTP encapsulation. (Source) ADU Flow: a flow of ADUs from a media delivery application and to which FEC protection is applied. Depending on the use- case, several ADU flows can be protected together by the FECFRAME framework. ADU Block: a set of ADUs that are considered together by the FECFRAME instance for the purpose of the FEC scheme. Along with the F[], L[], and Pad[] fields, they form the set of source symbols over which FEC encoding will be performed (either in a global way or separately depending on the FEC scheme used). ADU Information (ADUI): a unit of data constituted by the ADU and the associated Flow ID, Length and Padding fields (Section 4.2 and Section 4.3). This is the unit of data that is used to define source symbols. FEC Framework Configuration Information: the FEC scheme specific information that enables the synchronization of the FECFRAME sender and receiver instances. FEC Source Packet: a data packet submitted to (sender) or received from (receiver) the transport protocol. It contains an ADU along with its optional Explicit Source FEC Payload ID. Roca, et al. Expires January 14, 2010 [Page 6] Internet-Draft Reed-Solomon FEC Schemes July 2009 FEC Repair Packet: a repair packet submitted to (sender) or received from (receiver) the transport protocol. It contains a repair symbol along with its Explicit Repair FEC Payload ID. The above terminology is illustrated in Figure 1 (sender point of view): +----------------------+ | Application | +----------------------+ | ADU flow | (1) Application Data Unit (ADU) v +----------------------+ +----------------+ | FEC Framework | | | | |------------------------- >| FEC Scheme | |(2) Construct an ADU | (4) Source Symbols for | | | block | this Source Block |(5) Perform FEC | |(3) Construct ADU Info| | Encoding | |(7) Construct FEC Src |< -------------------------| | | Packets and FEC |(6) Ex src FEC Payload Ids,| | | Repair Packets | Repair FEC Payload Ids,| | +----------------------+ Repair Symbols +----------------+ | | |(8) FEC Src |(8') FEC Repair | packets | packets v v +----------------------+ | Transport Layer | | (e.g., UDP ) | +----------------------+ Figure 1: Terminology used in this document (sender). 3.2. Notations This document uses the following notations: Some of them are FEC scheme specific: k denotes the number of source symbols in a source block. max_k denotes the maximum number of source symbols for any source block. n_r denotes the number of repair symbols generated for a source block. n denotes the number of encoding symbols generated for a source block. Therefore: n = k + n_r. Roca, et al. Expires January 14, 2010 [Page 7] Internet-Draft Reed-Solomon FEC Schemes July 2009 E denotes the encoding symbol length in bytes. S denotes the encoding symbol length in units of m-bit elements. When m = 8, then S and E are equal. GF(q) denotes a finite field (also known as Galois Field) with q elements. We assume that q = 2^^m in this document. m defines the length of the elements in the finite field, in bits. In this document, m belongs to {2..16}. q defines the number of elements in the finite field. We have: q = 2^^m in this specification. CR denotes the "code rate", i.e., the k/n ratio. a^^b denotes a raised to the power b. Some of them are FECFRAME framework specific: B denotes the number of ADUs per ADU block. max_B denotes the maximum number of ADUs for any ADU block. tot_k denotes the total number of source symbols in an ADU block. NumSB denotes the number of source blocks for an ADU block. 3.3. Abbreviations This document uses the following abbreviations: ADU stands for Application Data Unit. ESI stands for Encoding Symbol ID. FFCI stands for FEC Framework Configuration Information. RS stands for Reed-Solomon. MDS stands for Maximum Distance Separable code. 4. Common Procedures Related to the ADU Block and Source Block Creation This section introduces the procedures that are used during the ADU block and the related source block(s) creation, for the various FEC schemes considered. 4.1. Problem Statement Several aspects must be considered, that impact the source block creation: o the distribution of ADU sizes for the ADU flow(s) protected by the FECFRAME instance; o the maximum source block size (k parameter) and number of encoding symbols (n parameter), that are constrained by the finite field size (m parameter); o the potential real-time constraints, that impact the maximum ADU block size, since the larger the block size, the larger the decoding delay; We now detail each of these aspects. Roca, et al. Expires January 14, 2010 [Page 8] Internet-Draft Reed-Solomon FEC Schemes July 2009 In its most general form the FECFRAME framework and the RS FEC schemes are meant to protect a set of independent flows. Since the flows have no relationship to one another, the ADU size of each flow will potentially vary significantly. Even in the special case of a single flow, the ADU sizes may largely vary (e.g., the various frames of a "Group of Pictures (GOP) of an H.264 flow can have different sizes). This diversity must be addressed by the source block creation procedure since the RS FEC scheme requires a constant encoding symbol size (E parameter). The finite field size parameter, m, defines the number of non zero elements in this field which is equal to: q - 1 = 2^^m - 1. This q - 1 value is also the theoretical maximum number of encoding symbols that can be produced for a source block. For instance, when m = 8 (default) there is a maximum of 2^^8 - 1 = 255 encoding symbols. So: k < n <= 255. Given the target FEC code rate (e.g., provided by the developer when starting the FECFRAME framework, and taking into account the (known or estimated) packet loss rate), the sender calculates: max_k = floor((2^^m - 1) * CR) This max_k value leaves enough room for the sender to produce the desired number of repair symbols. The source ADU flows usually have real-time constraints. It means that the maximum number of ADUs of an ADU block must not exceed a certain threshold since it directly impacts the decoding delay. It is the role of the developer, who knows the flow real-time features, to define an appropriate upper bound to the ADU block size, max_B. Another aspect is the appropriate way of performing FEC encoding over the ADU block. Depending of the actual situation, two strategies are considered in this document: o There can be situations where a sender needs to protect a "small" number of ADUs. In that case the number of source symbols does not exceed the max_k value. For this kind of situation, all the ADUs and their associated flow ID, length, and padding fields, are virtually split into source symbols and a simple FEC encoding is performed. o There can be situations where a sender needs to protect a "large" number of ADUs. In that case the number of symbols can easily exceed the max_k value. For this kind of situation, the present document introduces an interleaved encoding scheme, which potentially several source blocks over which an independent FEC encoding is performed. These two encoding strategies are introduced in the following sections. Roca, et al. Expires January 14, 2010 [Page 9] Internet-Draft Reed-Solomon FEC Schemes July 2009 4.2. Source Block Creation with the Simple FEC Encoding Strategy With the simple encoding strategy, the ADU block is always encoded as a single source block. There are a total of B <= max_B ADUs in this ADU block. For the ADU i, with 0 <= i <= B-1, 3 bytes are prepended (Figure 2): o The first byte, FID[i] (Flow ID), contains the integer identifier associated to the source ADU flow to which this ADU belongs to. It is assumed that a single byte is sufficient, or said differently, that no more than 256 flows will be protected by a single instance of the FECFRAME framework. o The following two bytes, L[i] (Length), contain the length of this ADU, in network byte order (i.e., big endian). This length is for the ADU itself and does not include the FID[i], L[i], or Pad[i] fields. Zero padding is also added if needed, in field Pad[i], for alignment purposes on source symbol boundaries. This can happen at most once per ADU. The data unit resulting from the ADU and the F[], L[] and Pad[] fields, is called ADU Information (or ADUI). Thanks to the padding, a source symbol will never straddle several ADUIs. As a direct consequence, a source symbol will never straddle several FEC source packets that are the payloads transmitted (and possibly erased) over the physical network. Roca, et al. Expires January 14, 2010 [Page 10] Internet-Draft Reed-Solomon FEC Schemes July 2009 Enc Symbol Len (E) Enc Symbol Len (E) Enc Symbol Len (E) < ------------------ >< ------------------ >< ------------------ > +----+----+-----------------------+--------+ |F[0]|L[0]| R[0] | Pad[1] | +----+----+----------+------------+--------+ |F[1]|L[1]| R[1] | +----+----+----------+--------------------------------------+----+ |F[2]|L[2]| R[2] |P[2]| +----+----+----------+--------------------------------------+----+ |F[3]|L[3]| R[3] | P3| +----+----+------+---+ \_______________________________ _______________________________/ \/ simple FEC encoding +--------------------+ | Repair 7 | +--------------------+ . . . . +--------------------+ | Repair 13 | +--------------------+ Figure 2: Source block creation with the simple encoding scheme, for code rate 1/2 (equal number of source and repair symbols, 7 in this example). Note that neither the initial 3 bytes nor the optional padding are sent over the network. However, they are considered during FEC encoding. It means that a receiver who lost a certain FEC source packet (e.g., the UDP datagram containing this FEC source packet) will be able to recover the ADUI if FEC decoding succeeds. Thanks to the initial 3 bytes, this receiver will get rid of the padding (if any) and identify the corresponding ADU flow. 4.3. Source Block Creation with the Interleaved FEC Encoding Strategy With the interleaved encoding scheme, the ADU block is too large in terms of number of source symbols to be encoded in a single source block (i.e., it exceeds the max_k value, Section 4.1). Therefore, the ADU block is split into several source blocks. Each source block leads to a different FEC encoding and the appropriate number of repair symbols are generated each time, as specified by the target code rate. In this section we define an interleaving approach to distribute the source symbols of the various ADUIs to source blocks in order to guaranty the best possible erasure protection. Roca, et al. Expires January 14, 2010 [Page 11] Internet-Draft Reed-Solomon FEC Schemes July 2009 Note that this solution is preferable to the alternative approach consisting in considering smaller ADU blocks, from an erasure recovery capability point of view. Note also that the simple encoding scheme (Section 4.2) can be regarded as a special case, when there is a single source block and when m = 8. The creation of an ADUI follows the same approach as in Section 4.2: for the ADU i, with 0 <= i <= B-1, 3 bytes are prepended for the F[i] and L[i] fields and an optional zero padding appended. The ADU block is naturally identified by the SBN of its first source block. Let us detail the problem of the source symbol to source block assignement approach. Let: s[i] the size of the ADUI i, in units of symbols (this size includes the F[i], L[i], and Pad[i] fields). tot_k the total number of source symbols in this ADU block. In other words, tot_k is the sum of all the s[i], with 0 <= i < B. NumSB the number of source blocks for this ADU block. NumSB = ceil(tot_k / max_k). We assume that tot_k >= max_k (the particular case where it is equal corresponds to Section 4.2). The key idea is that maximum erasure recovery capabilities requires that the source symbols for a certain ADUI be spread over the largest possible number of source blocks. If a single FEC source packet is lost, say i, each source block associated to the corresponding ADUI should experience a number of source symbol erasures that at most equals ceil(s[i] / NumSB). These erasures can often be recovered during FEC decoding since the ceil(s[i] / NumSB) value is usually small. This requirement leads to the following interleaving algorithm, that specifies how source symbols of a given ADU block are assigned to the various source blocks: src_symbols_to_src_blocks_assignment_at_a_sender () { NumSB = ceil(tot_k / max_k); /* number of source blocks */ int SB_idx = 0; /* index of current source block */ for (int i = 0; i < B; i++) { /* for all the ADUIs */ for (int j = 0; j < s[i]; j++) { /* for all symbols of ADUI*/ add ADUI[i].src_symbol[j] to src_block[SB_idx]; SB_idx = (SB_idx + 1) % NumSB; } } } Figure 3: Source symbols to Source blocks interleaving algorithm. Roca, et al. Expires January 14, 2010 [Page 12] Internet-Draft Reed-Solomon FEC Schemes July 2009 Let us consider an example (Figure 4). The ADU block consists of five ADUs (B = 5), whose size (in unit of symbols) is respectively 1, 1, 2, 2, and 3 symbols. Therefore tot_k = 9 source symbols. If max_k = 3 symbols, then NumSB = ceil(9/3) = 3 source blocks. The above algorithm leads to the creation of the following source blocks: SB0 = {0.0; 2.1; 4.0}, SB1 = {1.0; 3.0; 4.1}, and SB2 = {2.0; 3.1; 4.2}. If the FEC source packet corresponding to ADUI 4 is lost during transmission, then it leads to a single source symbol erasure in each of the three source blocks, which will easily be recovered during FEC decoding. +----------+ ADUI 0: | symb 0.0 | +----------+ +----------+ ADUI 1: | symb 1.0 | +----------+ +----------+----------+ ADUI 2: | symb 2.0 | symb 2.1 | +----------+----------+ +----------+----------+ ADUI 3: | symb 3.0 | symb 3.1 | +----------+----------+ +----------+----------+----------+ ADUI 4: | symb 4.0 | symb 4.1 | symb 4.2 | +----------+----------+----------+ Figure 4: Source block creation with the interleaved encoding scheme example (the ADUIs are assumed to be already split in symbols and the F[], L[] and Pad[] fields are not represented). Here also, neither the initial 3 bytes nor the optional padding are sent over the network. However, they are considered during FEC encoding. It means that a receiver who lost a certain FEC source packet (e.g., the UDP datagram containing this FEC source packet) will be able to recover the ADUI if FEC decoding succeeds. Thanks to the initial 3 bytes, this receiver will get rid of the padding (if any) and identify the corresponding ADU flow. 5. Reed-Solomon Simple FEC Encoding Scheme over GF(2^^m) for Arbitrary ADU Flows This Fully-Specified FEC Scheme specifies the use of Reed-Solomon Roca, et al. Expires January 14, 2010 [Page 13] Internet-Draft Reed-Solomon FEC Schemes July 2009 codes over GF(2^^m), with m in {2..16}, with a simple FEC encoding for arbitrary packet flows. 5.1. Formats and Codes 5.1.1. FEC Framework Configuration Information The FEC Framework Configuration Information (or FFCI) includes information that MUST be communicated between the sender and receiver(s). More specifically, it enables the synchronization of the FECFRAME sender and receiver instances. It includes both mandatory elements and scheme-specific elements, as detailed below. 5.1.1.1. Mandatory Information o FEC Encoding ID: the value assigned to this fully-specified FEC scheme MUST be XXX, as assigned by IANA (Section 10). When SDP is used to communicate the FFCI, this FEC Encoding ID is carried in the 'encoding-id' parameter. 5.1.1.2. FEC Scheme-Specific Information The FEC Scheme Specific Information (FSSI) includes elements that are specific to the present FEC scheme. More precisely: o Encoding symbol length (E) (16 bit field): a non-negative integer that indicates the length of each encoding symbol in bytes. o m parameter (8 bit field): an integer that defines the length of the elements in the finite field, in bits. In this scheme, m belongs to {2..16}. The encoding format consists of the following 3 octet field: 0 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Encoding Symbol Length (E) | m | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 5: FSSI encoding format. These elements are required both by the sender (RS encoder) and the receiver(s) (RS decoder). When SDP is used to communicate the FFCI, this FEC scheme-specific information is carried in the 'fssi' parameter as an opaque octet string, using a Base64 encoding, as specified in [SDP_ELEMENTS]. Roca, et al. Expires January 14, 2010 [Page 14] Internet-Draft Reed-Solomon FEC Schemes July 2009 5.1.2. Explicit Source FEC Payload ID A FEC source packet MUST contain an Explicit Source FEC Payload ID that is appended to the end of the packet as illustrated in Figure 6. +--------------------------------+ | IP Header | +--------------------------------+ | Transport Header | +--------------------------------+ | ADU | +--------------------------------+ | Explicit Source FEC Payload ID | +--------------------------------+ Figure 6: Structure of a FEC source packet with the Explicit Source FEC Payload ID. More precisely, the Explicit Source FEC Payload ID is composed of the Source Block Number and the Encoding Symbol ID. The length of these two fields depends on the m parameter (transmitted separately in the FFCI, Section 5.1.1.2): Source Block Number (SBN) (32-m bit field): this field identifies the source block to which this FEC source packet belongs. Encoding Symbol ID (ESI) (m bit field): this field identifies the first source symbol associated to this FEC source packet in the source block (remember there can be several source symbols per ADUI, Section 4.2). This value belongs to interval {0..k - 1} inclusive for source symbols. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Block Number (32-8=24 bits) | Enc. Symb. ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 7: Source FEC Payload ID encoding format for m = 8 (default). 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Block Nb (16 bits) | Enc. Symbol ID (16 bits) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 8: Source FEC Payload ID encoding format for m = 16. The format of the Source FEC Payload ID for m = 8 and m = 16 are Roca, et al. Expires January 14, 2010 [Page 15] Internet-Draft Reed-Solomon FEC Schemes July 2009 illustrated in Figure 7 and Figure 8 respectively. 5.1.3. Repair FEC Payload ID A FEC repair packet MUST contain a Repair FEC Payload ID that is prepended to the repair symbol(s) as illustrated in Figure 9. There can be several repair symbols per repair packet. +--------------------------------+ | IP Header | +--------------------------------+ | Transport Header | +--------------------------------+ | Repair FEC Payload ID | +--------------------------------+ | Repair Symbol(s) | +--------------------------------+ Figure 9: Structure of a repair packet with the Repair FEC Payload ID. More precisely, the Repair FEC Payload ID is composed of the Source Block Number, the Encoding Symbol ID and the Source Block Length. The length of these fields depends on the m parameter (transmitted separately in the FFCI, Section 5.1.1.2): Source Block Number (SBN) (32-m bit field): this field identifies the source block to which the FEC repair packet belongs. Encoding Symbol ID (ESI) (m bit field) this field identifies the first repair symbol contained in this FEC repair packet (remember there can be several repair symbols per FEC repair packet). This value belongs to interval {k..n - k - 1} inclusive for repair symbols. Source Block Length (k) (16 bit field): this field provides the number of source symbols for this source block, i.e., the k parameter. If 16 bits are too much when m <= 8, it is needed when 8 < m <= 16. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Block Number (32-8=24 bits) | Enc. Symb. ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Block Length (k) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 10: Repair FEC Payload ID encoding format for m = 8 (default). Roca, et al. Expires January 14, 2010 [Page 16] Internet-Draft Reed-Solomon FEC Schemes July 2009 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Block Nb (16 bits) | Enc. Symbol ID (16 bits) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Source Block Length (k) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 11: Repair FEC Payload ID encoding format for m = 16. The format of the Repair FEC Payload ID for m = 8 and m = 16 are illustrated in Figure 10 and Figure 11 respectively. The actual number of repair symbols contained in a FEC repair packet can be determined by the receiver by comparing the FEC repair packet length, PL, and the encoding symbol length, E, (transmitted in the FFCI). More precisely, this number is given by SN = PL / E. When multiple repair symbols are sent in the same FEC repair packet, the FEC Payload ID refers to the first repair symbol. The other repair symbols can be deduced from the ESI of the first repair symbol by incrementing sequentially this ESI. 5.2. Procedures The following procedures apply: o The source block creation procedures are specified in Section 4.2. o The SBN value is incremented for each new source block, starting at 0 for the first block of the ADU flow. Wrapping to zero will happen for long sessions, after value 2^^(32-m) - 1. o The ESI of source symbols is managed sequentially, starting at 0 for the first symbol. There are a maximum of 2^^m encoding symbols per block. The first k values (from 0 to k - 1 inclusive) identify source symbols, whereas the last n-k values (from k to n - k - 1 inclusive) identify repair symbols. o The FEC repair packet creation procedures are specified in Section 5.1.3. 5.3. FEC Code Specification The present document inherits from [RFC5510] the specification of the core Reed-Solomon codes based on Vandermonde matrices for a packet transmission channel. 6. Reed-Solomon Interleaved FEC Encoding Scheme over GF(2^^8) for Arbitrary ADU Flows This Fully-Specified FEC Scheme specifies the use of Reed-Solomon Roca, et al. Expires January 14, 2010 [Page 17] Internet-Draft Reed-Solomon FEC Schemes July 2009 codes over GF(2^^8) (the restriction to m = 8 is due to practical reasons), with an interleaved FEC encoding for arbitrary packet flows. 6.1. Formats and Codes 6.1.1. FEC Framework Configuration Information The FEC Framework Configuration Information (or FFCI) includes information that MUST be communicated between the sender and receiver(s). More specifically, it enables the synchronization of the FECFRAME sender and receiver instances. It includes both mandatory elements and scheme-specific elements, as detailed below. 6.1.1.1. Mandatory Information o FEC Encoding ID: the value assigned to this fully-specified FEC scheme MUST be XXX, as assigned by IANA (Section 10). When SDP is used to communicate the FFCI, this FEC Encoding ID is carried in the 'encoding-id' parameter. 6.1.1.2. FEC Scheme-Specific Information The FEC Scheme Specific Information (FSSI) includes elements that are specific to the present FEC scheme. More precisely: o Encoding symbol length (E) (16 bit field): a non-negative integer that indicates the length of each encoding symbol in bytes. The encoding format consists of the following 2 octet field: 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Encoding Symbol Length (E) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 12: FSSI encoding format. These elements are required both by the sender (RS encoder) and the receiver(s) (RS decoder). When SDP is used to communicate the FFCI, this FEC scheme-specific information is carried in the 'fssi' parameter as an opaque octet string, using a Base64 encoding, as specified in [SDP_ELEMENTS]. 6.1.2. Explicit Source FEC Payload ID A FEC source packet MUST contain an Explicit Source FEC Payload ID that is appended to the end of the packet as illustrated in Figure 6. Roca, et al. Expires January 14, 2010 [Page 18] Internet-Draft Reed-Solomon FEC Schemes July 2009 More precisely, the Explicit Source FEC Payload ID is composed of: First Source Block Number (1st_SBN) (16 bit field): this field contains the SBN of the first source block of the ADU block. It is meant to identify the ADU block itself. Note that this is not necessarily the SBN of the first symbol of the FEC Source Packet. The first block of a session MUST be assigned value 0. Then there are a maximum of 2^^16 blocks before a wrapping to 0 of this field occurs. Source Block Number Offset (SBN_offset) (8 bit field): this field contains the offset that needs to be added to 1st_SBN to obtain the SBN to which the first source symbol of this FEC Source Packet belongs to (remember there can be several source blocks per ADUI). There are a maximum number of 256 source blocks per ADU block. Encoding Symbol ID (ESI) (8 bit field): this field identifies the first source symbol associated to this FEC Source Packet in the source block (remember there can be several source symbols per ADUI, Section 4.2). This value belongs to interval {0 .. k - 1} inclusive for source symbols. The format of the FEC Payload ID is illustrated in Figure 13. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | 1st Src Blk Number (16 bits) | SBN_offset | Enc. Symb. ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 13: Source FEC Payload ID encoding format. 6.1.3. Repair FEC Payload ID A FEC repair packet MUST contain a Repair FEC Payload ID that is prepended to the repair symbol(s) as illustrated in Figure 9. More precisely, the Explicit Source FEC Payload ID is composed of: First Source Block Number (1st_SBN) (16 bit field): this field contains the SBN of the first source block of the ADU block. It is meant to identify the ADU block itself. Note that this is not necessarily the SBN of the first symbol of the FEC Repair Packet. Source Block Number Offset (SBN_offset) (8 bit field): this field contains the offset that needs to be added to 1st_SBN to obtain the SBN to which the first repair symbol of this FEC Repair Packet belongs to (remember there can be several source blocks per ADUI). There are a maximum number of 256 source blocks per ADU block. Encoding Symbol ID (ESI) (8 bit field): this field identifies the first repair symbol associated to this FEC Repair Packet in the source block (remember there can be several source symbols per ADUI, Section 4.2). This value belongs to interval {k .. n - k - 1} inclusive) for repair symbols. Roca, et al. Expires January 14, 2010 [Page 19] Internet-Draft Reed-Solomon FEC Schemes July 2009 Total number of source symbols (tot_k) (16 bit field): this field indicates the total number of source symbols in this ADU block. Reserved (8 bit field): this field is reserved for future use and MUST be set to 0 in the current specification. Number of Source Blocks (NumSB) (8 bit field): this field indicates the number of source blocks for this ADU block. The format of the FEC Payload ID is illustrated in Figure 14. 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | 1st Src Blk Number (16 bits) | SBN_offset | Enc. Symb. ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | tot_k | reserved | Num Src Blocks| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Figure 14: Repair FEC Payload ID encoding format. Thanks to the tot_k and NumSB information, the receiver is capable of defining the length of each source block of this ADU block, an information needed by the Reed-Solomon codec (Section 6.2). 6.2. Procedures The source block creation procedures are specified in Section 4.3. More precisely: o the length indication for the ADU i, used to compute the L[i] field, is the actual length of the ADU i. It MUST NOT include FID[i], L[i], Pad[i], nor the Explicit Source FEC Payload ID. o The SBN value is incremented for each new source block, starting at 0 for the first Source BLock of the session. Wrapping to zero will happen for long sessions, after value 2^^(16) - 1. o The ESI of source symbols of a given source block are managed sequentially, starting at 0 for the first symbol. At a receiver, the NumSB source blocks must be correctly reconstructed from the received FEC Source and Repair Packets, even in presence of erasures. It requires in particular that the source symbols associated to the ADUI of a received FEC source packet be correctly assigned to the various source blocks. Thanks to the Explicit Source FEC Payload ID, this latter fully identifies the source block and position within this source block for the first source symbol. Concerning the remaining source symbols of this ADUI, the following algorithm is used: We assume that at least one FEC Repair Packet for this ADU block has been received (otherwise FEC decoding is anyway impossible). Then let: Roca, et al. Expires January 14, 2010 [Page 20] Internet-Draft Reed-Solomon FEC Schemes July 2009 ADUI.s be the size of the ADUI corresponding to the received FEC Source Packet, in units of symbols. NumSB be the number of source blocks for this ADU block. This information is contained in the Repair FEC payload ID. src_symbols_to_src_blocks_assignment_at_a_receiver (ADUI, /* ADUI associated to recv'd FEC Src Pkt */ FPI) /* packet's Source FEC Payload ID */ { int SB_idx; /* index of current source block */ SB_idx = FPI.SBN; /* start with the 1st source symbol */ for (j = 0; j < ADUI.s; j++) { /* for all symbols of this ADUI */ add ADUI.src_symbol[j] to src_block[SB_idx]; SB_idx = (SB_idx + 1) % NumSB; } } Figure 15: Source symbols to source block interleaving algorithm for a received ADUI. The second constraint is that a receiver be able to define the length of each source block of this ADU block. To that purpose, after receiving the first FEC Repair Packet for this ADU block, the following algorithm is used: adu_block_structure_definition_at_a_receiver (FPI) /* packet's Repair FEC Payload ID */ { int SB_idx; /* index of current source block */ int k1; /* all src blocks are at least that long */ int rem; /* and the first rem have 1 extra symbol */ k1 = floor(FPI.tot_k / FPI.NumSB); /* the integral part... */ rem = FPI.tot_k % FPI.NumSB; /* ...and the modulo */ for (SB_idx = 0; SB_idx < FPI.NumSB; SB_idx++) { if (SB_idx < rem) { src_block[SB_idx].k = k1 + 1; } else { src_block[SB_idx].k = k1; } } } Figure 16: ADU Block structure algorithm at a receiver. Roca, et al. Expires January 14, 2010 [Page 21] Internet-Draft Reed-Solomon FEC Schemes July 2009 6.3. FEC Code Specification The present document inherits from [RFC5510] the specification of the core Reed-Solomon codes based on Vandermonde matrices. 7. Reed-Solomon Simple FEC Encoding Scheme over GF(2^^m) for a Single Sequenced ADU Flow TBD 8. Reed-Solomon Interleaved FEC Encoding Scheme over GF(2^^8) for a Single Sequenced ADU Flow TBD 9. Security Considerations 9.1. Problem Statement A content delivery system is potentially subject to many attacks. Some of them target the network (e.g., to compromise the routing infrastructure, by compromising the congestion control component), others target the Content Delivery Protocol (CDP) (e.g., to compromise its normal behavior), and finally some attacks target the content itself. Since this document focuses on various FEC schemes, this section only discusses the additional threats that their use within the FECFRAME framework can create to an arbitrary CDP. More specifically, these attacks may have several goals: o those that are meant to give access to a confidential content (e.g., in case of a non-free content), o those that try to corrupt the ADU Flows being transmitted (e.g., to prevent a receiver from using it), o and those that try to compromise the receiver's behavior (e.g., by making the decoding of an object computationally expensive). These attacks can be launched either against the data flow itself (e.g. by sending forged FEC Source/Repair Packets) or against the FEC parameters that are sent either in-band (e.g., in the Repair FEC Payload ID) or out-of-band (e.g., in a session description). 9.2. Attacks Against the Data Flow First of all, let us consider the attacks against the data flow. Roca, et al. Expires January 14, 2010 [Page 22] Internet-Draft Reed-Solomon FEC Schemes July 2009 9.2.1. Access to Confidential Objects Access control to the ADU Flow being transmitted is typically provided by means of encryption. This encryption can be done within the content provider itself, by the application (for instance by using the Secure Real-time Transport Protocol (SRTP) [RFC3711]), or at the Network Layer, on a packet per packet basis when IPSec/ESP is used [RFC4303]. If access control is a concern, it is RECOMMENDED that one of these solutions be used. Even if we mention these attacks here, they are not related nor facilitated by the use of FEC. 9.2.2. Content Corruption Protection against corruptions (e.g., after sending forged FEC Source/Repair Packets) is achieved by means of a content integrity verification/sender authentication scheme. This service is usually provided at the packet level. In this case, after removing all forged packets, the ADU Flow may be sometimes recovered. Several techniques can provide this source authentication/content integrity service: o at the application level, the Secure Real-time Transport Protocol (SRTP) [RFC3711] provides several solutions to verify the authenticate and check the integrity of RTP and RTCP messages, among other services. For instance, associated to the Timed Efficient Stream Loss-Tolerant Authentication (TESLA) [RFC4383], SRTP is an attractive solution that is robust to losses, provides a true authentication/integrity service, and does not create any prohibitive processing load or transmission overhead. Yet, checking a packet requires a small delay (a second or more) after its reception with TESLA. Other building blocks can be used within SRTP to provide authentication/content integrity services. o at the Network Layer, IPSec/AH offers an integrity verification mechanism that can be used to provide authentication/content integrity services. Techniques relying on public key cryptography (digital signatures and TESLA during the bootstrap process, when used) require that public keys be securely associated to the entities. This can be achieved by a Public Key Infrastructure (PKI), or by a PGP Web of Trust, or by pre-distributing the public keys of each group member. Techniques relying on symmetric key cryptography (group MAC) require that a secret key be shared by all group members. This can be achieved by means of a group key management protocol, or simply by pre-distributing the secret key (but this manual solution has many limitations). It is up to the developer and deployer, who know the security Roca, et al. Expires January 14, 2010 [Page 23] Internet-Draft Reed-Solomon FEC Schemes July 2009 requirements and features of the target application area, to define which solution is the most appropriate. Nonetheless it is RECOMMENDED that at least one of these techniques be used. 9.3. Attacks Against the FEC Parameters Let us now consider attacks against the FEC parameters included in the FFCI that are usually sent out-of-band (e.g., in a session description). Attacks on these FEC parameters can prevent the decoding of the associated object. For instance modifying the m field (if applicable) will lead a receiver to consider a different code. Modifying the E parameter will lead a receiver to consider bad Repair Symbols for a received FEC Repair Packet. It is therefore RECOMMENDED that security measures be taken to guarantee the FFCI integrity. When the FFCI is sent out-of-band in a session description, this latter SHOULD be protected, for instance by digitally signing it. The same considerations concerning the key management aspects apply here also. 10. IANA Considerations Values of FEC Encoding IDs are subject to IANA registration. TBD 11. Acknowledgments The authors want to thank Hitoshi Asaeda for his valuable comments. 12. References 12.1. Normative References [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", RFC 2119. [RFC5052] Watson, M., Luby, M., and L. Vicisano, "Forward Error Correction (FEC) Building Block", RFC 5052, August 2007. [RFC5510] Lacan, J., Roca, V., Peltotalo, J., and S. Peltotalo, "Reed-Solomon Forward Error Correction (FEC) Schemes", RFC 5510, April 2009. Roca, et al. Expires January 14, 2010 [Page 24] Internet-Draft Reed-Solomon FEC Schemes July 2009 [FECFRAME-FRAMEWORK] Watson, M., "Forward Error Correction (FEC) Framework", draft-ietf-fecframe-framework-05 (Work in Progress), July 2009. [SDP_ELEMENTS] Begen, A., "SDP Elements for FEC Framework", draft-ietf-fecframe-sdp-elements-03 (Work in Progress), June 2009. 12.2. Informative References [RFC3453] Luby, M., Vicisano, L., Gemmell, J., Rizzo, L., Handley, M., and J. Crowcroft, "The Use of Forward Error Correction (FEC) in Reliable Multicast", RFC 3453, December 2002. [RS-codec] Rizzo, L., "Reed-Solomon FEC codec (revised version of July 2nd, 1998), available at http://info.iet.unipi.it/~luigi/vdm98/vdm980702.tgz and mirrored at http://planete-bcast.inrialpes.fr/", July 1998. [Rizzo97] Rizzo, L., "Effective Erasure Codes for Reliable Computer Communication Protocols", ACM SIGCOMM Computer Communication Review Vol.27, No.2, pp.24-36, April 1997. [RFC5170] Roca, V., Neumann, C., and D. Furodet, "Low Density Parity Check (LDPC) Forward Error Correction", RFC 5170, June 2008. [RFC5053] Luby, M., Shokrollahi, A., Watson, M., and T. Stockhammer, "Raptor Forward Error Correction Scheme", RFC 5053, June 2007. [RMT-PI-ALC] Luby, M., Watson, M., and L. Vicisano, "Asynchronous Layered Coding (ALC) Protocol Instantiation", Work in Progress, November 2007. [RMT-PI-NORM] Adamson, B., Bormann, C., Handley, M., and J. Macker, "Negative-acknowledgment (NACK)-Oriented Reliable Multicast (NORM) Protocol", Work in Progress, May 2008. [RFC4303] Kent, S., "IP Encapsulating Security Payload (ESP)", RFC 4303, December 2005. Roca, et al. Expires January 14, 2010 [Page 25] Internet-Draft Reed-Solomon FEC Schemes July 2009 [RFC3711] Baugher, M., McGrew, D., Naslund, M., Carrara, E., and K. Norrman, "The Secure Real-time Transport Protocol (SRTP)", RFC 3711, March 2004. [RFC4383] Baugher, M. and E. Carrara, "The Use of Timed Efficient Stream Loss-Tolerant Authentication (TESLA) in the Secure Real- time Transport Protocol (SRTP)", RFC 4383, February 2006. Authors' Addresses Vincent Roca INRIA 655, av. de l'Europe Inovallee; Montbonnot ST ISMIER cedex 38334 France Email: vincent.roca@inria.fr URI: http://planete.inrialpes.fr/people/roca/ Mathieu Cunche INRIA 655, av. de l'Europe Inovallee; Montbonnot ST ISMIER cedex 38334 France Email: mathieu.cunche@inria.fr URI: http://planete.inrialpes.fr/people/cunche/ Jerome Lacan ISAE/LAAS-CNRS 1, place Emile Blouin Toulouse 31056 France Email: jerome.lacan@isae.fr URI: http://dmi.ensica.fr/auteur.php3?id_auteur=5 Roca, et al. Expires January 14, 2010 [Page 26] Internet-Draft Reed-Solomon FEC Schemes July 2009 Amine Bouabdallah ISAE/LAAS-CNRS 1, place Emile Blouin Toulouse 31056 France Email: Amine.Bouabdallah@isae.fr URI: http://dmi.ensica.fr/ Kazuhisa Matsuzono Keio University Graduate School of Media and Governance 5322 Endo Fujisawa, Kanagawa 252-8520 Japan Email: kazuhisa@sfc.wide.ad.jp Roca, et al. Expires January 14, 2010 [Page 27]