view Side-By-Side changes
Internet DraftL. Zhang Expiration: May 95 PARC File: draft-ietf-rsvp-spec-04.txtR.BradenBraden, Ed. Expiration: September 1995 ISI File: draft-ietf-rsvp-spec-05.txt L.Zhang PARC D. Estrin ISI S. Herzog ISI S. Jamin USC Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification**DRAFT** November 3, 1994March 24, 1995 Status of Memo This document is an Internet-Draft. 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." To learn the current status of any Internet-Draft, please check the linebreak "1id-abstracts.txt" listing contained in the Internet- Drafts Shadow Directories on ds.internic.net (US East Coast), nic.nordu.net (Europe), ftp.isi.edu (US West Coast), or munnari.oz.au (Pacific Rim). Abstract This memo describes version 1 of RSVP, a resource reservation setup protocol designed for an integrated services Internet. RSVP provides receiver-initiated setup of resource reservations for multicast or unicast data flows, with good scaling and robustness properties.Zhang,Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 1] Internet Draft RSVP SpecificationNovember 1994March 1995 What's Changed SinceSeattleToronto IETF This version of the document incorporates many of the protocol changes agreed to at the December 1994 IETF meeting in San Jose. The most major changes are: oRedesign genericThe RSVPAPI (section 3.6.2)packet format has been reorganized to carry most data as typed variable-length objects. oChange encoding of style in RESV messages (section 3.1.2)This generality includes provision for 16-byte IP6 addresses. oClarify filterspec functions (section 2.1)Filter specs have been simplified. oSimplify definition ofDF style(sections 2.2, 2.4).has been moved to an Appendix, as experimental. oRevise discussion of flowspec merging (section 2.3.3).UDP encapsulation has been included. oChange format of variable-length filterspecs and flowspecs (section 3.1 and 3.6.1).OPWA has been included. oAdd a user authentication field in all RSVP messages (Section 3).The Drop flag has been eliminated. oAdd short discussion of local repair (Section 3.3.3).Session groups have been added. oEditorial nits.The routing of RERR messages has been changed. 1. Introduction Thismemo describesdocument defines RSVP, a resource reservation setup protocol designed for an integrated services Internet [RSVP93,ISInt93].An application invokesA host uses the RSVP protocol to request a specific quality of service( QoS) for a(QoS) from the network, on behalf of an application data stream.Hosts and routers useRSVP is also used to delivertheseQoS requests totherouters along the path(s) of the data stream and to maintain router and host state to provide the requested service. This will generallyrequires(but not necessarily) require reserving resourcesin those nodes. At each "node" (i.e., router or host)along thepath,data path. RSVPpasses a new resource reservation request to an admission control routine, to determine whether there are sufficientreserves resourcesavailable. If there are, the nodefor simplex data streams, i.e., it reservestheresourcesand updates its packet scheduler and classifier control parameters to provide the requested QoS [ISInt93]. It is expected that RSVP implementations will execute in user spacein only one direction on ahost, and in background inlink, so that arouter. On the other hand,sender is logically distinct from a receiver. However, thepacket schedulersame application may act as both sender andclassifier are expected to execute in the kernel of a host operating system, and in the high-speed packet forwarding path of a router. RSVP messages are sent as IP datagrams; thus,receiver. RSVPoccupiesoperates on top of IP, occupying the place of a transport protocol in the protocol stack. However, like ICMP, IGMP, and routing protocols, RSVP does not transport application data but isreallyrather an Internet controlZhang,protocol. As shown in Figure 1, an implementation of RSVP, like the implementations of routing and management protocols, will typically Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 2] Internet Draft RSVP SpecificationNovember 1994 protocol; it does not carry any application data, and its messages are processed byMarch 1995 execute in theroutersbackground, not in the data forwarding path. RSVP is not itself a routingprotocol, but rather it is designed to operate with existing and future unicast and multicastprotocol; the RSVP daemon consults the local routingprotocols.protocol(s) to obtain routes. Thus, a host sends IGMP messages to join a multicast group, andthenit sends RSVP messages to reserve resources along thedeliverdelivery path(s) from that group.Unlike a routing protocol,RSVP isexplicitly invoked by applications,designed toobtain a special QoS. The objectivesoperate with existing andgeneral justification forfuture unicast and multicast routing protocols. HOST ROUTER _________________________ RSVPdesign are presented in [RSVP93,ISInt93]. In summary,______________________ | | .---------------. | | _______ ______ | . | ________ . ______ | | | | | | | . || | . | || RSVPhas the following attributes: o| |Applic-| | RSVPsupports multicast or unicast data delivery and adapts to changing group membership as well as changing routes. o<----- ||Routing | -> RSVPreserves resources for simplex<------> | | App <----->daemon| | ||Protocol| |daemon|| | | | | | | || daemon <----> || | |_______| |___.__| | ||_ ._____| |__.___|| |===|===============v=====| |===v=============v====| | datastreams. o RSVP is receiver-oriented, i.e., the receiver of a.......... | | . ............ | | | ____v_ ____v____ | | _v__v_ _____v___ | | | |Class-| | || dataflow is responsible for the initiation| |Class-| | || data | |=> ifier|=> Packet =============> ifier|==> Packet |======> | |______| |Scheduler|| | |______| |Scheduler|| | |_________|| | |_________|| |_________________________| |______________________| Figure 1: RSVP in Hosts andmaintenanceRouters Each router that is capable oftheresource reservationused for that flow. o RSVP maintains "soft state" in the routers, enabling it to gracefully support dynamic membership changes and automatically adapt to routing changes. o RSVP provides several reservation models or "styles" (defined below)passes incoming data packets tofit a variety of applications. o RSVP provides transparent operation through routers that do not support it. The RSVP protocol mechanisms provideageneral facility for creatingpacket classifier andmaintaining distributed reservation state acrossthen queues them as necessary in amesh of multicast delivery paths. These mechanisms treatpacket scheduler. The packet classifier determines thereservation parameters as opaque data, except for certain well-defined operations,route andsimply pass them tothetraffic control modules (admission control,QoS class for each packet. The scheduler allocates a particular outgoing link for packetscheduler,transmission, andclassifier) for interpretation. Although the RSVP protocol mechanisms are largely independent of the encoding of these parameters, the encodings must be defined in the reservation model that is presented to an application (see section 3.6.1).it may also allocate other system resources such as CPU time or buffers. In order to efficiently accommodate heterogeneous receivers and dynamic groupmembership,membership and to be consistent with IP multicast, RSVP makesthereceivers responsible for requesting resource reservations [RSVP93].EachA QoS request, typically originating in a receivercan requesthost application, will be passed to the local RSVP implementation, shown as areservation thatuser daemon in Figure 1. The RSVP protocol istailoredthen used toits particular requirement,pass the request to all the nodes (routers andZhang,hosts) along the reverse data path(s) to the data source(s). Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 3] Internet Draft RSVP SpecificationNovember 1994March 1995 At each node, the RSVPwill deliver this requestprogram applies a local decision procedure, called "admission control", to determine if it can supply therouters alongrequested QoS. If admission control succeeds, thereverse path(s)RSVP program sets parameters to thesender(s). There are two aspects to RSVP, its reservation modelpacket classifier andits protocol mechanisms. Sections 2.1 and 2.2 of this memo summarizescheduler to obtain the desired QoS. If admission control fails at any node, the RSVPreservation model, while Sections 2.3 describesprogram returns an error indication to theprotocol mechanisms. Sections 2.4 gives examples of both model and mechanism,application that originated the request. We refer to the packet classifier, packet scheduler, andSection 2.5 summarizesadmission control components as "traffic control". RSVP is designed to scale well for very large multicast groups. Since themodelmembership ofRSVP seen byahost. Section 3 presentslarge group will be constantly changing, thefunctional specificationRSVP design assumes that router state forRSVP. 2.traffic control will be built and destroyed incrementally. For this purpose, RSVPOverview 2.1uses "soft state" in the routers, in addition to receiver-initiation. RSVPReservation Model Figure 1 illustratesprotocol mechanisms provide asinglegeneral facility for creating and maintaining distributed reservation state across a mesh of multicastdistribution session. The arrows indicateor unicast delivery paths. RSVP transfers reservation parameters as opaque dataflowing from senders S1 and S2(except for certain well-defined operations on the data), which it simply passes toreceivers R1, R2, and R3, andtraffic control for interpretation. Although thecloud representsRSVP protocol mechanisms are largely independent of thedistribution mesh created byencoding of these parameters, the encodings must be defined in the reservation model that is presented to an application (see Appendix A). In summary, RSVP has the following attributes: o RSVP supports multicastrouting protocol. Multicast distribution forwards a copy of eachor unicast datapacket from a sender Si to every receiver Rj. Each sender Sidelivery andreceiver Rj may correspondadapts to changing group membership as well as changing routes. o RSVP is simplex. o RSVP is receiver-oriented, i.e., the receiver of aunique Internet host, or there may be multiple logical senders (e.g., multiple TV cameras) and/or receivers in a single host. RSVP reserves resources for simplexdatastreams, i.e., it reserves resources in only one direction on a link, so that a senderflow islogically distinct from a receiver. However,responsible for thesame application may act as both senderinitiation andreceiver. Senders Receivers _____________________ ( ) ===> R1 S1 ===> ( Multicast ) ( ) ===> R2 ( distribution ) S2 ===> ( ) ( by Internet ) ===> R3 (_____________________) Figure 1: Multicast Distribution Session All data packets in a given session are addressed tomaintenance of thesame IP destination address DestAddress. For multicast delivery, DestAddress isresource reservation used for that flow. o RSVP maintains "soft state" in themulticast group addressrouters, enabling it towhich the data is addressed. For unicast delivery, DestAddress is simply the unicast address of the single receiver.gracefully support dynamic membership changes and automatically adapt to routing changes. o RSVPidentifies a session by DestAddress plusprovides several reservation models or "styles" (defined below) to fit a32-bit stream identifier calledvariety of applications. o RSVP provides transparent operation through routers that do not support it. Further discussion on theZhang,objectives and general justification for RSVP design are presented in [RSVP93,ISInt93]. Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 4] Internet Draft RSVP SpecificationNovember 1994 "reservation id" (ResvID). We use the term "session socket" for the (DestAddress, ResvID) pair that defines a session. RSVP treats each session independently. In the restMarch 1995 The remainder of thisdocument, a particular session (hence, session socket) is always implied even if not stated. Depending uponsection describes the RSVP reservationstyle and the session state already in place, a new or modified reservation request mayservices. Section 2 presents an overview of the RSVP protocol mechanisms, while Section 3 gives examples of the services and mechanism. Section 4 contains the functional specification of RSVP. Section 5 presents explicit message processing rules. 1.1 Data Flows The set of data flows with the same unicast ormay not resultmulticast destination constitute a session. RSVP treats each session independently. All data packets in acallparticular session are directed toadmission control at each node [ISInt93]. If an admission control call fails,thereservation is rejectedsame IP destination address DestAddress, andan RSVP error message is sentperhaps to some further demultiplexing point defined in a higher layer (transport or application). We refer to thereceiver(s) responsiblelatter as a "generalized destination port". DestAddress is the group address forit. Amulticast delivery, or the unicast address of a singleRSVP resource reservation request isreceiver. A generalized destination port could be defined by a" flowspec" together with a "filterspec"; this pair is called a " Flow Descriptor". The flowspec specifies the desired QoSUDP/TCP destination port field, by an equivalent field ina quantitative manner, e.g., the tolerable delay, the average throughput,another transport protocol, or by some application-specific information. Although themaximum burstiness, etc [Partridge92, ISInt93, IServ93]; itRSVP protocol isused to set parametersdesigned to be easily extendible for greater generality, thepacket scheduling mechanism in the node (router or host). The filterspec (plus the DestAddress) definespresent version uses only UDP/TCP ports as generalized ports. Figure 2 illustrates thesetflow of data packetsto receive this service; it is used to set parametersinthe packet classifier component of the node. For all packets that are addressed toaparticularsingle RSVP session,only those that can match the filter spec(s) of that session will be forwarded according to the flowspec; the rest will be either dropped or sent as best-effort traffic. More specifically, a filterspec may have two distinct functions. o Sender Selection A filterspec may select packets that originate from a particular sender Si,assuming multicast data distribution. The arrows indicate data flowing fromthe entire stream of packets destinedsenders S1 and S2 toa given DestAddress. The sender is selected using its IP source addressreceivers R1, R2, and R3, andoptionally a "generalized source port", i.e., multiplexing field(s) atthetransport layer (e.g., a UDP destination port) and/orcloud represents theapplication layer (e.g.,distribution mesh created by the multicast routing protocol. Multicast distribution forwards aparticular subsetcopy of each data packet from ahierarchically encoded video stream). o Receiver Sub-selection A filterspec may distinguish different sessions with the same DestAddress by selectingsender Si to every receiver Rj; asubset of the packets destinedunicast distribution session has a single receiver R. Each sender Si and each receiver Rj may correspond tothat address. This subset is defined bya"generalized destination port", which againunique Internet host, or a single host mayinclude transport-layer (e.g., UDP destination port)contain multiple logical senders and/orapplication-layer demultiplexing information. An RSVP receiver Rj is defined Zhang,receivers, distinguished by generalized ports. Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 5] Internet Draft RSVP SpecificationNovember 1994March 1995 Senders Receivers _____________________ ( ) ===> R1 S1 ===> ( Multicast ) ( ) ===> R2 ( distribution ) S2 ===> ( ) ( bytheInternet ) ===> R3 (_____________________) Figure 2: Multicast Distribution Session 1.2 Reservation Model An elementary RSVP reservation request consists of a "flowspec" together with a "filter spec"; this pair(Hj, Pj), where Hjis called a "flow descriptor". The flowspec specifies a desired QoS. The filter spec (together with theIP host addressDestAddress andPj isthe generalized destinationport. RSVP needs to distinguish different sessions. It is difficult to do this by matching generalized destination ports buried withinport defining thefilterspecs, sincesession) defines thepartset of data packets -- thefilterspec that defines the generalized destination port should be opaque"flow" -- toan RSVP module in a router, which does not not knowreceive thestructure of transport or application layer protocol headers. Therefore, RSVP identifies a sessionQoS defined by thepair (DestAddress, ResvID), where the ResvID's form a simple space of identifiers that RSVP can use to distinguish different sessions with the same DestAddress.flowspec. TheResvID's need not themselves be (generalized) ports, butflowspec is used to set parameters to the packet scheduler in theResvID valuesnode (assuming thatare used must have a one-to-one correspondence withadmission control succeeds), while thegeneralized portsfilter spec is used to set parameters inuse forthegiven DestAddress. Allpacket classifier. The flowspec in a reservationrequests forrequest will generally include agiven session must use filterspecs that specify the same DestAddressservice type andthe same generalized destination port (since receiverstwo sets of numeric parameters: (1) an " Rspec" (R for `reserve'), which defines thesame substream, downstream of a given node, must sharedesired per-hop reservation, and (2) acommon resource reservation in"Tspec" (T for `traffic'), which defines the parameters thatnode). 2.2 Reservation Styles In additionmay be used to police theFlow Descriptors, each RSVP reservation request specifies a "reservation style".data flow, i.e., to ensure it does not exceed its promised traffic level. Thefollowing reservation styles have been defined so far. 1. Wildcard-Filter (WF) Style A Wildcard-Filter (WF) stylegeneral RSVP reservationcreates a single resource "pipe" along each link, shared by data packets from all senders formodel allows filter specs to select arbitrary subsets of the packets in a given session.The "size" of this pipe is the largest of the resource requests for that link from all receivers, independent of the numberSuch subsets might be defined in terms of sendersusing it. (The concept(i.e., sender IP address and generalized source port), in terms of a"largest" flowspec is discussed later). The term "wildcard" implies a filterspec that selects all senders. A WF reservation automatically extendshigher-level protocol, or generally in terms of any fields in any protocol headers in the packet. For example, filter specs might be used tonew sendersselect different subflows in a hierarchically-encoded signal, by selecting on fields in an application-layer header. However, considerations of both architectural purity and practical requirements have led to thesession, as they appear. 2. Fixed-Filter (FF) Style A Fixed-Filter (FF) style reservation request creates reservation(s)decision that RSVP should use separate sessions fordata packets from particular sender(s). A FF reservation request from a particular receiver Rj contains a list of one or more Flow Descriptors, each consistingdistinct subflows ofa filterspec, which specifies some sender Si, and a Zhang,hierarchically-encoded signals. For multicast sessions, subflows can be distinguished by multicast destination address; for unicast sessions, they must be Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 6] Internet Draft RSVP SpecificationNovember 1994 corresponding flowspec. FF reservations requestedMarch 1995 distinguished bydifferent receivers Rj but selecting the same sender Si must necessarily share a single reservation indestination port. As agiven node. This is simply theresult ofmulticast distribution, which createsthese considerations, the present RSVP version includes asingle streamquite restricted definition ofdata packetsfilter specs, selecting only on sender IP address and UDP/TCP port number, and on protocol id. However, the design of the protocol would easily handle a more general definition in future versions. Any packets that are addressed to a particularrouter fromsession but do not match anySi, regardlessof thenumber of receivers downstream. The reservationfilter specs forSithat session will bethe maximum of the individual flowspecs from different downstream receivers Rj (see Section 2.3.3). FF reservations for different senders are distinct; they do NOT share a common pipe. The total reservation on a link for a given session is therefore the cumulative total of the reservations for each requested sender. A receiver that has established a FF style reservation may modify, add, or delete a flow descriptor at any time. However, any additional or modified reservationssent as best-effort traffic. Under congested conditions, such packets aresubjectlikely toadmission controlexperience long delays and mayfail. 3. Dynamic-Filter (DF) Stylebe dropped. ADynamic-Filter (DF) style reservation decouples reservations from filters. Each DF reservation request specifies a number D of distinct reservationsreceiver may wish tobe made usingconserve network resources by explicitly asking thesame specified flowspec. The number of reservations that are actually made in a particular nodenetwork to drop those data packets for which there isD' = min(D,Ns),no reservation; however, such dropping should be performed by routing, not by RSVP. Determining whereNspackets get delivered should be a routing function; RSVP is concerned only with thetotal numberQoS ofsendersthose packets that are delivered by routing. RSVP reservation request messages originate at receivers and are passed upstreamoftowards thenode. In additionsender(s). (Note that this document always uses the directional terms "upstream" vs. "downstream", "previous hop" vs. "next hop", and "incoming interface" vs "outgoing interface" with respect toD andtheflowspec, a DF styledata flow direction). When an elementary reservationmay also specifyrequest is received at alist of K filterspecs, for some K in the range: 0 <= K <= D'. These filterspecs define particular senders to usenode, theD' reservations. OnceRSVP daemon takes two primary actions. 1. Make aDFreservationhas been established,The flowspec and thereceiver may changefilter spec are passed to traffic control. Admission Control determines thesetadmissibility offilterspecs to specify a different selection of senders, without a new admission control check (assuming D'the request (if it's new); if it fails this test, the reservation is rejected and RSVP sends back an error message towards the responsible receiver(s). If it passes, thecommonflowspecremain unchanged). Thisisknown as "channel switching", in analogy with a television set. In orderused toprovide assured channel switching, each node alongset up thepath must reserve enough bandwidthpacket scheduler forall D' channels, even though some of this bandwidth may be unused at any one time. If D' changes (becausethereceiver changed D or becausedesired QoS and thenumber Ns of upstream sources changed), or iffilter spec is used to set thecommon flowspec changes,packet classifier to select therefresh messageappropriate data packets. 2. Forward reservation upstream. The reservation request istreated aspropagated upstream towards the appropriate senders. The set of senders to which anewgiven reservation request is propagated is called the "scope" of that request. The reservation request that a node forwards upstream may differ from the request that it received, for two reasons. First, it issubjectpossible (at least in theory) for the kernel toadmission control and Zhang,modify the flowspec hop-by-hop (although currently no realtime services do Braden, Zhang, et al. Expiration:May 95 FORMFEED[PageSeptember 1995 [Page 7] Internet Draft RSVP SpecificationNovember 1994 may fail. Like a FF style request, a DF style request causes distinctMarch 1995 this). Second, reservationsfor different senders. As noted earlier, those data packetsfromsenders that are not currently selected may eitherdifferent downstream branches of the multicast distribution tree(s) must bedropped or sent best- effort. WF"merged" as reservations travel upstream. Merging reservationsare appropriate for those multicast applications whose application-level constraints prohibit all data sources from transmitting simultaneously; one exampleisaudio conferencing, wherealimited numbernecessary consequence ofpeople talk at once. Thus, each receiver might issuemulticast distribution, which creates aWFsingle stream of data packets in a particular router from any Si, regardless of the set of receivers downstream. The reservationrequestfortwice one audio channel (to allow some over-speaking). On the other hand,Si on a particular outgoing link L should be theFF and DF styles create independent reservations for"maximum" of theflowsindividual flowspecs fromdifferent senders; this is required for video signals, whose `silence' periods, if any, are uncoordinated among different senders. The essential difference betweentheFF and DF styles isreceivers Rj that are downstream via link L. Merging is discussed further in Section 2.3. For both of these primary actions, there are options controlled by theDF style allows areceiverto switch channels without danger of an admission denial due to limited resources (unless a topology change reroutes traffic alongmaking the reservation. These options are combined into alower-capacity path or new senders appear), oncecontrol variable called theinitial reservations have been made. Otherreservationstyles may be defined"style", which is discussed in section 1.3. One option concerns thefuture. 2.3 RSVP Protocol Mechanisms 2.3.1 RSVP Messages Each receiver host sends RSVP reservation (RESV) messages into the Internet, carrying Flow Descriptors requestingtreatment of reservations for different senders within thedesired reservation; see Figure 2. Thesesame session: establish a "distinct" reservationmessages must followfor each upstream sender, or else "mix" all senders' packets into a single reservation. Another option controls thereversescope of theroutes the data packets will use,request: "unitary" (i.e., a single specified sender), an explicit sender list, or a "wildcard" that implicitly selects allthe waysenders upstreamto allof thesenders. If agiven node. The basic RSVP reservationrequest fails at any node, an RSVP error messagemodel isreturned to the receiver; however, RSVP"one pass": a receiver sendsno positive acknowledgment messages to indicate success. RESV messages are finally delivered to the sender hosts, so thata reservation request upstream, and each node in thehostspath canset up appropriate traffic control parameters foronly accept or reject thefirstrequest. This scheme provides no way to make end-to-end service guarantees; the QoS request is applied independently at each hop.Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 8] Internet Draft RSVP Specification November 1994 Sender Receiver _____________________ Path --> ( ) Si =======> ( Multicast ) Path --> <-- Resv ( ) =========> Rj ( distribution ) <-- Resv (_____________________) Figure 2:RSVPMessages Each sender transmitsalso supports an optional reservation model, known as " One Pass With Advertising" (OPWA) [Shenker94]. In OPWA, RSVPPATH messages forward along the uni-/multicast routes provided bycontrol packets sent downstream, following therouting protocol(s). These "Path" messages store path state in alldata paths, are used to gather information on theintermediate routers.end-to-end service that would result from a variety of possible reservation requests. Thepath state is currently usedresults ("advertisements") are delivered by RSVP toroute the RESV messages inthereverse direction from eachreceiver host, and perhaps toall selected senders for a given session. Inthefuture, this functionreceiver application. The information may then beassumedused byrouting protocols. PATH messages have other functions; they carrythe receiver to construct an appropriate reservation request. 1.3 Reservation Styles Each RSVP reservation request specifies a "reservation style". The followingadditional information: o A sender template, which describes the formatreservation styles are defined in this version ofdata packets thatthesender will originate.protocol. 1. Wildcard-Filter (WF) Style Thesender template takes the form of two bitstrings forming a (value, mask) pair. Zero mask bits represent "don't care" (variable) bits in data packets. If present, this template is used by RSVP to matchWF style specifies thefilterspecs inoptions: "mixing" reservation and " wildcard" reservation scope. Thus, aRESV message. Without suchWF-style reservation creates atemplate in the path state, there will be no feedback (except poor service) to the receiver that sets an impossible filter by mistake. ISSUE: Should sender templates be defined to be precisely filterspecs, or should templates and filterspecs be allowed to use different syntax? o A flowspec defining an upper bound on the traffic that will be generated.single reservation into which flows from all upstream senders are mixed. Thisflowspec can be used by RSVP to prevent over-reservationon the non-shared links starting at the sender. Zhang,may be thought Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 9]September 1995 [Page 8] Internet Draft RSVP SpecificationNovember 1994 A (template, flowspec) pair in a PATH message is called a Sender Descriptor. 2.3.2 Soft State To maintain reservation state, RSVP keeps "soft state" in router and host nodes. RSVP soft state is created and periodically refreshed by PATH and RESV messages, and it can be removed at each node by explicit "Teardown" messages. RSVP also hasMarch 1995 of atimer-driven cleanup procedure if no messageshared "pipe", whose "size" isreceived within a cleanup timeout interval. When the route changes,thenext PATH message will initialize the path state on the new route, and future RESV messages will establish reservation state whilelargest of thestate onresource requests for that link from all receivers, independent of thenow-unused segmentnumber of senders using it. A WF-style reservation has wildcard scope, i.e., theroute times out. Thus, whether a message is "new" or a "refresh"reservation isdetermined separately at each node, depending upon the existence of state at that node. (This document will use the term "refresh message" in this effective sense, to indicate an RSVP message that does not modify the existing state at the node in question.) RSVP sendspropagated upstream towards allits messages as IP datagrams without any reliability enhancement. Periodic transmission of refresh messages by hosts and routers is expected to replace any lost RSVP messages. However, the traffic control mechanism should be statically configured to grant high-reliability servicesenders. A WF-style reservation automatically extends toRSVP messages,new senders toprotect RSVP messages from severe congestion. Iftheset of senders Si or receivers Rj changes, or if any ofsession as they appear. 2. Fixed-Filter (FF) Style The FF style specifies thereceivers'options: "distinct" reservationrequests change, the RSVP state is adjusted accordingly. RSVP believes the latest PATHandRESV messages (ignoring the possibility of reordering). To modify a reservation,areceiver simply starts sending the new values. It is not necessary (although it may sometimes be desirable, when the resources being consumed are "valuable"), to tear down the old"unitary" reservationexplicitly. Whenscope. Thus, an elementary FF- style reservation request creates aRESV message is received atdistinct reservation for data packets from arouter or sender host, the RSVP module checks whetherparticular sender, not mixing them with other senders' packets for themessage issame session. The total reservation on anew orlink for amodified reservation request, or whether it simply refreshes an existing reservation. A new or modified requestgiven session ispassed totheadmission control moduletotal of the FF reservations fora decision. Ifall requested senders. On thereservation is accepted, RSVP sets up (or modifies)other hand, FF reservations requested by different receivers Rj but selecting the same sender Si must necessarily be merged to share a single reservation in a given node. WF reservations are appropriate for those multicast applications whose application-specific constraints make it unlikely that multiple data sources will transmit simultaneously. One example is audio conferencing, where a limited number of people talk at once; each receiver might issue a WF reservation request for twice one audio channel (to allow some over-speaking). On the other hand, the FF style, which creates independent reservations for the flows from different senders, is appropriate for video signals. The WF andfilter state. It also forwardsFF styles are incompatible and cannot be combined within a session. Other reservation styles may be defined in theRESVfuture (see Appendix C). 2. RSVP Protocol Mechanisms 2.1 RSVP Messages There are two fundamental RSVP messagetotypes, RESV messages and PATH messages. Each receiver host sends RSVP reservation request (RESV) messages towards thenext reverse- hop router(s) or sender host(s), as determined bysenders. These reservation messages must follow in reverse thepath (or routing) state. If RSVP onroutes thenode rejectsdata packets will use, all thereservation request dueway upstream toadmission control failure orthe senders within the scope. RESV messages are delivered tosome processing Zhang,the sender hosts, so that the hosts can set up appropriate traffic Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 10]September 1995 [Page 9] Internet Draft RSVP SpecificationNovember 1994 error, it discardsMarch 1995 control parameters for theRESV message and returnsfirst hop. If a reservation request fails at any node, an RSVP error message is returned to theoriginating receiver host. If the request modifies a previous reservation,receiver; however, RSVPmay immediately remove the old state, or it may simply letsends no positive acknowledgment messages to indicate success. Sender Receiver _____________________ Path --> ( ) Si =======> ( Multicast ) Path --> <-- Resv ( ) =========> Rj ( distribution ) <-- Resv (_____________________) Figure 3: RSVP Messages Each sender transmits RSVP PATH messages forward along theolduni- /multicast routes provided by the routing protocol(s); see Figure 3. These "Path" messages store path state in each node. Path statetime out since itisno longer being refreshed;used by RSVP to route thedetails depend uponRESV messages hop-by-hop in thestyle andreverse direction. (In the future, some routing protocols may supply reverse path forwarding information directly, without path state). PATH messages may also carry the following information: o Sender Template The Sender Template describes the format of data packets that the sender will originate. This template is in the form of a filter spec that could be used to select this sender's packets from others in the same session on the same link. o Tspec The PATH message may optionally carry a flowspec containing only a Tspec, defining an upper bound on the traffic level that the sender will generate. This Tspec can be used by RSVP to prevent over-reservation (and perhaps unnecessary Admission Control failure) on the non-shared links starting at theimplementation.sender. o Adspec The PATH message may carry a package of OPWA advertising information, known as an "Adspec". Braden, Zhang, et al. Expiration: September 1995 [Page 10] Internet Draft RSVP Specification March 1995 Previous Incoming Outgoing Next Hops Interfaces Interfaces Hops _____ _____________________ _____ | | data --> | | data --> | | | A |-----------||------------|a c |--------------| C | |_____| <-- Resv | | <-- Resv |_____| Path --> | | Path --> _____ _____ | ROUTER |Router|_____| |_____| |data -->| |data -->| |--| D | ||-----------| |------------|B |--| data-->| | data --> | |_____| |_____| |--------| b d |-----------| |<-- Resv| | <-- Resv | _____ _____ |<-- Resv |_____| Path --> |_____________________|Path-->|_____________________| Path -->Figure 3: Router Using RSVP Figure 3| | | | | | |--| D' | | B' |--| | |_____| |_____| | | Figure 4: Router Using RSVP Figure 4 illustrates RSVP's model of a router node. Each data stream arrives from a previous hop through a corresponding incoming interface and departs through one or more outgoing interface(s).Since the same host may be hosting both sender and receiver applications for a given session, theThe same physical interface may act in both the incoming and outgoing roles (for different datastreams). The interfaces shownflows but the same session). As illustrated in Figure3 may be physical interfaces (e.g., to point-to-point links), or they4, there may belogical interfaces that reachmultiplenodes through the same physical interface. Multipleprevious hops and/or next hops through a given physicalinterface caninterface. This may result fromeitherthe connected network being a shared medium(e.g., an Ethernet),or from the existence of non-RSVP routers in the path to the next RSVP hop (see Section3.5). It is generally necessary for2.6). An RSVPto track both logical and physical interfaces on bothdaemon must preserve theincomingnext andoutgoing sides. Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 11] Internet Draft RSVP Specification November 1994 2.3.3 Merging RSVP Messages Whenever possible, the control information arrivingprevious hop addresses inRSVP messages for a given session is combined into fewer outgoing messages; thisits reservation and path state, respectively. A RESV message isknown generically as "merging". Those messages that causesent with astate change are forwarded without delay, while the refresh messages may be merged into fewer messages, perhaps only one per session. For PATH messages, merging implies collecting togetherunicast destination address, theSender Descriptors from multiple incoming messages intoaddress of asingle outgoingprevious hop. PATHmessage. For RESVmessages,merging implies that onlyon theessential (e.g.,other hand, are sent with thelargest)session destination address, unicast or multicast. Although multiple next hops may send reservation requestsneed be forwarded, once per refresh period; redundant messages are "purged". A successful reservation request will propagate as far asthrough theclosest point(s) alongsame physical interface, thesink treefinal effect should be tothe sender(s) whereinstall a reservationlevel equal or greater than that being requested has been made. Aton thatpoint, the merging processinterface, which is defined by an effective flowspec. This effective flowspec willdrop it in favor of another, equal or larger, reservation request. To allow merging, each node must save the state from received messages and then periodically generate cumulative PATH and RESV messages from the saved state, tobeforwarded in place ofthereceived messages. Thus, new refresh messages are created hop-by-hop inside"maximum" of thenetwork, at a rate determinedflowspecs requested bya "refresh period". Since messages that modifythestate indifferent next hops. In turn, anode ("new" messages) areRESV message forwardedwithout delay, the refresh period does not affect the rate at which new state propagates from end to end (when packets are not lost). Although flowspecs are opaque to RSVP, merging requires the abilitytodetermine which of two flowspecs is "larger", i.e. whether one represents a stricter request (and hence representsalarger resource commitment) than the other. However,particular previous hop carries a flowspecmay be a complex multi-dimensional vector, so the "larger-than" relationship may not be defined for a given pair of flowspecs. For example, consider two flowspecs Fls1 and Fls2, where Fls2 asks for a lower throughput but shorter delaythatFls1. It is not clear whichis"larger", so we say they are "incompatible". There are several possible solutions to merging incompatible flowspecs. (1) Comparethe "maximum" over the effective reservations ona single dimension, e.g., comparethethroughput requirement (average bit rate) only. Zhang,Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 12]September 1995 [Page 11] Internet Draft RSVP SpecificationNovember 1994 (2) Construct a third flowspec thatMarch 1995 corresponding outgoing interfaces. Both cases represent merging, which isgreater than eachdiscussed further below. There are a number ofthe two being compared. In the example above, we could constructways for athird flowspec Fls3 by combiningnew reservation request to fail in a given node. 1. There may be no matching path state (i.e., thehigher throughput from Fls1scope may empty), which would prevent the reservation being propagated upstream. 2. Its style may be incompatible with thelower delay from Fls2. (3) Treatstyle(s) of existing reservations for thecompatibility assame session on the same outgoing interface, so anerror that shouldeffective flowspec cannot beavoided by applications. The choice of one of these approaches shouldcomputed. 3. Its style may begoverned by flags inincompatible with theflowspec itself, not by RSVP. Notestyle(s) of reservations thatthis problem cannotexist on other outgoing interfaces but will beavoided by refraining from merging flowspecs. If incompatible flowspecs were notmergedatwith this reservation when aparticular node A, then they would arrive at the next node upstream, say B, in separate RESV messages. This may also happen if there are multiple next hops across the same outgoing interface. Node B would haverefresh message tomakecreate areservationrefresh message for thelargest flowspec, if thatprevious hop. 4. The effective flowspec may fail admission control. In any of these cases, an error message isdefined, or one that dominates all the given flowspecs; that is, it must merge the unmerged reservations. Thus, failingreturned tomerge simply movestheproblem one node upstream. This mechanism, reservingreceiver(s) responsible for thehighest demand at each node, allows an application to increase anmessage, but any existing reservationrequest immediately (assuming admission control does not fail for the larger flowspec). Decreasingis left in place. This prevents a new, very large, reservationhas to be handled more cautiously, however. The arrival of a RESV messagefrom disrupting the existing QoS by merging with anapparently decreasedexisting reservationmight be caused by the loss of a merged RESV message downstream. Therefore, an RSVP should not "believe" aand then failing admission control. 2.2 Soft State To maintain reservationdecrease until the cleanup timeout has passed. The refresh periodstate, RSVP keeps "soft state" in router andthe cleanup timeout must obey the following general principles: A. The refresh period must be long enough to keephost nodes. RSVPoverhead at an acceptable level. B. The refresh period should be short enough to allow quick adaptation to routesoft state is created andmulticast membership changes. Applications may differ in their sensitivity to service outages,periodically refreshed by PATH andtherefore they should be able to Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 13] Internet Draft RSVP Specification November 1994 adjust the refresh period for their session state. However,RESV messages. The state is deleted if no refreshes arrive before thetechniqueexpiration of"local repair" (see Section 3.3.3) can provide rapid adaptation despitealong refresh period. C. The timeout period must"cleanup timeout" interval; it may also belong enough to allow for lossdeleted as the result ofindividual RSVP messages. 2.3.4 Teardown Asanoptimization to releaseexplicit "Teardown" message. It is not necessary (although it may be desirable, since the resourcesquickly, RSVP teardown messages removebeing consumed may be "valuable"), to explicitly tear down an old reservation. When a route changes, the next PATH message will initialize the pathand reservationstatewithout waiting foron thecleanup timeout period. RSVPnew route, and future RESV messagesare not delivered reliably, butwill establish reservation state, while the state on the now-unused segment of the route willeventuallytimeout even ifout. Thus, whether ateardownmessage islost. Teardown may be initiated either by an end system (sender or receiver),"new" orbyarouter as"refresh" is determined separately at each node, depending upon theresultexistence of statetimeout. A router may also initiate a teardown message asat that node. (This document uses theresult of router or link failures detected by the routing protocol. A teardown, once initiated, will be forwarded hop-by-hop without delay. There are two types of RSVP Teardown message, PTEAR and RTEAR. A PTEAR message travels towards all receivers downstream from its point of initiation and tears down path state along the way, while an RTEAR message tears down reservation state and travels towards all senders upstream from its point of initiation. A particular reservation on a node may be shared among multiple senders and/or receivers, but it must applyterm "refresh message" in this effective sense, toa unique next hop (and outgoing interface). The receipt ofindicate anRTEARRSVP messageimpliesthat does not modify thecorresponding reservationexisting statehas been removed downstream, so that the reservation can safely be deleted locally. Again,at thelocalnodewill only forward the teardown message upstream when the state namedin question.) Braden, Zhang, et al. Expiration: September 1995 [Page 12] Internet Draft RSVP Specification March 1995 In addition to themessage has been entirely removed locally. Ascleanup timeout, there is aresult, an RTEAR message will prune"refresh timeout" period. As messages arrive, the RSVP daemon checks them against the existing state; if it matches, the cleanup timeout timer on thereservationstateback (only) as far as possible. Note thatis reset and theRTEARmessagewill cease to be forwarded atis dropped. At thesame node where merging suppresses forwardingexpiration ofthe corresponding RESV messages. Consider the router configuration shown in Figure 4 below. Assume that there are reservations for source S1 on both outgoing interfaces (c)each refresh timeout period, RSVP scans its state to build and(d),forward PATH andthat the receiver R1 wantsRESV refresh messages totear downsucceeding hops. RSVP sends itsreservation state for S1. R1's RTEAR message Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 14] Internet Draftmessages as IP datagrams without reliability enhancement. Periodic transmission of refresh messages by hosts and routers is expected to replace any lost RSVPSpecification November 1994 arriving through interface (c) indicates that all reservation state for (this session and) sender S1 has been removed downstream. The current node therefore removesmessages. To tolerate K successive packet losses, theS1 reservation state from interface (c). However, since there will stilleffective cleanup timeout must bean S1 reservation on interface (d),at least K times theRTEAR message will not be forwarded any further. However, ifrefresh timeout. In addition, theoutgoing interface connects to a shared medium or if there is a non-RSVP router immediately downstream, then there may be multiple next-hop RSVP nodes downstream that are reached throughtraffic control mechanism in thesame outgoing interface, say (c). Then a single reservation maynetwork should beshared among multiple next hops.statically configured to grant high-reliability service to RSVPmust tag each reservation with the next hop(s) from which the RESV messages came, for use by teardownmessages, toavoid deleting shared state. Deletion of pathprotect RSVP messages from congestion losses. In steady state,whetherrefreshing is performed hop-by-hop, which allows merging and packing asthe result of a teardown message or because of timeout, may force adjustments in related reservation state to maintain consistencydescribed in thelocal node. Considernext section. However, if thepathreceived statefor a sender S;differs from therelated reservationstored state, the stored statewould be as follows. o Wildcard-Filter style: If Sis updated. Furthermore, if theonly senderresult will be to modify thesession, delete the reservation. o Fixed-Filter style: Delete reservations made for S. o Dynamic-Filter style: Reduce total reservation ifrefresh messages to be generated, these refresh messages must be generated and forwarded immediately. This will result in changes propagating end-to-end without delay. However, propagation of a change stops when and if itnow exceedsreaches a point where merging causes no resulting state change; this minimizes RSVP control traffic due to changes, and is essential for scaling to large multicast groups. The "soft" router state maintained by RSVP is dynamic; to change thetotal numberset ofremaining senders. 2.4 Examples We use the following notation forsenders Si or receivers Rj or to change any QoS request, a host simply starts sending revised PATH and/or RESVmessage: 1. Wildcard-Filter WF( *{r}) Here "*{r}" represents a Flow Descriptormessages. The result should be the appropriate adjustment in the distributed RSVP state, and immediate propagation to the succeeding nodes. The RSVP state associated with a"wildcard" filter (choosing all senders) andsession in aflowspec of quantity r. For simplicity we assume hereparticular node is divided into atomic elements thatflowspecsareone- dimensional, defining for examplecreated, refreshed, and timed out independently. The atomicity is determined by theaverage throughput,requirement that any sender or receiver may enter or leave the session at any time, and its statethem as a multipleshould be created and timed out independently. Management ofsome unspecified base resource quantity B. 2. Fixed-Filter Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 15] Internet DraftRSVPSpecification November 1994 FF( S1{r1}, S2{r2}, ...) This message carriesstate is complex because there may not be alist of (sender, flowspec) pairs, i.e., Flow Descriptors. 3. Dynamic-Filter DF( n, {r} ; ) or DF( n, {r} ; S1, S2, ...) This message carriesone-to-one correspondence between state carried in RSVP control messages and thecount n of channelsresulting state in nodes. Due tobe reserved, each using common flowspec r. It also carriesmerging, alist, perhaps empty, of filterspecs defining senders. Figure 4 shows schematicallysingle message contain state referring to multiple stored elements. Conversely, due to reservation sharing, arouter with two previous hops labeled (a) and (b) and two outgoing interfaces labeled (c) and (d). This topology will be assumed insingle stored state element may depend upon (typically, theexamples that follow. There are three upstream senders; packets from sender S1 (S2maximum of) state values received in multiple control messages. Braden, Zhang, et al. Expiration: September 1995 [Page 13] Internet Draft RSVP Specification March 1995 2.3 Merging andS3) arrive throughPacking A previoushop (a) ((b), respectively). There are also three downstream receivers; packets bound for R1 and R2 (R3)section explained that reservation requests in RESV messages arerouted via outgoing interface (c) ((d) respectively). In additionnecessarily merged, tothe connectivity shown in 4, we must also specifymatch the multicastrouting within this node. Assume firstdistribution tree. As a result, only the essential (i.e., the "largest") reservation requests are forwarded, once per refresh period. A successful reservation request will propagate as far as the closest point(s) along the sink tree to the sender(s) where a reservation level equal or greater than thatdata packets (hence, PATH messages) from each Si shownbeing requested has been made. At that point, the merging process will drop it inFigure 4 is routedfavor of another, equal or larger, reservation request. Although flowspecs are opaque toboth outgoing interfaces. Under this assumption, Figures 5, 6, and 7 illustrate Wildcard-Filter reservations, Fixed-Filter reservations, and Dynamic-Filter reservations, respectively. ________________ (a)| | (c) ( S1 ) ---------->| |----------> ( R1, R2) | Router | (b)| | (d) ( S2,S3 ) ------->| |----------> ( R3 ) |________________| Figure 4: Router Configuration In Figure 5,RSVP, an RSVP daemon must be able to calculate the"Receive" column shows"largest" of a set of flowspecs. This is required both to calculate theRESV messages received over outgoing interfaces (c)effective flowspec to install on a given physical interface (see the discussion in connection with Figure 4), and()to merge flowspecs when sending a refresh message upstream. Since flowspecs are generally multi-dimensional vectors (they contain both Tspec andthe "Reserve" column shows the resulting reservation state forRspec components, eachinterface. The "Send" column showsof which may itself be multi-dimensional), they are not strictly ordered. When it cannot take theRESV messages forwardedlarger of two flowspecs, RSVP must compute and use a third flowspec that is at least as large as each, i.e., a "least upper bound" (LUB). It is also possible for two flowspecs toprevious hops (a)be incomparable, which is treated as an error. The definition and(b). In the "Reserve" column, each box represents one reservation "channel", withimplementation of thecorresponding filter. As a resultrules for comparing flowspecs are outside RSVP proper, but they are defined as part ofmerging, onlythemessage withservice templates. For protocol efficiency, RSVP also allows multiple sets of path (or reservation) information for thelargest flowspec is forwarded upstreamsame session toeach previous hop. Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 16] Internet Draftbe "packed" into a single PATH (or RESV) message, respectively. (For simplicity, the protocol prohibits packing different sessions into the same RSVPSpecification November 1994 | Send | Reserve Receive | | _______ WF( *{3B} ) <- (a) | (c) | * {3B}| (c) <- WF( *{B} ) | |_______| | -----------------------|---------------------------------------- | _______ WF( *{3B} ) <- (b) | (d) | * {B} | (d) <- WF( *{3B} ) | |_______| Figure 5: Wildcard-Filter Reservation Example 1 Figure 6 shows Fixed-Filter style reservations. Merging takes place among the flow descriptors (i.e., filter spec, flowspec pairs). For example,message). 2.4 Teardown RSVP teardown messages remove path and reservation state without waiting for themessage forwardedcleanup timeout period, as an optimization toprevious hop b, towards S2 and S3, contains flow descriptors received from outgoing interfaces (c) and (d). Similarly, when FF( S1{B} ) and FF( S1{3B} )release resources quickly. Although teardown messages (like other RSVP messages) aremerged,not delivered reliably, thesingle message FF( S1{3B} ) is sent to previous hop (a), towards S1. For each outgoing interface, therestate will time out even if it is not explicitly deleted. A teardown request may be initiated either by an application in an end system (sender or receiver), or by aprivate reservation for each source that has been requested, but this private reservation is shared amongrouter as thereceivers that maderesult of state timeout. A router may also initiate a teardown message as therequest. Zhang,result of router or link failures detected by the routing protocol. Once initiated, a teardown request should be forwarded Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 17]September 1995 [Page 14] Internet Draft RSVP SpecificationNovember 1994 | Send | Reserve Receive | | ________ FF( S1{3B} ) <- (a) | (c) | S1{B}March 1995 hop-by-hop without delay. To increase the reliability of teardown, Q copies of any given teardown message can be sent. Note that a node cannot actually delete the state being torn down until it has sent Q Teardown messages; it must place the state in a "moribund" status meanwhile. The appropriate value of Q is an engineering issue. Q = 1 would be the simplest and may be adequate, since unrefreshed state will time out anyway; teardown is an optimization. If one or more Teardown message hops are lost, the router that failed to receive a Teardown message will time out its state and initiate a new Teardown message beyond the loss point. Assuming that RSVP message loss probability is small, the longest time to delete state will seldom exceed one refresh timeout period. There are two types of RSVP Teardown message, PTEAR and RTEAR. A PTEAR message travels towards all receivers downstream from its point of initiation and tears down path state along the way. A RTEAR message tears down reservation state and travels towards all senders upstream from its point of initiation. A PTEAR (RTEAR) message may be conceptualized as a reversed-sense Path message (Resv message, respectively). A teardown message deletes the specified state in the node where it is received. Like any other state change, this will be propagated immediately to the next node, but only if it represents a change. As a result, an RTEAR message will prune the reservation state back (only) as far as possible. Note that the RTEAR message will cease to be forwarded at the same node where merging suppresses forwarding of the corresponding RESV messages. The change will be propagated as a new teardown message if the result has been to remove all state for this session at this node. However, the result may simply be to change the propagated information; thus, the receipt of a RTEAR message may result in the immediate forwarding of a modified RESV refresh message. Deletion of path state, whether as the result of a teardown message or because of timeout, may force adjustments in order in related reservation state to maintain consistency in the local node. For example, when a PTEAR deletes the path state for a sender S, the adjustment in reservation depends upon the style: if the style is WF and S is the only sender to the session, delete the reservation; if the style is FF, delete only reservations for sender S. These reservation changes should not trigger an immediate RESV refresh message, since the teardown message will have already made the required changes upstream. However, at the node in which an RTEAR message stops, the change of reservation state may trigger a RESV refresh starting at that node. Braden, Zhang, et al. Expiration: September 1995 [Page 15] Internet Draft RSVP Specification March 1995 2.5 Security There are two distinct types of security concerns in RSVP. 1. Protecting RSVP Message Integrity It may be necessary to ensure the integrity of RSVP messages against corruption or spoofing, hop by hop. RSVP messages have an optional integrity field that can be created and verified by neighboring RSVP nodes. 2. Authenticating Reservation Requests RSVP-mediated resource reservations may reserve network resources, providing special treatment for a particular set of users. Administrative mechanisms will be necessary to control who gets privileged service and to collect billing information. These mechanisms may require secure authentication of senders and/or receivers responsible for the reservation. RSVP messages may contain credential information to verify user identity. The RSVP packet formats provide for both; see Section 4. 2.6 Automatic RSVP Tunneling It is impossible to deploy RSVP (or any new protocol) at the same moment throughout the entire Internet. Furthermore, RSVP may never be deployed everywhere. RSVP must therefore provide correct protocol operation even when two RSVP-capable routers are joined by an arbitrary "cloud" of non-RSVP routers. Of course, an intermediate cloud that does not support RSVP is unable to perform resource reservation, so service guarantees cannot be made. However, if there is sufficient excess capacity through such a cloud, acceptable and useful realtime service may still be possible. RSVP will automatically tunnel through such a non-RSVP cloud. Both RSVP and non-RSVP routers forward PATH messages towards the destination address using their local uni-/multicast routing table. Therefore, the routing of Path messages will be unaffected by non-RSVP routers in the path. When a PATH message traverses a non-RSVP cloud, the copies that emerge will carry as a Previous Hop address the IP address of the last RSVP-capable router before entering the cloud. This will effectively construct a tunnel through the cloud for RESV messages, which will be forwarded directly to the next RSVP-capable router on the path(s) back towards the source. Braden, Zhang, et al. Expiration: September 1995 [Page 16] Internet Draft RSVP Specification March 1995 Automatic tunneling is not perfect; in some circumstances it may distribute path information to RSVP-capable routers not included in the data distribution paths, which may create unused reservations at these routers. This is because PATH messages carry the IP source address of the previous hop, not of the original sender, and multicast routing may depend upon the source as well as the destination address. This can be overcome by manual configuration of the neighboring RSVP programs, when necessary. 2.7 Session Groups Section 1.2 explained that a distinct destination address, and therefore a distinct session, will be used for each of the subflows in a hierarchically encoded flow. However, these separate sessions are logically related. For example it may be necessary to pass reservations for all subflows to Admission Control at the same time (since it would be nonsense to admit high frequency components but reject the baseband component of the session data). Such a logical grouping is indicated in RSVP by defining a "session group", an ordered set of sessions. To declare that a set of sessions form a session group, a receiver includes a data structure we call a SESSION_GROUP object in the RESV message for each of the sessions. A SESSION_GROUP object contains four fields: a reference address, a session group ID, a count, and a rank. o The reference address is an agreed-upon choice from among the DestAddress values of the sessions in the group, for example the smallest numerically. o The session group ID is used to distinguish different groups with the same reference address. o The count is the number of members in the group. o The rank, an integer between 1 and count, is different in each session of the session group. The SESSION_GROUP objects for all sessions in the group will contain the same values of the reference address, the session group ID, and the count value. The rank values establishes the desired order among them. If RSVP at a given node receives a RESV message containing a SESSION_GROUP object, it should wait until RESV messages for all `count' sessions have appeared (or until the end of the refresh Braden, Zhang, et al. Expiration: September 1995 [Page 17] Internet Draft RSVP Specification March 1995 cycle) and then pass the RESV requests to Admission Control as a group. It is normally expected that all sessions in the group will be routed through the same nodes. However, if not, only a subset of the session group reservations may appear at a given node; in this case, the RSVP should wait until the end of the refresh cycle and then perform Admission Control on the subset of the session group that it has received. The rank values will identify which are missing. Note that routing different sessions of the session group differently will generally result in delays in establishing or rejecting the desired QoS. A "bundling" facility could be added to multicast routing, to force all sessions in a session group to be routed along the same path. 2.8 Host Model Before a session can be created, the session identification, comprised of DestAddress and perhaps the generalized destination port, must be assigned and communicated to all the senders and receivers by some out-of-band mechanism. In order to join an RSVP session, the following events happen at the end systems. H1 A receiver joins the multicast group specified by DestAddress, using IGMP. H2 A potential sender starts sending RSVP PATH messages to the DestAddress, using RSVP. H3 A receiver listens for PATH messages. H4 A receiver starts sending appropriate RESV messages, specifying the desired flow descriptors, using RSVP. H5 A sender starts sending data packets. There are several synchronization considerations. o Suppose that a new sender starts sending data (H5) but no receivers have joined the group (H1). Then there will be no multicast routes beyond the host (or beyond the first RSVP- capable router) along the path; the data will be dropped at the first hop until receivers(s) do appear (assuming a multicast routing protocol that "prunes off" or otherwise avoids unnecessary paths). o Suppose that a new sender starts sending PATH messages (H2) and immediately starts sending data (H5), and there are Braden, Zhang, et al. Expiration: September 1995 [Page 18] Internet Draft RSVP Specification March 1995 receivers but no RESV messages have reached the sender yet (e.g., because its PATH messages have not yet propagated to the receiver(s)). Then the initial data may arrive at receivers without the desired QoS. o If a receiver starts sending RESV messages (H4) before any PATH messages have reached it (H5) (and if path state is being used to route RESV messages), RSVP will return error messages to the receiver. The receiver may simply choose to ignore such error messages, or it may avoid them by waiting for PATH messages before sending RESV messages. A specific application program interface (API) for RSVP is not defined in this protocol spec, as it may be host system dependent. However, Section 4.6.1 discusses the general requirements and presents a generic API. 3. Examples We use the following notation for a RESV message: 1. Wildcard-Filter WF( *{Q}) Here "*{Q}" represents a Flow Descriptor with a "wildcard" scope (choosing all senders) and a flowspec of quantity Q. 2. Fixed-Filter FF( S1{Q1}, S2{Q2}, ...) A list of (sender, flowspec) pairs, i.e., flow descriptors, packed into a single RESV message. For simplicity we assume here that flowspecs are one-dimensional, defining for example the average throughput, and state them as a multiple of some unspecified base resource quantity B. Figure 5 shows schematically a router with two previous hops labeled (a) and (b) and two outgoing interfaces labeled (c) and (d). This topology will be assumed in the examples that follow. There are three upstream senders; packets from sender S1 (S2 and S3) arrive through previous hop (a) ((b), respectively). There are also three downstream receivers; packets bound for R1 and R2 (R3) are routed via outgoing interface (c) ((d) respectively). In addition to the connectivity shown in 5, we must also specify the Braden, Zhang, et al. Expiration: September 1995 [Page 19] Internet Draft RSVP Specification March 1995 multicast routing within this node. Assume first that data packets (hence, PATH messages) from each Si shown in Figure 5 is routed to both outgoing interfaces. Under this assumption, Figures 6 and 7 illustrate Wildcard-Filter reservations and Fixed-Filter reservations, respectively. ________________ (a)| | (c) ( S1 ) ---------->| |----------> ( R1, R2) | Router | (b)| | (d) ( S2,S3 ) ------->| |----------> ( R3 ) |________________| Figure 5: Router Configuration In Figure 6, the "Receive" column shows the RESV messages received over outgoing interfaces (c) and () and the "Reserve" column shows the resulting reservation state for each interface. The "Send" column shows the RESV messages forwarded to previous hops (a) and (b). In the "Reserve" column, each box represents one reservation "channel", with the corresponding filter. As a result of merging, only the largest flowspec is forwarded upstream to each previous hop. | Send | Reserve Receive | | _______ WF( *{3B} ) <- (a) | (c) | * {B} | (c) <- WF( *{B} ) | |_______| | -----------------------|---------------------------------------- | _______ WF( *{3B} ) <- (b) | (d) | * {3B}| (d) <- WF( *{3B} ) | |_______| Figure 6: Wildcard-Filter Reservation Example 1 Figure 7 shows Fixed-Filter style reservations. The flow descriptors for senders S2 and S3, received from outgoing interfaces (c) and (d), are packed into the message forwarded to previous hop b. On the other hand, the two different flow descriptors for sender S1 are merged into the single message FF( S1{3B} ), which is sent to previous hop (a), For each outgoing interface, there is a private Braden, Zhang, et al. Expiration: September 1995 [Page 20] Internet Draft RSVP Specification March 1995 reservation for each source that has been requested, but this private reservation is shared among the receivers that made the request. | Send | Reserve Receive | | ________ FF( S1{3B} ) <- (a) | (c) | S1{B} | (c) <- FF( S1{B}, S2{5B} ) | |________| | | S2{5B} | | |________| ---------------------|--------------------------------------------- | ________ <- (b) | (d) | S1{3B} | (d) <- FF( S1{3B}, S3{B} ) FF( S2{5B}, S3{B} ) | |________| | | S3{B} | | |________| Figure 7: Fixed-Filter Reservation Example The two examples just shown assume full routing, i.e., data packets from S1, S2, and S3 are routed to both outgoing interfaces. Assume the routing shown in Figure 8, in which data packets from S1 are not forwarded to interface (d) (because the mesh topology provides a shorter path for S1 -> R3 that does not traverse this node). _______________ (a)| | (c) ( S1 ) ---------->| --------->--> |----------> ( R1, R2) | / | | / | (b)| / | (d) ( S2,S3 ) ------->| ->----------> |----------> ( R3 ) |_______________| Figure 8: Router Configuration Under this assumption, Figure 9 shows Wildcard-Filter reservations. Since there is no route from (a) to (d), the reservation forwarded out interface (a) considers only the reservation on interface (c), so no merging takes place in this case. Braden, Zhang, et al. Expiration: September 1995 [Page 21] Internet Draft RSVP Specification March 1995 | Send | Reserve Receive | | _______ WF( *{B} ) <-FF( S1{B}, S2{5B}(a) | (c) | * {B} | (c) <- WF( *{B} ) ||________||_______| | -----------------------|---------------------------------------- | _______ WF( *{3B} ) <- (b) |S2{5B}(d) | * {3B}| (d) <- WF( * {3B} ) | |_______| Figure 9: Wildcard-Filter Reservation Example -- Partial Routing Braden, Zhang, et al. Expiration: September 1995 [Page 22] Internet Draft RSVP Specification March 1995 4. RSVP Functional Specification 4.1 RSVP Message Formats All RSVP messages consist of a common header followed by a variable number of variable-length typed "objects" using a common structure. The subsections that follow define the formats of the common header, the object structures, and each of the RSVP message types. For each RSVP message type, there is a set of rules for the permissible ordering and choice of object types. These rules are specified using Backus-Naur Form (BNF) augmented with square brackets surrounding optional sub-sequences. 4.1.1 Common Header 0 1 2 3 +-------------+-------------+-------------+-------------+ | Vers | Type | Flags | Message Length | +-------------+-------------+-------------+-------------+ | RSVP Checksum ||________| -----------------------|---------------------------------------------Object Count |________ <- (b)+-------------+-------------+-------------+-------------+ The common header fields are as follows: Vers Protocol version number. This is version 2. Type 1 = PATH 2 = RESV 3 = PERR 4 = RERR 5 = PTEAR 6 = RTEAR Flags 0x01 = Entry-Police Braden, Zhang, et al. Expiration: September 1995 [Page 23] Internet Draft RSVP Specification March 1995 This flag should be on in a PATH message sent by an RSVP daemon in a sender host. The first RSVP node that finds the flag on in a PATH message (i.e., the first-[RSVP-]hop router) should institute policing for the flow(s) described in this message. This flag should never be forwarded in PATH refresh messages. 0x02 = LUB-Used This flag is described below in the section on Error Messages. Message Length The total length of this RSVP message, including this common header and the objects included in Object Count. RSVP Checksum A standard TCP/UDP checksum over the contents of the RSVP message, with the checksum field replaced by zero. Object Count Count of variable-length objects that follow. 4.1.2 Object Formats An object consists of one or more 32-bit words with a one-word header, in the following format: 0 1 2 3 +-------------+-------------+-------------+-------------+ |(d)Length (bytes) |S1{3B}Class |(d) <- FF( S1{3B}, S3{B} ) FF( S2{5B}, S3{B} )C-Type ||________|+-------------+-------------+-------------+-------------+ | |S3{B}// (Object contents) // | ||________| Figure 6: Fixed-Filter Reservation Example Figure+-------------+-------------+-------------+-------------+ An object header has the following fields: Length Total length in bytes. Must always be a multiple of 4, and at least 4. Braden, Zhang, et al. Expiration: September 1995 [Page 24] Internet Draft RSVP Specification March 1995 Class Object class. In this document, the names of object classes are capitalized. 0 = NULL A NULL object has a Class of zero; its C-Type is ignored. Its length must be at least 4, but can be any multiple of 4. A NULL object may appear anywhere in a sequence of objects, and its contents will be ignored by the receiver. 1 = SESSION Contains the IP destination address (DestAddress) and possibly a generalized source port, to define a specific session for the other objects that follow. Required in every RSVP message. 2 = SESSION_GROUP When present, defines a session group, a set of related sessions whose reservation requests should be passed collectively to Admission Control. 3 = RSVP_HOP Carries the IP address of the RSVP-capable node that sent this message. This document refers to a RSVP_HOP object as a PHOP ("previous hop") object for downstream messages or as a NHOP ("next hop") object for upstream messages. 4 = STYLE Defines the reservation style plus style-specific information that is not a FLOWSPEC or FILTER_SPEC object, in a RESV message. 5 = FLOWSPEC Defines a desired QoS, in a RESV message. 6 = FILTER_SPEC Defines a subset of session data packets that should receive the desired QoS (specified by an FLOWSPEC Braden, Zhang, et al. Expiration: September 1995 [Page 25] Internet Draft RSVP Specification March 1995 object), in a RESV message. 7shows= SENDER_TEMPLATE Contains a sender IP address and perhaps some additional demultiplexing information to identify a sender, in a PATH message. 8 = SENDER_TSPEC Defines the traffic characteristics of a sender's data stream, in a PATH message. 9 = ADVERT Carries anexampleAdspec containing OPWA data, in a PATH message. 10 = TIME_VALUES If present, contains values for the refresh period R and the state time-to-live T (see section 4.5), to override the default values ofDynamic-Filter reservations.R and T. 11 = ERROR_SPEC Specifies an error, in a PERR or RERR message. 12 = CREDENTIAL Contains user credential and/or information for policy control and/or accounting. 13 = INTEGRITY Contains a cryptographic data to authenticate the originating node, and perhaps verify the contents, of this RSVP message. C-Type Object type; unique within Class. Values defined in Appendix A. The Class and C-Type fields may be used together as a 16-bit number to define a unique type for each object. Thereceivers downstreamformats of specific object types are defined in Appendix A. Braden, Zhang, et al. Expiration: September 1995 [Page 26] Internet Draft RSVP Specification March 1995 4.1.3 Path Message PATH messages carry information frominterface (d) have requested two reserved channels, but selected only one sender, S1.senders to receivers along the same paths, and using the same uni-/multicast routes, as the data packets. The IP destination address of a PATH message is the DestAddress for the session, and the source address is an address of the nodereserves min(2,3) = 2 channelsthat sent the message (if possible, the address ofsize B onthe particular interface(d), andthrough which itthen applies any specified filters to these channels. Since only one senderwasspecified, one channel has no corresponding filter,sent). The format of a PATH message is asshown by `?'. Similarly,follows: <Path Message> ::= <Common Header> <SESSION> <RSVP_HOP> [ <INTEGRITY> ] [ <TIME_VALUES> ] <sender descriptor list> <sender descriptor list> ::= <empty > | <sender descriptor list> <sender descriptor> <sender descriptor> ::= [ <CREDENTIAL> ] <SENDER_TEMPLATE> [ <SENDER_TSPEC> ] [ <ADVERT> ] Each sender descriptor defines a sender, and thereceivers downstreamsender descriptor list allows multiple sender descriptors to be packed into a PATH message. For each sender in the list, the SENDER_TEMPLATE object defines the format ofinterface (c) have requested two channelsdata packets, the SENDER_TSPEC object may specify the traffic flow, andselected senders S1the CREDENTIAL object may specify the user credentials. There may also be an ADVERT object carrying advertising (OPWA) data. Each sender host must periodically send a PATH message containing the sender descriptor(s) describing its own data stream(s), for a given session. Each sender descriptor is forwarded andS2. The two channels might have been one channelreplicated as necessary to follow the delivery path(s) for a data packet from the same sender, finally reaching the applications on all receivers (except not a receiver included in the sender process). At each node, a route must be computed independently for each sender descriptors being forwarded. These routes, obtained fromR1the uni/multicast routing table, generally depend upon the (sender host address, DestAddress) pairs, andR2, or two channels requested by oneconsist ofthem, for example. Zhang,a list of outgoing interfaces. Then the descriptors being forwarded through the same outgoing interface can be packed into as few Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 18]September 1995 [Page 27] Internet Draft RSVP SpecificationNovember 1994 | Send | Reserve Receive | | ________ DF( 1,{B}; S1) <- (a) | (c) | S1{B} | (c) <- DF( 2,{B}; S1, S2) | |________| | | S2{B} | | |________| | ------------------------|------------------------------------------- | ________ DF( 2,{B}; S2) <- (b) | (d) | S1{B} | (d) <- DF( 2,{B}; S1) | |________| | | ?{B} | | |________| Figure 7: Dynamic-Filter Reservation Example A router shouldMarch 1995 PATH messages as possible. Note that multicast routing of path information is based on the sender address(es) from the sender descriptors, notreserve more Dynamic-Filter channels thanthenumberIP source address; this is necessary to prevent routing loops; see Section 4.3. PHOP (i.e., the RSVP_HOP object) of each PATH message should contain the IP source address, the interface address through which the message is sent. PATH messages are processed at each node they reach to create path state, which includes SENDER_TEMPLATE object and possibly CREDENTIAL, SENDER_TSPEC, and ADVERT objects. If an error is encountered while processing a PATH message, a PERR message is sent to all senders implied by the SENDER_TEMPLATEs in the sender descriptor list. 4.1.4 Resv Messages RESV messages carry reservation requests hop-by-hop from receivers to senders, along the reverse paths ofupstream sources (three, indata flow for theroutersession. The IP destination address ofFigure 7). Since therea RESV message isonly one source upstream from previous hop (a),thefirst parameterunicast address of a previous-hop node, obtained from theDF message (the count of channels topath state. The Next Hop address (in the RSVP_HOP object) should bereserved) was decreased to 1 intheforwarded reservations. However, this is unnecessary, becauseIP address of therouters upstream will reserve only one channel, regardless. When a DF reservation is received, it is labeled with(incoming) interface through which the RESV message is sent. The IP source address is an address of thenext hop (RSVP-capable) router, downstream fromnode that sent thecurrent node. Sincemessage (if possible, theoutgoingaddress of the particular interfacemay be directly connected to a shared medium network or to a non-RSVP-capable router, there may be more than one next-hop node downstream; if so, each sends independent DF RESV messages for a given session.through which it was sent). Thenumber N'permissible sequence ofDF channels reserved on an outgoing interface is given by the formula: N' = min( D1+D2+...Dn, Ns), where Di is the D value (channel reservation count)objects in a RESVfrom the ith next-hop node. The three examples just shown assume full routing, i.e., data packets from S1, S2, and S3 are routed to both outgoing interfaces. Assume the routing shown in Figure 8, in which data packets from S1 are not forwarded to interface (d) (becausemessage depends upon themesh topology provides a shorter path for S1->R3 that does not Zhang,reservation style specified in the STYLE object. Currently, object types Style-WF and Style-FF of class STYLE are defined (see Appendix A). The RESV message format is as follows: <Resv Message> ::= <Common Header> <SESSION> [ <SESSION_GROUP> ] <RSVP_HOP> [ <INTEGRITY> ] [ <TIME_VALUES> ] [ <CREDENTIAL> ] <style-specific tail> <style-specific-tail> ::= <Style-WF> [ <FILTER_SPEC> ] <FLOWSPEC> | Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 19]September 1995 [Page 28] Internet Draft RSVP SpecificationNovember 1994 traverse this node). _______________ (a)| | (c) ( S1 ) ---------->| --------->--> |----------> ( R1, R2) | / | | / | (b)| /March 1995 <Style-FF> <flow descriptor list> <flow descriptor list> ::= <empty> |(d) ( S2,S3 ) ------->| ->----------> |----------> ( R3 ) |_______________| Figure 8: Router Configuration Under this assumption, Figure 9 shows Wildcard-Filter reservations. Since there is no route from (a) to (d), the<flow descriptor list> <FILTER_SPEC> <FLOWSPEC> The reservationforwarded out interface (a) considers onlyscope, i.e., thereservation on interface (c), so no merging takes place in this case. | Send | Reserve Receive | | _______ WF( *{B} ) <- (a) | (c) | * {3B}| (c) <- WF( *{B} ) | |_______| | -----------------------|---------------------------------------- | _______ WF( *{3B} ) <- (b) | (d) | * {B} | (d) <- WF( * {3B} ) | |_______| Figure 9: Wildcard-Filter Reservation Example -- Partial Routing 2.5 Host Model Beforeset of senders towards which asession canparticular reservation is to becreated,forwarded, is determined by matching FILTER_SPEC objects against thesession socket, comprised of DestAddress and ResvID, mustpath state created from SENDER_TEMPLATE objects, considering any wildcards that may beassignedpresent. 4.1.5 Error Messages There are two types of RSVP error messages: o PERR messages result from PATH messages andcommunicated to alltravel towards senders. PERR messages are routed hop-by-hop like RESV messages; at each hop, thesendersIP destination address is the unicast address of a previous hop. o RERR messages result from RESV messages andreceiverstravel hop- by-hop towards the appropriate receivers, routed bysome out-of-band mechanism. In order to join an RSVP session,theend systems performreservation state. At each hop, thefollowing actions. H1 A receiver joinsIP destination address is themulticast group specifiedunicast address of a next-hop node. Routing is discussed below. RSVP error messages are triggered only byZhang,processing of PATH and RESV messages; errors encountered while processing error or teardown messages must not create error messages. <PathErr message> ::= <Common Header> <SESSION> <RSVP_HOP> [ <INTEGRITY> ] <ERROR_SPEC> <sender descriptor> <sender descriptor list> ::= (see earlier definition) <ResvErr Message> ::= <Common Header> <SESSION> <RSVP_HOP> [ <INTEGRITY> ] <ERROR_SPEC> [ <CREDENTIAL> ] <style-specific tail> Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 20]September 1995 [Page 29] Internet Draft RSVP SpecificationNovember 1994 DestAddress. H2 A potential sender starts sending RSVP PATH messages toMarch 1995 <style-specific tail> ::= (see earlier definition) The ERROR_SPEC specifies theDestAddress. H3 A receiver listens for PATH messages. H4 A receiver starts sending appropriate RESV messages, specifyingerror. It includes thedesired Flow Descriptors. There are several synchronization issues. o Suppose that a new sender starts sending data but there are no receivers. There will be no multicast routes beyondIP address of thehost (or beyondnode that detected thefirst RSVP-capable router) alongerror, called thepath;Error Node Address. When a PATH or RESV message has been "packed" with multiple sets of elementary parameters, thedata willRSVP implementation should process each set independently and return a separate error message for each that is in error. An error message may bedropped atduplicated and forwarded unchanged. In general, error messages should be delivered to thefirst hop until receivers(s) do appear (assuming a multicast routing protocolapplications on all the session nodes that"prunes off" or otherwise avoids unnecessary paths).(may have) contributed to this error. oSupposeA PERR message is forwarded to all previous hops for all senders listed in the Sender Descriptor List. o The node that creates a RERR message as the result of processing anew sender starts sending PATH messages (H2) and immediately starts sending data, and there are receivers but noRESVmessages have reachedmessage should send thesender yet (e.g., becauseRERR message out the interface through which the RESV arrived. In succeeding hops, the routing of a RERR message depends upon itsPATH messages have not yet propagated tostyle and upon routing. In general, a RERR message is sent out some subset of thereceiver(s)). Thenoutgoing interfaces specified for multicast routing, using Error Node Address as theinitial data may arrive at receivers withoutsource address and DestAddress as thedesired QoS. o Ifdestination. (This rule is necessary to prevent packet loops; see Section 4.3 below). Within this set of outgoing interfaces, areceiver starts sending RESV messages (H4) before any PATH messages have reached it (and if path stateRERR message isbeing usedsent only toroutenext hop(s) whose RESVmessages), RSVP will returnmessage(s) created the error; this in turn depends upon the merging of flowspecs. Assume that a reservation whose errormessages tois being reported was formed by merging two flowspecs Q1 and Q2 from different next hops. - If Q1 = Q2, thereceiver. The receiver may simply chooseerror message should be forwarded toignore suchboth next hops. - If Q1 < Q2, the errormessages, or it may avoid them by waiting for PATH messages before sending RESV messages. A specific application program interface (API) for RSVP is not defined in this protocol spec, as it maymessage should behost system dependent. However, Section 3.6.2 discussesforwarded only to the next hop for Q2. - If Q1 and Q2 are incomparable, thegeneral requirementserror message should be forwarded to both next hops, andpresents a generic API. Zhang,the LUB flag should be turned on. Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 21]September 1995 [Page 30] Internet Draft RSVP SpecificationNovember 1994 3. Functional SpecificationMarch 1995 The ERROR_SPEC and the LUB-flag should be delivered to the receiver application. In the case of an Admission Control error, the style-specific tail will contain the FLOWSPEC object that failed. If the LUB-flag is off, this should be the same as a FLOWSPEC in a RESV message sent by this application; otherwise, they may differ. An error in a FILTER_SPEC object in a RESV message will normally be detected at the first RSVP hop from the receiver application, i.e., within the receiver host. However, an admission control failure caused by a FLOWSPEC or a CREDENTIAL object may be detected anywhere along the path(s) to the sender(s). 4.1.6 Teardown Messages There arecurrently 6two types of RSVPmessages: PATH, RESV, PTEAR, RTEAR, PERR,Teardown message, PTEAR andRERR. 3.1 Message Formats 3.1.1 Path Message 0 1 2 3 +-------------+-------------+-------------+-------------+ | Vers | Type | Flags | RSVP Checksum | +-------------+-------------+-------------+-------------+ | DestAddress | +-------------+-------------+-------------+-------------+ | ResvID | +-------------+-------------+-------------+-------------+ | Refresh Period | +-------------+-------------+-------------+-------------+ | State TTL Time | +-------------+-------------+-------------+-------------+ | Previous Hop Address | +-------------+-------------+-------------+-------------+ | /////////////// | SD Count | +-------------+-------------+-------------+-------------+ | Authentication Field | // ... // +-------------+-------------+-------------+-------------+ | Sender Descriptor List | // ... // +-------------+-------------+-------------+-------------+ IP Fields: Protocol 46RTEAR. o PTEAR messages delete path state (which in turn may delete reservations state) and travel towards all receivers that are downstream from the point of initiation. PTEAR messages are routed like PATH messages, and their IPSource Address Thedestination address is DestAddress for the session. o RTEAR messages delete reservation state and travel towards all matching senders upstream from the point of teardown initiation. RTEAR message are routed like RESV messages, and their IP destination addressofis thehost or router sending this message. IP Destination Address The IPunicast address of a previous hop. <PathTear Message> ::= <Common Header> <SESSION> <RSVP HOP> [ <INTEGRITY> ] <sender descriptor list> <sender descriptor list> ::= (see earlier definition) <ResvTear Message> ::= <Common Header> <SESSION> <RSVP HOP> [ <INTEGRITY> ] [ <CREDENTIAL> ] <style-specific tail> <style-specific tail> ::= (see earlier definition) Flowspec objects in thedata destination (DestAddress). Zhang,style-specific tail of a RTEAR message Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 22]September 1995 [Page 31] Internet Draft RSVP SpecificationNovember 1994 RSVP Fields: Vers Version number. This is version 1. Type 1 = Path Message Flags 8 = Drop If this flag bit is on then data packetsMarch 1995 will bedropped when they are destined to this session but their sender is not currently selected by any filter.ignored and may be omitted. Ifthis flag bitthe state being deleted was created with user credentials from a CREDENTIAL field, then the matching PTEAR or RTEAR message must include matching CREDENTIAL field(s). [There isoff, such data packets will still be forwarded but withoutareservation, i.e., usingproblem here: tearing down path state may implicitly delete reservation state. But abest-effort class. RSVP Checksum A standard TCP/UDP checksum, over the contents of the RSVPPTEAR messagewithdoes not have credentials for thechecksum field replaced by zero. DestAddress, ResvID The IP address and stream Id identifyingreservation state, only for thesession, i.e.,path state. Some argue that a CREDENTIAL may not be needed in teardown messages, on thesession socket. Previous Hop Address The IP addressassumption that false teardown messages can be injected only with the collusion of routers along theinterface through whichdata path, and in that case, thehost orcolluding routerlast forwarded this message. The Previous Hop Address is used to support reverse- path forwarding ofcan just as well stop delivering the RESVmessages. This field is initialized by a sender to itsmessages, which will have the same effect.] 4.2 Sending RSVP Messages RSVP messages are sent hop-by-hop between RSVP-capable routers as "raw" IPaddress (seedatagrams, protocol number 46. Raw IPSource Address above) and mustdatagrams are similarly intended to beupdated at each router hop asused between an end system and thePATH messagefirst/last hop router; however, it isforwarded. Refresh Period This field specifies the refresh timeout period in Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 23] Internet Draftalso possible to encapsulate RSVPSpecification November 1994 milliseconds. See Section 3.3 below. State TTL Time This field specifies the time-to-livemessages as UDP datagrams forsoft state,end-system communication, as described inmilliseconds. It determinesAppendix C. UDP encapsulation will simplify installation of RSVP on current end systems, particularly when firewalls are in use. Under overload conditions, lost RSVP control messages could cause thecleanup timeout period; see Section 3.3 below. SD Count Countloss ofSender Descriptors that follow. Authentication Field A variable-length authentication fieldresource reservations. Routers should be configured toidentify and perhaps authenticate the principal making this reservation request. The field has the following form: +-------------+-------------+-------------+-------------+ | AuthLen | AuthType | | +-------------+-------------+ + // Authentication Info // +-------------+-------------+-------------+-------------+ The AuthLen octet contains the integer lengthgive a preferred class of service to RSVP packets. RSVP should not use significant bandwidth, but thefield in fullwords, and AuthType specifies the formatqueueing delay for RSVP messages needs to be controlled. An RSVP PATH or RESV message consists of a small root segment followed by a variable-length list of objects, which may overflow thefield. See Section 3.6.1 for currently defined authentication field formats. If therecapacity of one datagram. IP fragmentation isno authentication information, AuthLeninadvisable, since it has bad error characteristics; RSVP-level fragmentation should be used. That is, a message with a long list of descriptors will be divided into segments that will fit into individual datagrams, each carrying the same root fields. Each of these messages will bezero, butprocessed at theAuthentication Field will still occupy one fullword inreceiving node, with a cumulative effect on themessage. Sender Descriptor List A list of Sender Descriptors (see below). The orderlocal state. No explicit reassembly is needed. Since RSVP messages are normally expected to be generated and sent hop-by-hop, their MTU should be determined by the MTU ofentrieseach interface. Braden, Zhang, et al. Expiration: September 1995 [Page 32] Internet Draft RSVP Specification March 1995 [There may be rare instances in which thislistdoes not work very well, and in which manual configuration would not help. The problem case isirrelevant. Each sender must periodically sendan interface connected to aPATH message containingnon-RSVP cloud in which some particular link far away has asingle Sender Descriptor describing its own data stream. These messages are addressedsmaller MTU. This would affect only those sessions that happened tothe uni-/multicast destination addressuse that link. Proper solution to this case would require MTU discovery separately fortheeach interface and each session, which is a very large amount of machinery andthey are forwarded to all receivers, following the same paths assome overhead for adata packet fromrare (?) case. Best approach seems to be to rely on IP fragmentation and reassembly for this case.] 4.3 Avoiding RSVP Message Loops We must ensure that thesame sender.rules for forwarding RSVP control messages avoid looping. In steady state, PATH and RESV messages arereceived and processed locally to create path state atforwarded on eachintermediate router alonghop only once per refresh period. This avoids directly looping packets, but there is still theZhang, Braden, et al. Expiration: May 95 FORMFEED[Page 24] Internet Draft RSVP Specification November 1994 path. Ifpossibility of anerror is encountered while processing" auto-refresh" loop, clocked by the refresh period. The effect of such aPATH message, an RSVP error messageloop issenttoallkeep state active "forever", even if thesender hosts listed inend nodes have ceased refreshing it (but theSender Descriptor List.state will be deleted when the receivers leave the multicast group and/or the senders stop sending PATH messages). In addition, error and teardown messages aredistributed from sendersforwarded immediately and are therefore subject toreceivers alongdirect looping. PATH messages are forwarded using routes determined by theexact pathsappropriate routing protocol. For routing that is source- dependent (e.g., some multicast routing algorithms), thedata will traverse, using uni- /multicast routing. This distribution actually takes place hop-by-hop, allowingRSVPindaemon must route eachrouter along the path to observe and modify the message. Routing of PATH messages is based on thesenderaddress(es) from the Sender Descriptor(s), notdescriptor separately using theIPsourceaddress. This is necessary to prevent loops; see Section 3.2. Each Sender Descriptor consists of two variable-length fields: a sender template that definesaddresses found in theformat of data packets and a corresponding FlowspecSENDER_TEMPLATE objects. This should ensure thatdescribes the traffic characteristics. The sender template has the form of a filterspec, and a Sender Descriptor has the form defined below for a Flow Descriptor (see also Section 3.6.1). The flowspec may be omitted, in which case its length fieldthere will bezero (but it will still occupy one fullword in the Sender Descriptor). The Sender template is retainedno auto-refresh loops of PATH information, even inthe Patha topology with cycles. Since PATH messages don't loop, they create path statein order to validate filterspecs in RESV messages. Suppose thatdefining afilterspec consisted ofloop-free reverse path to each sender. As asimple (value,mask) pair (Vf,Mf)result, RESV and RTEAR messages directed tobe appliedparticular senders cannot loop. PERR messages are always directed tothe headers of the data packets (the actual formatparticular senders and therefore cannot loop. However, there isslightly more complex; see Section 3.6.1). Then the corresponding template would be a (value,mask) pair defining those bits of the data packet headers that are fixed. While processingareservation using filterspec (Vf,Mf)potential auto-refresh problem forthe senderRESV, RTEAR, and RERR messages withtemplate (Vs,Ms), RSVP can then test whether Vf&(Mf&Ms) = Vs&(M&Ms).wildcard scope, as we now discuss. Ifnot, this filterspec cannot possibly match the data stream from this sender at any node upstream, andthereservationtopology has no loops, then auto-refresh can berejectedavoided, even for wildcard scope, withan error message back tothereceiver. Zhang,following rule: A reservation request received from next hop N must not be forwarded to N. Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 25]September 1995 [Page 33] Internet Draft RSVP SpecificationNovember 1994 3.1.2 Resv MessageMarch 1995 This rule is illustrated in Figure 10, which shows a transit router with one sender and one receiver on each interface (and assumes one next/previous hop per interface). Interfaces a and c are both outgoing and incoming interfaces for this session. Both receivers are making wildcard-scope reservations, in which the RESV messages aresent from receiversforwarded to all previous hops for sendersalong reverse paths established by PATH messages. 0 1 2 3 +-------------+-------------+-------------+-------------+ | Vers | Type | Flags | RSVP Checksum | +-------------+-------------+-------------+-------------+ | DestAddressin the group, with the exception of the next hop from which they came. These result in independent reservation requests in the two directions, without an auto-refresh loop. ________________ a |+-------------+-------------+-------------+-------------+|ResvIDc ( R1, S1 ) <----->| Router |<-----> ( R2, S2 ) |________________| Send & Receive on (a) |+-------------+-------------+-------------+-------------+Send & Receive on (c) |Refresh PeriodWF( *{3B}) <-- (a) |+-------------+-------------+-------------+-------------+(c) <-- WF( *{3B}) |State TTL TimeWF( *{4B}) --> (a) |+-------------+-------------+-------------+-------------+(c) --> WF( *{4B}) |Next Hop Address|+-------------+-------------+-------------+-------------+Reserve on (a) |RecvAddressReserve on (c) __________ |+-------------+-------------+-------------+-------------+__________ |Dynamic Reservation Count* {4B} |FD Count|+-------------+-------------+-------------+-------------+|Authentication Field* {3B} |// ... // +-------------+-------------+-------------+-------------+|__________| |Flow Descriptor List|__________| |// ... // +-------------+-------------+-------------+-------------+ The fields are the same as defined earlier for a PATH message, except forFigure 10: Avoiding Auto-Refresh in Non-Looping Topology However, further effort is needed to prevent auto-refresh loops from wildcard-scope reservations in thefollowing: IP Fields: IP Source Address The IP addresspresence of cycles in thenode sending this message. IP Destination Address The IP addresstopology. [TBD!!]. We treat routing ofthe next-hop router or host to which this message is being sent. RSVP Fields: Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 26] Internet Draft RSVP Specification November 1994 Type 2 = Resv Message Flags The following flag bit combinations define the reservation style: 001xxxxx = Wildcard-Filter 010xxxxx = Fixed-Filter 011xxxxx = Dynamic-Filter Next Hop Address The IP addressRERR messages as a special case. They are sent with unicast addresses of next hops, but theinterface through which the last forwarded this message. The Next Hop Addressmulticast routing is used tosupport teardown. This field is initialized by a receiver to its IP address and must be updated at each router hop as the RESV message is forwarded. RecvAddress The IP address of (one of the) receiver(s) that originated this message, or one of the RESVprevent loops. As explained above, RERR messagesthat was merged to form this message. Dynamic Reservation Count The number of channelsare forwarded tobe reserved, foraDynamic-Filter style reservation. Ifsubset of theResvStyle is Dynamic-Filter,multicast tree to DestAddress, rooted at the node on which the error was discovered. Since multicast routing cannot create loops, thisinteger value mustwill prevent loops for RERR messages. [Open question about Figure 10: should it beconstant and equal or greater than (FD Count).possible to have incompatible reservation styles on the two interfaces? Forother ResvStyles, this field must be zero. FD Count Count of Flow Descriptors inexample, if R1 requests a WF reservation and R2 requests a FF reservation, it is logically possible to make theFlow Descriptor List. Flow Descriptor List Zhang,corresponding reservations on the two different interfaces. The current Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 27]September 1995 [Page 34] Internet Draft RSVP SpecificationNovember 1994 A listMarch 1995 implementation does NOT allow this; instead, it prevents mixing ofFlow Descriptors, i.e., (Filterspec, flowspec) pairs, to define individual reservation requests. The first entryincompatible styles in thelist may have special meaning (see below); the order of later entries is irrelevant. Each Flow Descriptor has the following form: +-------------+-------------+-------------+-------------+ | FiltSLen | FiltSType | | +-------------+-------------+ + // Filter Spec ... // +-------------+-------------+-------------+-------------+ | FlowSLen | FlowSType | | +-------------+-------------+ + // Flow Spec ... // +-------------+-------------+-------------+-------------+ Here FiltSLen and FlowSLensame session on a node, even if they areone-octet fields specifyingon different interfaces.] 4.4 Local Repair Each RSVP daemon periodically sends refreshes to its next/previous hops. An important optimization would allow thelengths in fullwords (includinglocal routing protocol module to notify thelength byte)RSVP daemon ofthe filterspec and flowspec, respectively, and FiltSType and FlowSType are one- octet fields defining the corresponding field formats. See Section 3.6.1route changes forcurrently defined formats.particular destinations. Thefollowing specific rules hold for different reservation styles. o Wildcard-Filter To obtain Wildcard-Filter service, set FD Count = 1 and include a single Flow Descriptor whose Filterspec part is a wild card, i.e., selects all senders. and whose flowspec part definesRSVP daemon should use this information to trigger an immediate refresh of state for these destinations, using thedesired flow parameters. o Fixed-Filter Include a listnew route. This allows fast adaptation to routing changes without the overhead ofFD Count >= 1 Flow Descriptors, each defining a sender Filterspec andacorresponding flowspec. o Dynamic-Filter Include max(1, FD Count) Flow Descriptors inshort refresh period. 4.5 Time Parameters For each element of state, there are two time parameters: themessage. Hererefresh period R and theFD Counttime-to-live value T. R specifies thenumberperiod between sending successive refreshes ofsender Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 28] Internet Draftthis data. T controls how long state will be retained after refreshes stop appearing, and depends upon period between receiving successive refreshes. Specifically, R <= T, and the "cleanout time" is K * T. Here K is a small integer; K-1 successive messages may be lost before state is deleted. Currently K = 3 is suggested. Clearly, a smaller T means increased RSVPSpecification November 1994 Filterspecs that are included.overhead. IfDC is the Dynamic Reservation Count, then DC >= FD Count >= 0. The Flowspec part ofthefirst Flow Descriptor definesrouter does not implement local repair, a smaller T improves thedesired sizespeed ofalladapting to routing changes. With local repair, a router can be more relaxed about T, since theDC channels thatperiodic refresh becomes only a backstop robustness mechanism. There arereserved. The Flowspec parts of later Flow Descriptors (if any)three possible ways for a router to determine R and T. o Default values areignored. Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 29] Internet Draft RSVP Specification November 1994 3.1.3 Error Messages Thereconfigured in the router. Current defaults aretwo types30 seconds for T and R. o A router may adjust the value ofRSVP error messages: PERR messages result fromT dynamically to keep a constant total overhead due to refresh traffic; as more sessions appear, the period would be lengthened. In this case, R = T could be used. o R and T can be specified by the end systems. For this purpose, PATHmessagesandtravel towards senders, while RERR messages result fromRESV messagesand travel towards receivers. RSVP errormay contain the optional TIM_VALUES object. When messages aretriggered only by processing of PATHmerged andRESV messages; errors encountered while processing error or teardown messages must not create error messages. A PERR messageforwarded to the next hop, R should be the minimum R that has been received, and T should be thefollowing form: 0 1 2 3 +-------------+-------------+-------------+-------------+ | Vers | Type | Flags | RSVP Checksum | +-------------+-------------+-------------+-------------+ | DestAddress | +-------------+-------------+-------------+-------------+ | ResvID | +-------------+-------------+-------------+-------------+ | Error Code | Error Index | Error Value | +-------------+-------------+-------------+-------------+ | ////////////// (ignored) ////////////////// | +-------------+-------------+-------------+-------------+ | ////////////// (ignored) ////////////////// | +-------------+-------------+-------------+-------------+ | /// Reserved /// | SD Count | +-------------+-------------+-------------+-------------+ | Authentication Field | // ... // +-------------+-------------+-------------+-------------+ | Sender Descriptor List | // ... // +-------------+-------------+-------------+-------------+ The fields aremaximum T that has been received. Thus, thesame as in a PATH message, defined earlier, except forlargest T determines how long state is retained, and thefollowing: RSVP Fields: RSVPType 3 = PERR message Error Code Zhang,smallest R determines the responsiveness of Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 30]September 1995 [Page 35] Internet Draft RSVP SpecificationNovember 1994 A one-octet error description. 01 = Insufficient memory 02 = Count Wrong The SD Count field does not match length of message. Error Index Position of Sender Descriptor that caused the error within Sender Descriptor List. An integer between zero and SD Count - 1. Error Value (Unused) A RERR message hasMarch 1995 RSVP to route changes. In thefollowing form: Zhang,first hop, they are expected to be equal. The RSVP API might allow an application to override the default value for a particular session. Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 31]September 1995 [Page 36] Internet Draft RSVP SpecificationNovember 1994 0 1 2 3 +-------------+-------------+-------------+-------------+ | Vers | Type | Flags |March 1995 4.6 RSVPChecksum | +-------------+-------------+-------------+-------------+ | DestAddress | +-------------+-------------+-------------+-------------+ | ResvID | +-------------+-------------+-------------+-------------+ | Error Code | Error Index | Error Value | +-------------+-------------+-------------+-------------+ | ////////////// (ignored) ////////////////// | +-------------+-------------+-------------+-------------+ | ////////////// (ignored) ////////////////// | +-------------+-------------+-------------+-------------+ | RecvAddress | +-------------+-------------+-------------+-------------+ | Dynamic Reservation Count | FD Count | +-------------+-------------+-------------+-------------+ | Authentication Field | // ... // +-------------+-------------+-------------+-------------+ | Flow Descriptor List | // ... // +-------------+-------------+-------------+-------------+Interfaces RSVP on a router has interfaces to routing and to traffic control in the kernel. RSVP on a host has an interface to applications (i.e, an API) and also an interface to traffic control (if it exists on the host). 4.6.1 Application/RSVP Interface This section describes a generic interface between an application and an RSVP control process. Thefields aredetails of a real interface may be operating-system dependent; thesamefollowing can only suggest the basic functions to be performed. Some of these calls cause information to be returned asynchronously. o Register Call: REGISTER( DestAddress , DestPort [ , SESSION_object ] , SND_flag , RCV_flag [ , Source_Address ] [ , Source_Port ] [ , Sender_Template ] [ , Sender_Tspec ] [ , Data_TTL ] [ , UserCredential ] [ , Upcall_Proc_addr ] ) -> Session-id This call initiates RSVP processing for a session, defined by DestAddress together with the TCP/UDP port number DestPort. If successful, the REGISTER call returns immediately with a local session identifier Session-id, which may be used in subsequent calls. The SESSION_object parameter is included as an escape mechanism to support some more general definition of the session ("generalized destination port"), should that be necessary in the future. Normally SESSION_object will be omitted; if it is supplied, it should be an appropriately-formatted representation of aRESV message, defined earlier, except forSESSION object. SND_flag should be set true if thefollowing: RSVP Fields: RSVPType 4 = RERR message Error Code A one-octet error description. DEFINE THESE VALUES IN AN APPENDIX?? 01 = Insufficient memory 02 = Count Wronghost will send data, and RCV_flag should be set true if the host will receive data. Setting neither true is an error. TheFD Count field does not match length of message. Zhang,optional parameters Source_Address, Source_Port, Sender_Template, Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 32]September 1995 [Page 37] Internet Draft RSVP SpecificationNovember 1994 03 = No path information for this Resv 04 = No Sender informationMarch 1995 Sender_Tspec, and Data_TTL are all concerned with a data source, and they will be ignored unless SND_flag is true. If SND_FLAG is true, a successful REGISTER call will cause RSVP to begin sending PATH messages for thisResv Theresession using these parameters, which are interpreted as follows: - Source_Address This ispath information, but it does not includethesender specified in anyaddress of theFilterspecs listed ininterface from which theResv messager. 05 = Incorrect Dynamic Reservation Count Dynamic Reservation Countdata will be sent. If it iszero or less than FD Count. 06 = Filterspec error 07 = Flowspec syntax error 08 = Flowspec value error Internal inconsistency of values. [What shouldomitted, a default interface will bedone with Flowspec Feature Not Supported?] 09 = Resources unavailable [Sub-reasons? Depend upon traffic control and admission control algorithms?] Error Index Position of Flow Descriptor that causedused. - Source_Port This is theerror within Flow Descriptor List. An integer between zeroUDP/TCP port from which the data will be sent. If it is omitted or zero, the port is "wild" andFD Count - 1. Error Value Specific causecan match any port in a FILTERSPEC. - Sender_Template This parameter is included as an escape mechanism to support a more general definition of theerror described by the Error Code. DEFINE THESE VALUES IN AN APPENDIX?? Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 33] Internet Draft RSVP Specification November 1994 An error messagesender ("generalized source port"). Normally this parameter may beduplicated and forwarded unchanged. Since PATH and RESV messages mayomitted; if it is supplied, it should bemerged,anerror condition must be disseminatedappropriately formatted representation of a SENDER_TEMPLATE object. - Sender_Tspec This parameter is a Tspec describing the traffic flow toall RSVP client applications whose requestsbe sent. It mayhave contributed to the error situation. Therefore, RSVP error messages mustbepropagated and perhaps duplicated hop-by-hop. For this purpose, an error message must include all the information usedincluded toroute the original message that caused the error: the Sender Descriptor List, Flags, RecvAddress, and Flow Descriptor List fields, as appropriate. In particular, a RERR message carriesprevent over- reservation on thesame style flags asinitial hops. - Data_TTL This is theRESV message(non-default) IP Time-To-Live parameter thatcaused the error. To ease implementation,is being supplied on theerror message formats are chosendata packets. It is needed tomatch the formats of theensure that Path messageswhose processing caused the error. In particular,do not have aPATH or RESV message that encountersscope larger than multicast data packets. Finally, Upcall_Proc_addr is the address of an upcall procedure to receive asynchronous errorcan be simply convertedor event notification; see below. o Reserve Call: RESERVE( session-id, style, style-dependent-parms ) Braden, Zhang, et al. Expiration: September 1995 [Page 38] Internet Draft RSVP Specification March 1995 A receiver uses this call to make a resource reservation for thecorresponding error message by overwritingsession registered as `session-id'. The style parameter indicates the reservation style. The rest of the parameters depend upon theTypestyle, but generally these will include appropriate flowspecs and filter specs. The first RESERVE call will initiate theRefresh Period fields.periodic transmission of RESV messages. APERR message is forwardedlater RESERVE call may be given toall previous hops for all senders listed inmodify theSender Descriptor List. The routingparameters ofa RERR message is more complex. o An error in a filterspec should be detected at the first RSVP hop fromthereceiver application, normally withinearlier call (but note that changing thereceiver host. However, an error caused by a flowspec, normally anreservations may result in admission control failure,may be detected somewhere along the path(s) todepending upon thesender(s). ostyle). Therouter that createsRESERVE call returns immediately. Following aRERR message asRESERVE call, an asynchronous ERROR/EVENT upcall may occur at any time. o Release Call: RELEASE( session-id ) This call will terminate RSVP state for theresult of processing a RESV message shouldsession specified by session-id. It may sendthe RERR message out the interface through which the RESV arrived.appropriate teardown messages and will cease sending refreshes for this session-id. oIn succeeding hops, the routing of a RERR message depends upon its style. In general, a RERR message is sent on a pruned version ofError/Event Upcalls Call: <Upcall_Proc> (session-id, Info_type, List_count [ ,Error_code ,Error_value ,LUB-flag ] [ ,Filter_spec_list ] [ ,Flowspec_list ] [ ,Advert_list ] ) Here "Upcall_Proc" represents themulticast distribution tree forupcall procedure whose address was supplied in thesession; those branches that do not have reservations forREGISTER call. This upcall may occur asynchronously at anyof the specified senders are pruned off. A DF-style or WF-style RERR message is forwarded on all outgoing interfaces for which there is alreadytime after a REGISTER call and before areservation ofRELEASE call, to indicate an error or an event. Currently there are three upcall types, distinguished by thecorresponding style.Info_type parameter: 1. Info_type = Path Event AFF-style RERR message is forwarded on all outgoing interfaces for which there is already a FF-style reservation forPath Event upcall indicates thesender (filterspec) correspondingreceipt of a PATH message, indicating to theerror. At the end host, RSVP delivers a copy of every relevant error Zhang,application that there is Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 34]September 1995 [Page 39] Internet Draft RSVP SpecificationNovember 1994March 1995 at least one active sender. This upcall provides synchronizing information to the receiver application, and it may also provide parallel lists of senders (in Filter_spec_list), traffic descriptions (in Flowspec_list), and service advertisements (in Advert_list). 'List_count' is the number in each list; where these objects are missing, corresponding null objects must appear. Error_code and Error_value, and LUB-flag should be ignored in a Path Event upcall. 2. Info_type = Path Error An Path Error event indicates an error in processing a sender descriptor originated by this sender. The Error_code parameter will define the error, and Error_value may supply some additional (perhaps system-specific) data about the error. `List_count' will be 1, and Filter_spec_list and Flowspec_list will contain the Sender_Template and the Sender_Tspec supplied in the REGISTER call; Advert_list will contain one NULL object. 3. Info_type = Resv Error An Resv Error event indicates an error in processing a RESV message toits localwhich this applicationclients. It examinescontributed. The Error_code parameter will define theset of RSVP requests that local clients have made througherror, and Error_value may supply some additional (perhaps system-specific) data on theAPI,error. `List_count' will be 1, andnotifies every clientFilter_spec_list and Flowspec_list will contain one FILTER_SPEC and one FLOWSPEC object. These objects are taken from the RESV message thatcontributed tocaused the errormessage. A match is required between(unless thesession, filters (senders), and reservation styles ofLUB- flag is on, in which case FLOWSPEC may differ). Although RSVP messages indicating path events or errors may be received periodically, theerror message andAPI should make the correspondingstate inasynchronous upcall to thelatest API requests. A particular notification should includeapplication only on the first occurrence, or when the information(e.g., filters) relevanttothat application. 3.1.4 Teardown Messages There are two types of RSVP Teardown message, PTEAR and RTEAR. A PTEAR message tears down path state and travels towards all receivers downstream from its point of initiation. A RTEAR message tears down reservation statebe reported changes. 4.6.2 RSVP/Traffic Control Interface In each router andtravels towards all senders upstream from its point of initiation. A PTEAR message has the same format ashost, enhanced QoS is achieved by aPATH message, except that ingroup of inter-related traffic control functions: aPTEAR message: o Type field = 5 o Refresh Periodpacket classifier, Braden, Zhang, et al. Expiration: September 1995 [Page 40] Internet Draft RSVP Specification March 1995 an admission control module, andState TTL Time fields are ignored. A RTEAR message has the same format asaRESV message, except that inpacket scheduler. This section describes aRTEAR message: o Type fieldgeneric RSVP interface to traffic control. 1. Make a Reservation Call: Rhandle =6 o Refresh Period and State TTL Time fields are ignored. AnyTC_AddFlowspec( Flowspec, Police_Flag [ , Sender_Tspec] [ , SD_rank , SD_end_flag ] ) This call passes a Flowspeccomponents of Flow Descriptors indefining aRTEAR or PTEAR message are ignored. Teardown messages are processed indesired QoS to admission control. It may also pass Sender_Tspec, thefollowing way. o PTEAR Processingmaximum traffic characteristics computed over the SENDER_TSPECs of senders that will contribute data packets to this reservation. Police_Flag is a Boolean parameter that indicates whether traffic policing should be applied at this point. The SD_rank and SD_end_flag fields are used for aPTEAR messagemember of a session group. SD_rank isstraightforward. Forthe rank value from the SESSION_GROUP object. The call is made with eachsender S inof themessage,sessions in thenode removes path state for Sgroup, andalso deletes all related reservations. Finally, the node forwardsSD_end_flag is set true for theoriginal PTEAR message to all outgoing interfaces through which data packets from some S inlast one. This call returns an error code if Flowspec is malformed or if thepacket would be routed. That is, PTEAR forwarding rulesrequested resources are unavailable. Otherwise, it establishes a new reservation channel corresponding to Rhandle. It returns thesame as thoseopaque number Rhandle forPATH messages. o RTEAR Zhang,subsequent references to this reservation. 2. Add Filter Call: TC_AddFilter( Rhandle, Session, Filterspec ) This call is used to define a filter corresponding to the given handle, following a successful TC_AddFlowspec call. 3. Modify or Delete Filter Call: TC_ModFilter( Rhandle, Session, [ new_Filterspec] ) This call can modify an existing filter or replace an Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 35]September 1995 [Page 41] Internet Draft RSVP SpecificationNovember 1994 Processing an RTEAR message is more complex. Suppose a RTEAR message arrives through outgoing interface OI from next hop NH. For each sender S listed in the RTEAR message,March 1995 existing filter with no filter (i.e., delete thenode checksfilter). 4. Modify or Delete Flowspec Call: TC_ModFlowspec( Rhandle [, new_Flowspec [ ,Sender_Tspec]] ) This call can modify an existing reservation or delete thereservation, if any, for S on OI.reservation. Iftherenew_Flowspec isa reservation andincluded, it is passed to Admission Control; ifthis reservationit isshared among more than one next hop, thenrejected, theonly actioncurrent flowspec isto remove NH from the list of next hops sharing this reservation.left in force. Iftherenew_Flowspec isonly a single next hop, thenomitted, the reservation isdeleted. Finally, the node forwardsdeleted and Rhandle is invalidated. 5. OPWA Update Call: TC_Advertise( interface, Adspec [ ,Sender_TSpec ] ) -> New_Adspec This call is used for OPWA to compute theoriginal RTEAR messageoutgoing advertisement New_Adspec for a specified interface. 6. Initialize Traffic Control Call: TC_Initialize(interface ) This call is used when RSVP initializes its state, to clear out allincoming interfacesexisting classifier and/or packet scheduler state forsenders listed ina specified interface. 4.6.3 RSVP/Routing Interface An RSVP implementation needs themessage. That is, RTEAR forwarding rules arefollowing support from thesame as those for RESV messages. 3.2 Avoiding Message Loops RSVP routes its control messages,packet forwarding andeveryroutingprocedure must avoid looping packets. The mergingmechanism of the node. o Promiscuous receive mode for RSVP messagesdelays forwarding at each nodeAny datagram received forupIP protocol 46 is toone refresh period. This may avoid high-speed loop, but there can stillbe"slow" loops, clocked by the refresh period;diverted to theeffectRSVP program for processing, without being forwarded. The identity ofsuch slow loopsthe interface on which it is received should also be available tokeep state active forever, even iftheend nodes have ceased refreshing it.RSVPuses the following rulesdaemon. o Route discovery Braden, Zhang, et al. Expiration: September 1995 [Page 42] Internet Draft RSVP Specification March 1995 RSVP must be able toprevent looping messages. L1: Whendiscover the route(s) that the routing algorithm would have used for forwarding a specific datagram. GetUcastRoute( DestAddress ) -> OutInterface GetMcastRoute( SrcAddress, DestAddress ) -> OutInterface_list o Route Change Notification Routing may provide an asynchronous notification to RSVPmessage is received throughthat aparticular incoming interface F, the messagespecified route has changed. New_Ucast_Route( DestAddress ) -> new_OutInterface New_Mcast_Route( SrcAddress, DestAddress ) -> new_OutInterface_list o Outgoing Link Specification RSVP mustnotbeforwarded out F as anable to force a (multicast) datagram to be sent on a specific outgoinginterface. This implies that RSVP must keep track ofvirtual link, bypassing theinterface through which each messagenormal routing mechanism. A virtual link may be a real outgoing link or a multicast tunnel. Outgoing link specification isreceived, to avoid forwarding it out that interface. Note that, althoughnecessary because RSVPdistinguishes incoming frommay send different versions of outgoing PATH messages on different interfaces,in many casesfor the samephysical interface will play both roles. L2: Upon receipt of a PATH message in particular, a routesource and destination addresses, and to avoid loops. o Discover Interface List RSVP must becomputed for eachable to learn what real and virtual interfaces exist. Braden, Zhang, et al. Expiration: September 1995 [Page 43] Internet Draft RSVP Specification March 1995 5. Message Processing Rules This generic description ofits sender Flow Descriptors. These routes, obtained from the uni/multicast routing table, generally depend uponRSVP operation assumes the(sender host address, DestAddress) pairs.following data structures. An actual implementation may use additional or different structures to optimize processing. o PSB -- Path State Block Eachroute consists ofPSB holds path state for alist of outgoing interfaces; these lists (with the incoming interfaces deletedparticular (session, sender) pair, defined byrule L1)SESSION and SENDER_TEMPLATE objects, respectively. PSB contents include a PHOP object and possibly SENDER_TSPEC, CREDENTIAL, and/or ADVERT objects from PATH messages. o RSB -- Reservation State Block RSB's are used tocreate mergedhold reservation state. Each RSB holds reservation state for the 4-tuple: (session, next hop, style, filterspec), defined in SESSION, NHOP (i.e., RSVP_HOP), STYLE, and FILTER_SPEC objects, respectively. We assume that RSB contents include the outgoing interface OI that is implied by NHOP. RSB contents also include a FLOWSPEC object and may include a CERTIFICATE object. MESSAGE ARRIVES Verify version number, checksum, and length fields of common header, and discard message if it fails. Further processing depends upon message type. PATHmessages to be forwarded throughMESSAGE ARRIVES Start with theoutgoing interfaces. Assuming that multicast routingRefresh_Needed flag off. Each sender descriptor object sequence in the message defines a sender. Process each sender as follows. 1. If there isfree of loops,a CREDENTIAL object, verify it; if it is unacceptable, build and send a PERR message, drop the PATHmessages cannot loop even inmessage, and return. 2. If there is no path state block (PSB) for the (session, sender) pair then: o Create atopology with cycles. Zhang,new PSB. o Set a cleanup timer for the PSB. If this is the first Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 36]September 1995 [Page 44] Internet Draft RSVP SpecificationNovember 1994 Since PATH messages don't loop, they create path state definingMarch 1995 PSB for the session, set aloop-free path to each sender. Similarly, RESV messages directed to particular senders cannot loop. However, rules L1 and L2 cannot protect against looping RESV messages that are directed towards all senders (WF or DF styles). Therefresh timer for the session. o Copy PHOP into the PSB. Copy into the PSB any of the followingthree rulesobjects that areneeded for this purpose. L3: Each RESV message carries a receiver addresspresent in theRecvAddress field. Whenmessage: CREDENTIAL, SENDER_TSPEC, and/or ADVERT. Copy thechoice of address to placeEntryPolice flag from the common header into the PSB. o Call the appropriate route discovery routine, using DestAddress from SESSION and (for multicast routing) SrcAddress from SENDER_TEMPLATE. Store the resulting routing bit mask ROUTE_MASK in the PSB. 3. Otherwise (there is amerged RESVmatching PSB): o If CREDENTIAL differs between message and PSB, verify new CREDENTIAL. If it isotherwise arbitrary, RSVP must useacceptable, copy it into PSB. Otherwise, build and send a PERR message for "Bad Credential", drop the PATH message, and return. o Restart cleanup timer. o Update the PSB with values from the message, as follows. Copy the ADVERT object, if any, into the PSB. Copy the EntryPolice flag into the PSB. If the values of PHOP or SEND_TSPEC differ between the message and the PSB, copy the new values into theIP address that is numerically largest. L4: WhenPSB and turn on the Refresh_Needed flag. If SEND_TSPEC has changed, reservations matching S may also change; this may be deferred until a RESVmessage is received,refresh arrives. o Call theReverse Path Forwarding rule is applied toappropriate route discovery routine and compare thereceiver address inroute mask with themessage; that is,ROUTE_MASK value already in themessage must be discarded unless it arrivesPSB; if a new bit (interface) has been added, turn on theinterface thatRefresh_Needed flag. Store new ROUTE_MASK in the PSB. 4. If the Refresh_Needed flag is now set, execute thepreferred route toPATH REFRESH event sequence (below). PATH TEAR MESSAGE ARRIVES o If there is no path state for this destination, drop thereceiver. L5: A RESVmessagewhose RecvAddress matches one of the IP addressesand return. o Forward a copy of thelocal node must be discarded without processing. Figure 10 illustratesPTEAR message using theeffect ofsame rules as Braden, Zhang, et al. Expiration: September 1995 [Page 45] Internet Draft RSVP Specification March 1995 for a PATH message (see PATH REFRESH). o Each sender descriptor in therule L1 applied to RESV messages. It showsPTEAR message contains atransit router,SENDER_TEMPLATE object defines a sender S; process it as follows. 1. Locate the PSB for the pair: (session, S). If none exists, continue withonenext sender descriptor. 2. Examine the RSB's for this session andone receiver on each side; interfacesdelete any reservation state associated with sender S, depending upon the reservation style. For example: Delete aand c thereforeWF reservation for which S is the only sender. Delete an FF reservation for S. 3. Delete the PSB. PATH ERROR MESSAGE ARRIVES o If there areboth outgoing interfacesno existing PSB's for SESSION then drop the PERR message andphysical previous hops. Both receivers are making a Wildcard-Filter style reservation, in whichreturn. o Look up theRESVPSB for (session, sender); sender is defined by SENDER_TEMPLATE. If no PSB is found, drop PERR message and return. o If PHOP in PSB is local API, deliver error tobe forwarded to all previous hops for sendersapplication via an upcall: Call: <Upcall_Proc>( session-id, Path Error, 1, Error_code, Error_value, 0, SENDER_TEMPLATE, NULL, NULL) Note that CREDENTIAL, SENDER_TSPEC, and ADVERT objects in thegroup, with the exceptionmessage is ignored. Otherwise (PHOP is not local API), forward a copy of theinterface through which it arrived. Zhang,PERR message to the PHOP node. RESV MESSAGE ARRIVES Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 37]September 1995 [Page 46] Internet Draft RSVP SpecificationNovember 1994 ________________ a | | c ( R1, S1 ) <----->| Router |<-----> ( R2, S2 ) |________________| Send & Receive on (a) | Send & Receive on (c) | WF( *{3B}) <-- (a) | (c) <-- WF( *{3B}) | WF( *{4B}) --> (a) | (c) --> WF( *{4B}) | | Reserve on (a) | Reserve on (c) __________ | __________ | * {4B} | | | * {3B} | |__________| | |__________| | Figure 10: Example: Rule (1) for Preventing Loops. The loop-suppression rules forMarch 1995 A RESVmessages also prevent looping of RTEAR messages. Note that RTEAR messages are otherwise subject to fast loops, since they are not delayed by a refresh timeout period. PERR messages are routed upstream bymessage arrives through outgoing interface OI. o Check thesame rules used for FF and DF RESV messages (there isSESSION object. If there are noequivalent of wildcard-filterexisting PSB's forroutingSESSION then build and send aPERR message). Similarly,RERRmessages are routed bymessage (as described later) specifying "No Path Information", drop therules for PATH messages. For reasons explained above, no special loop-suppression rules are required in either case. 3.3 Soft State Management The RSVP state associated with a session in a particular node is divided into atomic elements that are created, refreshed,RESV message, and return. However, do not send the RERR message if the style has wildcard reservation scope andtimed out independently. The atomicitythis isdetermined bynot therequirement that any sender orreceivermay enter or leavehost itself. o Check the STYLE object. If style in the message conflicts with the style of any reservation for this sessionatin place on anytime,interface, reject the RESV message by building andits state should be createdsending a RERR message specifying "Bad Style", drop the RESV message, andtimed out independently. Managementreturn. o Check the CREDENTIAL object. Verify the CREDENTIAL field (if any) to check permission to create a reservation. [This check may also involve the CREDENTIAL fields from the PSB's in the scope ofRSVPthis reservation; in that case, it would better fit below in processing the individual flow descriptors.] o Check for path stateis complex becauseIf thereis not generallyare no PSB's matching the scope of this reservation, build and send aone-to-one correspondence between state carried in RSVP control messagesRERR message specifying "No Sender Information", drop the RESV message, and return. o Make reservations Process theresulting state in nodes. Duestyle-specific tail sequence. For FF style, execute the following steps for each b flow descriptor, i.e., each (FLOWSPEC, FILTERSPEC) pair. For WF style execute the following once, using some internal placeholder "WILD_FILTER" for FILTERSPEC tomerging,indicate wildcard scope. 1. Find or create asingle message contain state referring to multiple stored elements. Conversely, due toreservationsharing, a single storedstateelement may depend upon (typically,block (RSB) for themaximum of) state Zhang,4-tuple: (SESSION, NHOP, style, FILTERSPEC). 2. Start or restart the cleanout timer on the RSB. Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 38]September 1995 [Page 47] Internet Draft RSVP SpecificationNovember 1994 values received in multiple control messages. 3.3.1 Time Parameters For each element, thereMarch 1995 3. Start a refresh timer for this session if none was started. 4. If the RSB existed and if FLOWSPEC and the SENDER_TSPEC objects aretwo time parameters controllingunchanged, drop the RESV message and return. 5. Compute Sender_Tspec as themaintenancemaximum over the SENDER_TSPEC objects ofsoft state:therefresh period R andPSB's within theTTL (time-to-live) value T. R specifiesscope of theperiod between successive refresh messages overreservation. 6. Set Police_flag on if any PSB's in thesame link. T controls how long state will be retained after refreshes stop appearing. PATH and RESV messages specify both R and T. When messages are merged and forwarded toscope have thenext hop, R should beEntryPolice flag on, or if theminimum R that has been received,style is WF andT should bethere is more than one PSB in the scope, otherwise off. 7. Computer K_Flowspec, the effective kernel flowspec, as the maximumT that has been received. Thus,of thelargest T determines how long stateFLOWSPEC values in all RSB's for the same (SESSION, OI, FILTERSPEC) triple. Similarly, the kernel filter spec K_filter isretained,either the FILTER_SPEC object under consideration (unitary scope), or it is WILD_FILTER (wildcard scope). If there was no previous kernel reservation in place for (SESSION, OI, FILTERSPEC), call the kernel interface module: TC_AddFlowspec( Sender_Tspec, K_flowspec, Police_Flag ) If this call fails, build and send a RERR message specifying "Admission control failed", drop thesmallest R determinesRESV message, and return. Otherwise, record theresponsiveness of RSVP to route changes. Inkernel handle K_handle returned by thefirst hop, they are expectedcall in the RSB(s). Then call: TC_AddFilter( K_handle, K_Filter) tobe equal. The RSVP API shouldset the filter, drop the RESV message and return. /item However, if there was aconfigurable default value, which can be overridden by an application forprevious kernel reservation with handle K_handle, call the kernel interface module: TC_ModFlowspec( K_handle, K_Flowspec, Sender_Tspec) If this call fails, build and send aparticular session. To avoid gaps in user service due to lost RSVP messages, RSVP should be forgiving about missing refresh messages. A node should not discard anRERR message specifying "Admission control failed". In any case, drop the RESV message and return. Braden, Zhang, et al. Expiration: September 1995 [Page 48] Internet Draft RSVPstate element until K * Tmax has elapsed withoutSpecification March 1995 If processing arefresh message, where TmaxRESV message finds an error, a RERR message isthe maximumcreated containing flow descriptor and an ERRORS object. The Error Node field of theT values it has received. K is some small integer; K-1 successive messages may be lost before state is deleted. Currently K = 3ERRORS object (see Appendix A) issuggested. Let X indicate a particular message type (either "Path" or "Resv")set to the IP address of OI, anda particular session. Then each Xthe messagefrom node ais sent unicast tonode b carries refresh period Rab and TTL time Tab.NHOP. created RESV TEAR MESSAGE ARRIVES A RTEAR message arrives on outgoing interface OI. oAs X messages arrive at node b,If there are no existing PSB's for SESSION then drop thenode computesRTEAR message andsaves bothreturn. o Process themin overstyle-specific tail sequence to tear down reservations. For FF style, execute theRab values (min(Rab)) andfollowing steps for each b flow descriptor, i.e., each (FLOWSPEC, FILTERSPEC) pair. For WF style execute themax overfollowing once, using some internal placeholder "WILD_FILTER" for FILTERSPEC to indicate wildcard scope. 1. Find matching RSB(s) for theTab values (max(Tab)) from these messages. o The node uses K * max(Tab) as its cleanup timeout interval. o The node uses min(Rab's) as4-tuple: (SESSION, NHOP, style, FILTERSPEC). If no RSB is found, continue with next flow descriptor, if any. 2. Delete therefresh period. o Each refresh message forwarded by node bRSB(s). 3. If there are no more RSBs for the same (SESSION, OI, FILTERSPEC/) triple, call the kernel interface module: TC_ModFlowspec( K_handle ) tonode c has Tbc = max(Tab) and Rbc = min(Rab) o A node may impose an upper bound Tmaxdelete the reservation. Then build and forward alower bound Rmin, set by configuration information,new RERR message. - WF style: send a copy to each PHOP among all matching senders. - FF style: Send to PHOP of matching PSB. 4. Otherwise (there are other RSB's for the same reservation), recompute K_Flowspec andenforce: Rmin <= R <= T <= Tmax. Zhang,call the kernel interface module: TC_ModFlowspec( K_handle, K_Flowspec, Sender_Tspec) Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 39]September 1995 [Page 49] Internet Draft RSVP SpecificationNovember 1994 The receiver should be conservative about reactingMarch 1995 tocertain error messages. For example, during a route change a receiver may get back "No Path" error messages until Path messages have propagated alongupdate thenew route. 3.3.2 Teardown Teardown messages, like other RSVP messages, are sent as datagramsreservation, andmaythen execute the RESV REFRESH sequence (below). If this kernel call fails, return; the prior reservation will remain in place. RESV ERROR MESSAGE ARRIVES o Call the appropriate route discovery routine, using DestAddress from SESSION and (for multicast routing) SrcAddress from the Error Node field in the ERRORS object. Let the resulting routing bit mask belost (although a QoS is used that should minimizeM. o Determine thechances of congestive lossset ofRSVP messages). To increaseRSBs matching thereliabilitytriple: (SESSION, style, FILTERSPEC). If no RSB is found, drop RERR message and return. Recompute the maximum over the FLOWSPEC objects ofteardown, Q copiesthis set ofany given teardown message can be sent. Note that ifRSB's. If theiteration count QLUB was used in this computation, turn oninitiating teardown messages is > 1, thenthestate cannot actually be deleted until Q teardowns have been sent. The state would be placedLUB-flag ina "moribund" status meanwhile. The appropriate value of Q is an engineering issue. Q = 1 would bethesimplest and may be adequate, since unrefreshed state will time out anyway; teardown is an optimization. Note that if one or more teardown hops are lost,received RESV message. o Delete from therouter that failed to receive a teardown message will time out its stateset of RSVs any whose OI does not appear in the bit mask M andinitiate a new teardown message beyondwhose NHOP is not theloss point. Assuming that RSVPlocal API. If none remain, drop RERR messageloss probability is small (but non- zero),and return. For each PSB in thelongest time to delete state will seldom exceed one state timeout time K*Tab. Hereresulting set, do the following step. o If NHOP in PSB is local API, deliver error to application via anexample.upcall: Call: <Upcall_Proc>( session-id, Resv Error, 1, Error_code, Error_value, LUB-flag, FILTER_SPEC, FLOWSPEC, NULL) HereG1, G2, G3, and G4 are routers between a sender S and a receiver R. S initiates a PTEAR message (denoted by "PT"), but this messageLUB-flag islost between routers G2 and G3. Since G2 has deleted its state for S, G2 will cease refreshing G3 (though G3taken from the received packet, as possibly modified above. Otherwise (NHOP isstill refreshing G4, etc.) PT PT PT S ---> G1 ---> G2 -->x G3 G4 R After a time K*Tab, G3's state will time out, and G3 will initiatenot local API), forward ateardown for S path state: PT PT G3 ----> G4 ----> R If some hopcopy ofthis chain is lost, there will again be state timeoutthe RERR message tocontinuetheteardown.PHOP node. PATH REFRESH Thisprocess should terminate insequence may be entered by either the expiration of the path refresh timer for afew timeout periods. Zhang,particular session, or immediately as the result of processing a PATH message turning on the Refresh_Needed flag. For each virtual outgoing interface ("vif") V, build a PATH message Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 40]September 1995 [Page 50] Internet Draft RSVP SpecificationNovember 1994 3.3.3 Local Repair To accommodate merging, RSVP uses hop-by-hop refreshing of state, where each node sends refreshes to its next/previous hops periodically. However, as an optimization, local events could be used to trigger the RSVP module toMarch 1995 and sendsuch refreshes to any time. For example, suppose that the local routing protocol module were able to notify the RSVP module that a route has changed for particular destinations. The RSVP module could use this informationit totrigger an immediate refresh of state for these destinations alongV. To build thenew route. This would allow fast adaptation to routing changes withoutmessage, consider each PSB whose ROUTE_MASK includes V, and do theoverhead of a short refresh period. 3.4 Sending RSVP Messages Under overload conditions, lost RSVP control messages could causefollowing: o Pass theloss of resource reservations. It recommended that routers be configuredADVERT and SENDER_TSPEC objects present in the PSB togivethe kernel call TC_Advertise, and get back apreferred class of service to RSVP packets. RSVP should not use significant bandwidth, butmodified ADVERT object. Pack this modified object into thedelay of RSVP packets needs to be controlled. An RSVPPATHor RESVmessageconsists of a small root segment (24 or 28 bytes) followed bybeing built. o Create alist of descriptors. The descriptors are bulkysender descriptor sequence containing the SENDER_TEMPLATE, CREDENTIAL, andthere could be a large number of them, resultingSENDER_TSPEC objects, if present inpotentially very large messages. IP fragmentation is inadvisable, since itthe PSB. Pack the sender descriptor into the PATH message being built. o If the PSB hasbad error characteristics. Instead, RSVP-level fragmentation should be used. That is, athe EntryPolice flag on and if interface V is not capable of policing, turn the EntryPolice flag on in the PATH messagewith a long listbeing built. o If the maximum size ofdescriptors willthe PATH message is reached, send the packet out interface V and start packing a new one. RESV REFRESH This sequence may bedivided into segments that will fit into individual datagrams, each carryingentered by either thesame root fields. Eachexpiration ofthese messages will be processed atthereceiving node, withreservation refresh timer for a particular session, or immediately as the result of processing a RESV message. Each PSB for this session is considered in turn, to compute a style- dependent tail sequence. These sequences for acumulative effect ongiven PHOP are then packed into thelocal state. No explicit reassembly is needed.same message(s) and sent to that PHOP. Thelargest RSVP messagelogic is556 bytes. 3.5 Automatic Tunneling Itsomewhat different depending upon whether the scope of the reservations isimpracticalwildcard or not (they may not be mixed). For each PSB that does not correspond todeploy RSVP (or any protocol) atthesame moment throughoutAPI, do the following. o Compute (FLOWSPEC, FILTER_SPEC) Pair Select each RSB in whose reservation scope theInternet,PSB falls, andRSVP may never be deployed everywhere. RSVP must therefore provide correct protocol operation even when two RSVP-capable routers are joined by an arbitrary "cloud"compute the maximum over the FLOWSPEC objects ofnon-RSVP routers. RSVP will automatically tunnel through such a non-RSVP cloud. Both RSVPthis set of RSB's. Also, select an appropriate FILTER_SPEC. The scope depends upon the style andnon-RSVP routers forward PATH messages towardsthedestination address using their local uni-/multicast routing table. Therefore,filter spec of theroutingRSB: 1. WF: Select every RSB whose OI matches a bit in the ROUTE_MASK ofPath messages will be Zhang,the PSB. In this case, FILTER_SPEC is the standard WILD_FILTER. 2. FF: Select every RSB whose FILTER_SPEC matches SENDER_TEMPLATE in the RSB. This matching process should Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 41]September 1995 [Page 51] Internet Draft RSVP SpecificationNovember 1994 unaffected by non-RSVP routers inMarch 1995 consider wildcards. In this case, FILTER_SPEC is taken from any of thepath. Whenmatching RSB's. [?? Need to either 'merge' filter specs, which probably means to remove gratuitous wildcards??] This computation also yields aPATHstyle (since style must be consistent across RSB's for given session). [??Again, need merging rules]] o Build RESV packets Append this (FLOWSPEC, FILTER_SPEC pair) to the RESV messagetraverses a non-RSVP cloud,being built for destination PHOP (from thecopies that emerge will carry as a Previous Hop addressPSB). When theIP addresspacket fills, or upon completion of all PSB's with thelast RSVP-capable router before enteringsame PHOP, set thecloud. This will cause effectively construct a tunnel throughNHOP address in thecloud for RESV messages, which will be forwarded directlymessage to thenext RSVP-capable router oninterface address and send thepath(s) back towardspacket out that interface to thesource. This automatic tunneling capability ofPHOP address. Braden, Zhang, et al. Expiration: September 1995 [Page 52] Internet Draft RSVPhas a cost: a PATH message must carrySpecification March 1995 appendix 6. Object Type Definitions C-types are defined for thesession DestAddresstwo Internet address families IPv4 and IP6. To accomodate other address families, additional C-types could easily be defined. These definitions are contained asits IPan Appendix to ease updating. 6.1 SESSION Class Currently, SESSION objects contain the pair: (DestAddress, DestPort), where DestAddress is the data destinationaddress; it cannotaddress and DestPort is the UDP/TCP destination port. Other SESSION C-Types could beaddressed hop-by-hop. As a result, each RSVP router must have a small changedefined inits multicast forwarding paththe future torecognizesupport other demultiplexing conventions in the transport-layer or application layer. o IPv4/UDP SESSION object: Class = 1, C-Type = 1 +-------------+-------------+-------------+-------------+ | IPv4 DestAddress (4 bytes) | +-------------+-------------+-------------+-------------+ | //////////// | DestPort | +-------------+-------------+-------------+-------------+ o IP6/UDP SESSION object: Class = 1, C-Type = 129 +-------------+-------------+-------------+-------------+ | | + + | | + IP6 DestAddress (16 bytes) + | | + + | | +-------------+-------------+-------------+-------------+ | //////////// | DestPort | +-------------+-------------+-------------+-------------+ Braden, Zhang, et al. Expiration: September 1995 [Page 53] Internet Draft RSVPmessages (bySpecification March 1995 6.2 SESSION_GROUP Class o IPv4 SESSION_GROUP Object: Class = 2, C-Type = 1: +-------------+-------------+-------------+-------------+ | IPv4 Reference DestAddress | +-------------+-------------+-------------+-------------+ | Session_Group ID | Count | Rank | +-------------+-------------+-------------+-------------+ o IP6 SESSION_GROUP Object: Class = 2, C-Type = 129: +-------------+-------------+-------------+-------------+ | | + + | | + IP6 Reference DestAddress + | | + + | | +-------------+-------------+-------------+-------------+ | Session-Group ID | Count | Rank | +-------------+-------------+-------------+-------------+ Braden, Zhang, et al. Expiration: September 1995 [Page 54] Internet Draft RSVP Specification March 1995 6.3 RSVP_HOP Class o IPv4 RSVP_HOP object: Class = 3, C-Type = 1 +-------------+-------------+-------------+-------------+ | IPv4 Next/Previous Hop Address | +-------------+-------------+-------------+-------------+ Braden, Zhang, et al. Expiration: September 1995 [Page 55] Internet Draft RSVP Specification March 1995 o IP6 RSVP_HOP object: Class = 3, C-Type = 129 +-------------+-------------+-------------+-------------+ | | + + | | + IP6 Next/Previous Hop Address + | | + + | | +-------------+-------------+-------------+-------------+ This object provides the IPprotocol number) and intercept them for local processing. See Section 3.6.5 below. (There is a potential defect in tunneling. Merged PATH messages can carry information for a listaddress ofsenders, and since multicast routing depends in general upon the sender, it is not possible to ensure that all the non-RSVP routers along the tunnel will be able to routethepacket properly. The effect turns out to be that tunnels may distribute path information to RSVP routers where it should not go,interface through whichmay in turn lead to unused reservations at these routers. This is hoped to be an acceptable defect.) Of course, if an intermediate cloud does not support RSVP, it is unable to perform resource reservation. Inthe last RSVP-knowledgeable hop forwarded thiscase, firm end- to-end service guarantees cannot be made. However, if there is sufficient excess capacity through such a cloud, acceptable and useful realtime service may still be possible. 3.6 Interfaces 3.6.1 Reservation Parameters All variable-lengthmessage. Braden, Zhang, et al. Expiration: September 1995 [Page 56] Internet Draft RSVPparameters use the same general format. They begin with a length octet followed by a type octet, and occupy an integral number of fullwords.Specification March 1995 6.4 STYLE Class o STYLE-WF object: Class = 4, C-Type = 1 +-------------+-------------+-------------+-------------+ | Style=1 | //////// | //////// | ///////// | +-------------+-------------+-------------+-------------+ o STYLE-FF object: Class = 4, C-Type = 2 +-------------+-------------+-------------+-------------+ | Style=2 | //////// | //////// | FD Count | +-------------+-------------+-------------+-------------+ FD Count Thelength octet specifies the total lengthcount ofthe parameterelements infullwords or zero to indicate no parameter. An RSVP implementation can store and pass such parameters as opaque objects. o Flowspec Format Flowspec type 1 is specific totheCSZ packet scheduler [CSZ92]. It hasvariable-length object list that follows. See thefollowing format: Zhang,RESV message format definition earlier. Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 42]September 1995 [Page 57] Internet Draft RSVP SpecificationNovember 1994 +-----------+-----------+-----------+-----------+ | FlowSLen=6|FlowSType=1| VFoffset |March 1995 6.5 Flowspec Class o CSZ FLOWSPEC object: Class = 5, C-Type = 1 +-----------+-----------+-----------+-----------+ | QoSType (Guaranteed, Predictive, ...)Service Code | +-----------+-----------+-----------+-----------+ |Max end-to-end delay (ms)b: Token Bucket Depth (bits) | +-----------+-----------+-----------+-----------+ | r: Average data rate(bits/ms)(bits/sec) | +-----------+-----------+-----------+-----------+ |Token Bucket Depth (bits)d: Max end-to-end delay (ms) | +-----------+-----------+-----------+-----------+ |Global Share Handle(For Future Use) | +-----------+-----------+-----------+-----------+Flowspec format 2QoS Service Code Integer value defining what service is being requested. The values currently definedin RFC-1363 [Partridge92]. o Filterspec Format For compactness and simplicity of processing,for thisversion ofcode are: 1 = Guaranteed Service The Tspec is (b, r), while theRSVP specification defines an RSVP Filterspec to be composed of an explicit IP address plus an optional variable-length mask-and-value pair VF, inRspec is (r). (d) is ignored. 2 = Bounded-Delay Predictive Service The Tspec is (b, r), while thefollowing format: +-----------+-----------+-----------+-----------+Rspec is (d). Braden, Zhang, et al. Expiration: September 1995 [Page 58] Internet Draft RSVP Specification March 1995 6.6 FILTER_SPEC Class o IPv4/UDP FILTER_SPEC object: Class = 6, C-Type = 1 +-------------+-------------+-------------+-------------+ |FiltSLen |FiltSType=1| VFoffsetIPv4 SrcAddress (4 bytes) |+-----------+-----------+-----------+-----------++-------------+-------------+-------------+-------------+ |Sender IP AddressProtocol Id |+-----------+-----------+-----------+-----------+ ---////// |V: VF Value PartSrcPort |Nf / / octets / / +-----------+-----------+-----------+-----------+ ---+-------------+-------------+-------------+-------------+ o IP6/UDP FILTER_SPEC object: Class = 6, C-Type = 129 +-------------+-------------+-------------+-------------+ |M: VF Mask Part|Nf / / octets / / +-----------+-----------+-----------+-----------+ --- The value M and the mask V each have length: Nf = (4*FiltSLen - 8)/2 octets. M+ + | | + IP6 SrcAddress (16 bytes) + | | + + | | +-------------+-------------+-------------+-------------+ | Protocol Id | ////// | SrcPort | +-------------+-------------+-------------+-------------+ SrcAddress is an IP address for a host, andV defineSrcPort is afilter that usesUDP/TCP source port, defining amask-and-match algorithm applied to the packet at VFoffset octets from the beginning of the IP header.sender. Braden, Zhang, et al. Expiration: September 1995 [Page 59] Internet Draft RSVP Specification March 1995 6.7 SENDER_TEMPLATE Class o IPv4/UDP SENDER_TEMPLATE object: Class = 7, C-Type = 1 Definition same as IPv4/UDP FILTER_SPEC object. o IP6/UDP SENDER_TEMPLATE object: Class = 7, C-Type = 129 Definition same as IP6/UDP FILTER_SPEC object. 6.8 SENDER_TSPEC Class Theminimum lengthmost common form ofZhang,Tspec is a token bucket. o Token Bucket SENDER_TSPEC object: Class = 8, C-Type = 1 +-----------+-----------+-----------+-----------+ | b: Token Bucket Depth (bits) | +-----------+-----------+-----------+-----------+ | r: Average data rate (bits/sec) | +-----------+-----------+-----------+-----------+ Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 43]September 1995 [Page 60] Internet Draft RSVP SpecificationNovember 1994 this format of sender template is 7 octets (FiltSLenMarch 1995 6.9 ADVERT Class [TBD] 6.10 TIME_VALUES Class o TIME_VALUES Object: Class =2). A wildcard Filterspec, which will match any sender host, has zero for the Sender IP Address [If VM part zero also, could shorten to FiltSLen10, C-Type =2]. To speed RSVP processing, a filterspec that appears in an1 +-------------+-------------+-------------+-------------+ | Refresh Period | +-------------+-------------+-------------+-------------+ | State TTL Time | +-------------+-------------+-------------+-------------+ Braden, Zhang, et al. Expiration: September 1995 [Page 61] Internet Draft RSVPmessage use the following "canonical form". o The high-order octet of the mask M must be non-zero (this can always be achieved by adjusting VFoffset).Specification March 1995 6.11 ERROR_SPEC Class oThe (V,M) part must not include either the sender or receiver address of the IP header; these are carried explicitly. ISSUE: There are many possible filter rules that cannot be expressed using a simple mask and value pair. A compact and general filter encoding is for further study.IPv4 ERROR_SPEC object: Class = 11, C-Type = 1 +-------------+-------------+-------------+-------------+ | IP4 Error Node Address (4 bytes) | +-------------+-------------+-------------+-------------+ | Error Code | ////////// | Error Value | +-------------+-------------+-------------+-------------+ oAuthenticator Format The following simple form of authenticator is defined: +-----------+-----------+-----------+-----------+IP6 ERROR_SPEC object: Class = 11, C-Type = 129 +-------------+-------------+-------------+-------------+ | |AuthLen+ + |AuthType=1||+-----------+-----------++ IP6 Error Node Address (16 bytes) + |Mailbox name: user@domain|// // +-----------+-----------+-----------+-----------++ + | | +-------------+-------------+-------------+-------------+ | Error Code | ////////// | Error Value | +-------------+-------------+-------------+-------------+ Errnor Node Therules for merging and interpreting this field require further study. 3.6.2 Application/RSVP Interface This section describes a generic API from an application to an RSVP control process.IP address Error Code A one-octet error description. 01 = Insufficient memory 02 = Count Wrong Thedetails of a real interface may be operating-system dependent; the following can only suggest the basic functions to be performed. SomeFD Count field does not match length ofthese calls causemessage. 03 = No path informationto be returned asynchronously. An application could directly send and receive RSVP messages, Zhang,for this Resv 04 = No Sender information for this Resv Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 44]September 1995 [Page 62] Internet Draft RSVP SpecificationNovember 1994 just as an application can do file transfer using UDP. However, we envision that many applications willMarch 1995 There is path information, but it does notwant to knowinclude thedetailssender specified in any ofRSVP operation, nor to providethetiming services necessary to keepFilterspecs listed in thestate refreshed, any more than an application wants to handle TCP retransmission timeouts. Therefore, a host using RSVP may have an RSVP control process to handle these functions. Using local IPC, applications will registerResv messager. 05 = Incorrect Dynamic Reservation Count Dynamic Reservation Count is zero ormodify resource requestsless than FD Count. 06 = Filterspec error 07 = Flowspec syntax error 08 = Flowspec value error Internal inconsistency of values. [What should be done withthis processFlowspec Feature Not Supported?] 09 = Resources unavailable [Sub-reasons? Depend upon traffic control andreceive notifications of success or changeadmission control algorithms?] 10 = Illegal style Error Value Specific cause ofconditions. Register Call: REGISTER( DestAddress, ResvID, SND-flag, RCV-flag, [, DROP-flag] [, rsvpTTL] [, SenderTemplate] [, flowspec] [, UserCredentials] ) -> session-id This call initiates RSVP processing forthesession (DestAddress, ResvID). If successful,error described by thecall returns immediately withError Code. Braden, Zhang, et al. Expiration: September 1995 [Page 63] Internet Draft RSVP Specification March 1995 6.12 CREDENTIAL Class [TBD] 6.13 INTEGRITY Class [TBD] Braden, Zhang, et al. Expiration: September 1995 [Page 64] Internet Draft RSVP Specification March 1995 7. UDP Encapsulation As described earlier, RSVP control messages are intended to be carried as "raw packets", directly within IP datagrams. Implementing RSVP in alocal session identifier "session-id",node will typically require an intercept in the packet forwarding path for protocol 46, whichmay be usedmeans a kernel change. However, for ease of installing RSVP on host systems insubsequent calls. Following this call, an asynchronous ERROR or EVENT call (see below)the short term, it mayoccur at any time. SND-flag shouldbeset true if thedesirable to avoid hostwill send data, and RCV-flag shouldkernel changes by supporting UDP encapsulation of RSVP messages. This encapsulation would beset true ifused between hosts and thehostlast- (or first-) hop router(s). This scheme willreceive data. Setting neither true isalso support the case of anerror.intermediate RSVP router whose kernel supports multicast but does not have the RSVP intercept, by allowing UDP encapsulation on each interface. Theoptional parameters DROP-flag, rsvpTTL, SenderTemplate, and Flowspec should be supplied only if SND-flag is true. DROP-flag indicates that session data packetsUDP encapsulation approach must support a domain thatdo not match any active filtercontains a mix of "UDP-only" hosts, which require UDP encapsulation, and "raw- capable" host, which can use raw RSVP packets. Raw-capable hosts and first-hop router(s) must send each RSVP message twice in the local domain, once as a raw packet and once with UDP encapsulation; these nodes will also receive somenode should be dropped at that node; otherwise, suchlocal RSVP packetswill be forwarded using a best-effort QoS. The rsvp-TTL parameter specifies the IP Time-to-Live fieldin both formats. We assume that the only negative impact of this duplication will beused(negligible) additional packet processing overhead inPATH messages. The value of rsvp-TTL should matchtheTTL fieldraw-capable hosts and first-hop routers. [REST TBD] 8. DF Style (Experimental) In addition tobe sent in data packets, so they will have the same multicast scope. A REGISTER call with SND-flag equals TRUE will initiatethetransmission of PATH messages. Reserve Call: RESERVE( session-id, style [, DF-chan-count] Flowspec-list, Filterspec-list) A receiver usesWF and FF styles defined in thiscall to makespecification, aresource reservation Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 45] Internet Draft RSVP Specification November 1994 for the session registered as `session-id'.Dynamic Filter (DF) style has also been proposed. The following describes this style and gives examples of its usage. At this time, DF styleparameterisan integer index indicating theexperimental. 8.1 Reservation Styles A Dynamic-Filter (DF) style reservationstyle. The DF-chan-count parameter, indicating thedecouples reservations from filters. Each DF reservation request specifies a number D ofDynamic Filter channelsdistinct reservations to bereserved, should only be included ifmade using thestyle is DF.same specified flowspec, and these reservations have a wildcard reservation scope, so they go everywhere. Thefirst RESERVE call will initiate the periodic transmission of RESV messages. A later RESERVE call may be given to modify the parametersnumber ofthe earlier call (but note that changing thereservationsmay resultthat are actually made inadmission control failure, depending upona particular node is D' = min(D,Ns), where Ns is thestyle). The RESERVE call returns immediately. Following this call, an asynchronous ERROR or EVENT call may come at any time. Release Call: RELEASE( session-id ) This call will terminate RSVP state fortotal number of senders upstream of thesession specified by session-id. It will send appropriate "Teardown" messages and cease sending refreshes. Error Upcall Call: ERROR( ) -> session-id, error-type, error-code [, flowspec] [, filterspec] This upcall may occur asynchronously at any time afternode. Like aREGISTER call and beforeFF style request, aRELEASE call, to indicate an error. The allowed values of error-type and error-code depend on whether the node is sending, receiving, or both. The ERROR upcall reporting an admission control failureDF style request causes distinct reservations for different senders. In addition toa receiver will specify in `flowspec' the flowspec that actually failed. This may differ fromD and theflowspec specified by this application inflowspec, aRESERVE call, due to upstream merging withDF style reservationrequests from other receivers. Event Upcall Call: EVENT( ) -> session-id, info-type, [, flowspec-list] [, filterspec-list] This upcallmayoccur asynchronously at any time after a REGISTER call and beforealso specify aRELEASE call, to signal an Zhang,list of K filterspecs, for some K in the range: 0 <= K Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 46]September 1995 [Page 65] Internet Draft RSVP SpecificationNovember 1994 eventMarch 1995 <= D'. These filterspecs define particular senders to use the D' reservations, and this list establishes the scope for the filter specs. Once a DF reservation has been established, the receiver may change the set of filterspecs topass informationspecify a different selection of senders, without a new admission control check (assuming D' and the common flowspec remain unchanged). This is known as "channel switching", in analogy with a television set. In order to provide assured channel switching, each node along theapplication. The `info-type' field indicatespath must reserve enough bandwidth for all D' channels, even though some of this bandwidth may be unused at any one time. If D' changes (because the receiver changed D or because the number Ns oftwo possible event types. A Path event indicatesupstream sources changed), or if thereceiptcommon flowspec changes, the refresh message is treated as a new reservation that is subject to admission control and may fail. The essential difference between the FF and DF styles is that the DF style allows a receiver to switch channels without danger ofa PATH message, indicatingan admission denial due to limited resources (unless a topology change reroutes traffic along a lower-capacity path or new senders appear), once theapplicationinitial reservations have been made. This in turn implies thatthere is at least one active sender. A Reservation event indicates the receipt of a RESV message, indicating totheapplicationDF style creates reservations thatthere ismay not be in use atleast one receiver. Although these messages are repeatedly received,any given time. The DF style is compatible with theAPI should makeFF style but not thecorresponding asynchronous upcall toWF style. 8.2 Examples To give an example of theapplication only onDF style, we use thefirst event,following notation: o DF Style DF( n, {r} ; ) orwhenDF( n, {r} ; S1, S2, ...) This message carries theinformation to be reported changes. ISSUE: The precise form and functioncount n ofthe flowspec-list and filterspec-list parameters arechannels to bedetermined. 3.6.3 RSVP/Traffic Control Interface Inreserved, eachrouter and host, enhanced QoS is achieved byusing common flowspec r. It also carries agrouplist, perhaps empty, ofinter-related functions: a packet Classifier,filterspecs defining senders. Figure 11 shows anadmission control module, and a packet scheduler. We group these functions together under the heading traffic control. RSVP uses the interfaces in this section to invoke the traffic control functions. 1. Make a Reservation Call: Rhandleexample of Dynamic-Filter reservations. The receivers downstream from interface (d) have requested two reserved channels, but selected only one sender, S1. The node reserves min(2,3) =TCAddFlow( Flowspec, DropFlag, [SessionFilterspec [, SenderFilterspec]] ) Returns an internal handle Rhandle for subsequent references to this reservation. This call passes Flowspec to admission control2 channels of size B on interface (d), andreturns an error code if Flowspec is malformed or if the requested resources are unavailable. Otherwise,itestablishes a new reservation channel correspondingthen applies any specified filters toRhandle, and if Filterspecs are supplied, installs a corresponding filter in the classifier. For FF reservation requests, RSVP knows about sharing and calls AddFlowthese channels. Since onlyfor distinct source pipes. For DF reservation requests: suppose that the RESV message Zhang,one sender was specified, one channel has no corresponding filter, as shown by `?'. Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 47]September 1995 [Page 66] Internet Draft RSVP SpecificationNovember 1994 specifies a Dynamic Reservation Count = D,March 1995 Similarly, the receivers downstream of interface (c) have requested two channels andF flow descriptors, where 0 <= F <= D. Then RSVP calls AddFlow D times,selected senders S1 andD - F of those callsS2. The two channels might havenull filterspecs. 2. Switch a Channel Call: TCModFilter( Rhandle, [new Filterspec]) This call replaces the filter without calling admission control. It may replace an existing filter with no filter, modify an existing filter,been one channel each from R1 and R2, orreplace no filtertwo channels requested bya filter. 3. Modify Flowspec Call: TCModFlowspec( Rhandle, oldFlowspec, newFlowspec) Here newFlowspec may be larger or smallerone of them, for example. | Send | Reserve Receive | | ________ DF( 1,{B}; S1) <- (a) | (c) | S1{B} | (c) <- DF( 2,{B}; S1, S2) | |________| | | S2{B} | | |________| | ------------------------|------------------------------------------- | ________ DF( 2,{B}; S2) <- (b) | (d) | S1{B} | (d) <- DF( 2,{B}; S1) | |________| | | ?{B} | | |________| Figure 11: Dynamic-Filter Reservation Example A router should not reserve more Dynamic-Filter channels thanoldFlowspec. 4. Delete Flow Call: TCDeleteFlow( Rhandle ) This call killsthereservation and reduces the reference count of, and deletes ifnumber of upstream sources (three, in thecount is zero, any filter associated with this handle. 5. Initialize Call: TCInitialize( ) This callrouter of Figure 11). Since there isused when RSVP initializes its state, to clear out all existing classifier and/or packet scheduler state. 3.6.4 RSVP/Routing Interface An RSVP implementation needs the following supportonly one source upstream from previous hop (a), thepacket forwarding and routing mechanismfirst parameter of thenode. o Promiscuous receive mode for RSVP messages Any datagram received for IP protocol 46 is to be divertedDF message (the count of channels tothe RSVP program for processing, without being forwarded. Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 48] Internet Draft RSVP Specification November 1994 o Route discovery RSVP mustbeablereserved) was decreased todiscover1 in theroute(s) thatforwarded reservations. However, this is unnecessary, because therouting algorithm would have used for forwardingrouters upstream will reserve only one channel, regardless. When aspecific datagram. GetUCRoute( DestAddress ) -> NextHop, Interface GetMCRoute( SrcAddress, DestAddress ) -> Interface o Outgoing Link Specification RSVP mustDF reservation is received, it is labeled with the IP address of the next hop (RSVP-capable) router, downstream from the current node. Since the outgoing interface may beabledirectly connected toforcea(multicast) datagramshared medium network or to a non-RSVP-capable router, there may besentmore than one next-hop node downstream; if so, each sends independent DF RESV messages for a given session. The number N' of DF channels reserved on an outgoing interface is given by the formula: N' = min( D1+D2+...Dn, Ns), where Di is the D value (channel reservation count) in aspecific outgoing virtual link, bypassingRESV from thenormal routing mechanism. A virtual link may beith next-hop node. For areal outgoing link orDF reservation request with amulticast tunnel. This is necessary becauseDynamic Reservation Count = C, Braden, Zhang, et al. Expiration: September 1995 [Page 67] Internet Draft RSVPmay send different versions of outgoing PATH messages on different interfaces, for the same source and destination addresses. o Discover (Virtual) Interface ListSpecification March 1995 RSVPmust be able to learn what real and virtual interfaces exist. 4. ACKNOWLEDGMENTS Lixia Zhang, Scott Shenker, Deborah Estrin, Dave Clark, Sugih Jamin, Shai Herzog, Steve Berson, Steve Deering, Bob Braden, and Daniel Zappala have all made contributions toshould call TC_AddFlowspec C times. 8.3 Resv Messages Add thedesignfollowing sequence: <style-specific-tail> ::= <Style-DF> <FLOWSPEC> <filter spec list> <filter spec list> ::= <empty> | <filter spec list> <FILTER_SPEC> 8.4 STYLE Class o STYLE-DF object: Class = 4, C-Type = 3 +-------------+-------------+-------------+-------------+ | Style=3 | //////// | Dyn Resv Cnt| FD Count | +-------------+-------------+-------------+-------------+ Style 3 = Dynamic-Filter Dyn Resv Count The number ofRSVP. We are gratefulchannels toJamin, Herzog, and Berson for prototype implementations. The original protocol conceptsbe reserved forRSVP arose out of discussions in meetings of the End-to-End Research Group.a Dynamic Filter style reservation. This integer value must not less than FD Count. REFERENCES [CSZ92] Clark, D., Shenker, S., and L. Zhang, "Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanisms", Proc. SIGCOMM '92, Baltimore, MD, August 1992. [ISInt93] Braden, R., Clark, D., and S. Shenker, "Integrated Services in the Internet Architecture: an Overview", RFC 1633, ISI, MIT, and PARC, June 1994. [IServ93] Shenker, S., Clark, D., and L. Zhang, "A Service Model for an Integrated Services Internet", Work in Progress, October 1993.Zhang, Braden, et al. Expiration: May 95 FORMFEED[Page 49] Internet Draft RSVP Specification November 1994[Partridge92] Partridge, C., "A Proposed Flow Specification", RFC 1363, BBN, September 1992. Braden, Zhang, et al. Expiration: September 1995 [Page 68] Internet Draft RSVP Specification March 1995 [Shenker94] Shenker, S., "Two-Pass or Not Two-Pass", Current Meeting Report, RSVP Working Group, Proceedings of the Thirtieth Internet Engineering Task Force, Toronto, Canada, July 1994. [RSVP93] Zhang, L., Deering, S., Estrin, D., Shenker, S., and D. Zappala, "RSVP: A New Resource ReSerVation Protocol", IEEE Network, September 1993. Security ConsiderationsAs noted inSee Section2.1, the ability to reserve resources will create a requirement for authentication of users who request reservations. An authentication field has been included in this version of the protocol spec, but further study on its format and usage will be required.2.5. Authors' Addresses Lixia Zhang Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, CA 94304 Phone: (415) 812-4415 EMail: Lixia@PARC.XEROX.COM Bob Braden USC Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 Phone: (310) 822-1511 EMail: Braden@ISI.EDU Deborah Estrin Computer Science Department University of Southern California Los Angeles, CA 90089-0871 Phone: (213) 740-4524 EMail: estrin@USC.EDUZhang,Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 50]September 1995 [Page 69] Internet Draft RSVP SpecificationNovember 1994March 1995 Shai Herzog USC Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 Palo Alto, CA 94304 Phone: (310) 822 1511 EMail: Herzog@ISI.EDU Sugih Jamin Computer Science Department University of Southern California Los Angeles, CA 90089-0871 Phone: (213) 740-6578 EMail: jamin@catarina.usc.eduZhang,Braden, Zhang, et al. Expiration:May 95 FORMFEED[Page 51]September 1995 [Page 70] ----