Network Working Group Y. Rekhter INTERNET DRAFT Juniper Networks T. Li Procket Networks, Inc. S. Hares NextHop Technologies, Inc. Editors A Border Gateway Protocol 4 (BGP-4)<draft-ietf-idr-bgp4-17.txt><draft-ietf-idr-bgp4-18.txt> Status of this Memo This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC2026. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet- Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as ``work in progress.'' The list of current Internet-Drafts can be accessed at http://www.ietf.org/ietf/1id-abstracts.txt The list of Internet-Draft Shadow Directories can be accessed at http://www.ietf.org/shadow.html.1. Acknowledgments ThisSpecification of Requirements The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this documentwas originally publishedare to be interpreted asRFC 1267described inOctober 1991, jointly authored by Kirk Lougheed and Yakov Rekhter. We would like to express our thanks to Guy Almes, Len Bosack, and Jeffrey C. Honig for their contributions to the earlier versionRFC2119 [RFC2119]. Table ofthis document. We like to explicitly thank Bob Braden for the reviewContents Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1. Definition ofthe earlier versioncommonly used terms . . . . . . . . . . . . . . 4 2. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 6 3. Summary ofthis document as well as his constructiveOperation . . . . . . . . . . . . . . . . . . . . . 7 3.1 Routes: Advertisement andvaluable comments. We would also like to thank Bob Hinden, Director forStorage . . . . . . . . . . . . . . 9 3.2 Routingof the Internet Engineering Steering Group,Information Bases . . . . . . . . . . . . . . . . . . 10 4. Message Formats . . . . . . . . . . . . . . . . . . . . . . . 11 4.1 Message Header Format . . . . . . . . . . . . . . . . . . . . 11 4.2 OPEN Message Format . . . . . . . . . . . . . . . . . . . . . 12 4.3 UPDATE Message Format . . . . . . . . . . . . . . . . . . . . 14 4.4 KEEPALIVE Message Format . . . . . . . . . . . . . . . . . . 21 4.5 NOTIFICATION Message Format . . . . . . . . . . . . . . . . . 21 5. Path Attributes . . . . . . . . . . . . . . . . . . . . . . . 23 5.1 Path Attribute Usage . . . . . . . . . . . . . . . . . . . . 25 5.1.1 ORIGIN . . . . . . . . . . . . . . . . . . . . . . . . . . 25 5.1.2 AS_PATH . . . . . . . . . . . . . . . . . . . . . . . . . . 25 5.1.3 NEXT_HOP . . . . . . . . . . . . . . . . . . . . . . . . . 26 5.1.4 MULTI_EXIT_DISC . . . . . . . . . . . . . . . . . . . . . . 28 5.1.5 LOCAL_PREF . . . . . . . . . . . . . . . . . . . . . . . . 28 5.1.6 ATOMIC_AGGREGATE . . . . . . . . . . . . . . . . . . . . . 29 5.1.7 AGGREGATOR . . . . . . . . . . . . . . . . . . . . . . . . 30 6. BGP Error Handling . . . . . . . . . . . . . . . . . . . . . . 30 6.1 Message Header error handling . . . . . . . . . . . . . . . . 30 6.2 OPEN message error handling . . . . . . . . . . . . . . . . . 31 6.3 UPDATE message error handling . . . . . . . . . . . . . . . . 32 6.4 NOTIFICATION message error handling . . . . . . . . . . . . . 34 6.5 Hold Timer Expired error handling . . . . . . . . . . . . . . 34 6.6 Finite State Machine error handling . . . . . . . . . . . . . 34 6.7 Cease . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 6.8 BGP connection collision detection . . . . . . . . . . . . . 35 7. BGP Version Negotiation . . . . . . . . . . . . . . . . . . . 36 8. BGP Finite State machine . . . . . . . . . . . . . . . . . . . 36 8.1 Events for the BGP FSM . . . . . . . . . . . . . . . . . . . 37 8.1.1 Administrative Events . . . . . . . . . . . . . . . . . . 37 8.1.2 Timer Events . . . . . . . . . . . . . . . . . . . . . . . 38 8.1.3 TCP connection based Events . . . . . . . . . . . . . . . . 39 8.1.4 BGP Messages based Events . . . . . . . . . . . . . . . . . 41 8.2 Description of FSM . . . . . . . . . . . . . . . . . . . . . 43 8.2.1 FSM Definition . . . . . . . . . . . . . . . . . . . . . . 43 8.2.1.1 Terms "active" and "passive" . . . . . . . . . . . . . . 43 8.2.1.2 FSM andthe teamcollision detection . . . . . . . . . . . . . . . 44 8.2.2 Finite State Machine . . . . . . . . . . . . . . . . . . . 44 9. UPDATE Message Handling . . . . . . . . . . . . . . . . . . . 57 9.1 Decision Process . . . . . . . . . . . . . . . . . . . . . . 58 9.1.1 Phase 1: Calculation ofreviewers he assembled to review the earlier version (BGP-2)Degree ofthis document. This team, consistingPreference . . . . . . . 59 9.1.2 Phase 2: Route Selection . . . . . . . . . . . . . . . . . 60 9.1.2.1 Route Resolvability Condition . . . . . . . . . . . . . . 61 9.1.2.2 Breaking Ties (Phase 2) . . . . . . . . . . . . . . . . . 62 9.1.3 Phase 3: Route Dissemination . . . . . . . . . . . . . . . 64 9.1.4 Overlapping Routes . . . . . . . . . . . . . . . . . . . . 65 9.2 Update-Send Process . . . . . . . . . . . . . . . . . . . . . 66 9.2.1 Controlling Routing Traffic Overhead . . . . . . . . . . . 67 9.2.1.1 Frequency ofDeborah Estrin, Milo Medin, John Moy, Radia Perlman, Martha Steenstrup, Mike St. Johns, and Paul Tsuchiya, acted with a strong combinationRoute Advertisement . . . . . . . . . . . . 67 9.2.1.2 Frequency oftoughness, professionalism, and courtesy. This updatedRoute Origination . . . . . . . . . . . . . 68 9.2.2 Efficient Organization of Routing Information . . . . . . . 68 9.2.2.1 Information Reduction . . . . . . . . . . . . . . . . . . 68 9.2.2.2 Aggregating Routing Information . . . . . . . . . . . . . 69 9.3 Route Selection Criteria . . . . . . . . . . . . . . . . . . 72 9.4 Originating BGP routes . . . . . . . . . . . . . . . . . . . 72 10. BGP Timers . . . . . . . . . . . . . . . . . . . . . . . . . 72 Appendix A. Comparison with RFC1771 . . . . . . . . . . . . . . . 73 Appendix B. Comparison with RFC1267 . . . . . . . . . . . . . . . 74 Appendix C. Comparison with RFC 1163 . . . . . . . . . . . . . . 75 Appendix D. Comparison with RFC 1105 . . . . . . . . . . . . . . 75 Appendix E. TCP options that may be used with BGP . . . . . . . . 76 Appendix F. Implementation Recommendations . . . . . . . . . . . 76 Appendix F.1 Multiple Networks Per Message . . . . . . . . . . . 76 Appendix F.2 Reducing route flapping . . . . . . . . . . . . . . 77 Appendix F.3 Path attribute ordering . . . . . . . . . . . . . . 77 Appendix F.4 AS_SET sorting . . . . . . . . . . . . . . . . . . . 77 Appendix F.5 Control over version negotiation . . . . . . . . . . 78 Appendix F.6 Complex AS_PATH aggregation . . . . . . . . . . . . 78 Security Considerations . . . . . . . . . . . . . . . . . . . . . 79 References . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 Authors Information . . . . . . . . . . . . . . . . . . . . . . . 80 Abstract The Border Gateway Protocol (BGP) is an inter-Autonomous System rout- ing protocol. The primary function ofthe documenta BGP speaking system is to exchange network reachability information with other BGP systems. This network reacha- bility information includes information on theproductlist ofthe IETF IDR Working Group with Yakov Rekhter and Tony Li as editors. Certain sectionsAutonomous Systems (ASs) that reachability information traverses. This informa- tion is sufficient to construct a graph ofthe document borrowed heavilyAS connectivity fromIDRP [7],whichis the OSI counterpart of BGP. For this credit shouldrouting loops may begiven to the ANSI X3S3.3 group chaired by Lyman Chapinpruned andto Charles Kunzinger who was the IDRP editor within that group. We would also like to thank Enke Chen, Edward Crabbe, Mike Craren, Vincent Gillet, Eric Gray, Jeffrey Haas, Dimitry Haskin, John Krawczyk, David LeRoy, Dan Massey, Dan Pei, Mathew Richardson, John Scudder, John Stewart III, Dave Thaler, Paul Traina, Russ White, Curtis Villamizar, and Alex Zinin for their comments. Many thanks to Sue Hares for her contributions to the document, and especially for her work on the BGP Finite State Machine. We would like to specially acknowledge numerous contributions by Dennis Ferguson. 2. Introduction The Border Gateway Protocol (BGP) is an inter-Autonomous System routing protocol. It is built on experience gained with EGP as defined in RFC 904 [1] and EGP usage in the NSFNET Backbone as described in RFC 1092 [2] and RFC 1093 [3]. The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems. This network reachability information includes information on the list of Autonomous Systems (ASs) that reachability information traverses. This information is sufficient to construct a graph of AS connectivity from which routing loops may be pruned and some policy decisions atsome policy decisions at the AS level may be enforced. BGP-4 provides anewset of mechanisms for supporting ClasslessInter-DomainInter- Domain Routing (CIDR)[8, 9].[RFC1518, RFC1519]. These mechanisms include support for advertising a set of destinations as an IP prefix andeliminateseliminating the concept of network "class" within BGP. BGP-4 also introduces mechanisms which allow aggregation of routes, including aggregation of AS paths.To characterizeRouting information exchanged via BGP supports only the destination- based forwarding paradigm, which assumes that a router forwards a packet based solely on the destination address carried in the IP header of the packet. This, in turn, reflects the set of policydecisionsdeci- sions that can (and can not) be enforced usingBGP, one must focus onBGP. BGP can support only the policies conforming to theruledestination-based forwarding paradigm. 1. Definition of commonly used terms This section provides definition for terms that have aBGP speaker advertisesspecific mean- ing toits peers (otherthe BGPspeakers which it communicates with) in neighboring ASs only those routesprotocol and thatit itself uses. This rule reflects the "hop-by-hop" routing paradigm generallyare used throughout thecurrent Internet. Note that some policies cannot be supported bytext. Autonomous System (AS) The classic definition of an Autonomous System is a set of routers under a single technical administration, using an interior gateway protocol (IGP) and common metrics to determine how to route pack- ets within the"hop-by-hop" routing paradigmAS, andthus require techniques such as sourceusing an inter-AS routing(aka explicit routing)protocol toenforce. For example, BGP does not enable one ASdetermine how tosend trafficroute packets to other ASs. Since this classic definition was developed, it has become common for aneighboringsingle ASintending thatto use several IGPs and sometimes several sets of metrics within an AS. The use of thetraffic take a different route from that taken by traffic originating interm Autonomous System here stresses theneighboring AS. Onfact that, even when multiple IGPs and metrics are used, the adminis- tration of an AS appears to otherhand, BGP can support any policy conformingASs tothe "hop-by-hop" routing paradigm. Since the current Internet uses only the "hop-by-hop" inter-AShave a single coherent interior routingparadigmplan andsincepresents a consistent picture of what destinations are reachable through it. BGPcan support any policy that conforms tospeaker A router thatparadigm,implements BGP. BGPis highly applicable as an inter-AS routing protocol for the current Internet.Identifier Amore complete discussion of what policies can and cannot be enforced with BGP is outside4-octet unsigned integer indicating thescopeBGP Identifier ofthis document (but refer tothecompanion document discussingsender of BGPusage [5]).messages. A given BGPruns over a reliable transport protocol. This eliminatesspeaker sets theneedvalue of its BGP Identifier toimplement explicit update fragmentation, retransmission, acknowledgment, and sequencing. Any authentication scheme used by the transport protocol (e.g., RFC2385 [10]) may be used in additionan IP address assigned toBGP's own authentication mechanisms. The error notification mechanism used in BGP assumes that the transport protocol supports a "graceful" close, i.e.,thatall outstanding data will be delivered beforeBGP speaker. The value of theconnection is closed.BGPuses TCP [4] as its transport protocol. TCP meets BGP's transport requirements andIdentifier ispresent in virtually all commercial routersdetermined on startup andhosts. In the following descriptionsis thephrase "transport protocol connection" can be understood to refer to a TCP connection. BGP uses TCP port 179same forestablishing its connections. This document usesevery local interface and every BGP peer. Internal peer Peer that is in theterm `Autonomous System' (AS) throughout. The classic definition of ansame Autonomous System as the local system. IBGP Internal BGP (BGP connection between internal peers). External peer Peer that is in asetdifferent Autonomous System than the local sys- tem. EBGP External BGP (BGP connection between external peers). NLRI Network Layer Reachability Information. Route A unit ofrouters underinformation that pairs asingle technical administration, using an interior gateway protocol and common metrics to determine how to route packets withinset of destinations with theAS, and using an exterior gateway protocol to determine how to route packets to other ASs. Since this classic definition was developed, it has become common forattributes of asingle ASpath touse several interior gateway protocols and sometimes several sets of metrics within an AS.those destinations. Theuseset ofthe term Autonomous System here stresses the fact that, even when multiple IGPs and metricsdestina- tions areused, the administration of an AS appears to other ASs to have a single coherent interior routing plan and presents a consistent picture of what destinationssystems whose IP addresses arereachable through it. The planned use of BGPcontained inthe Internet environment, including such issues as topology, the interaction between BGP and IGPs, and the enforcement of routing policy rules is presentedone IP address prefix carried ina companion document [5]. This document isthefirst of a series of documents planned to explore various aspects of BGP application. 3. SummaryNetwork Layer Reachability Informa- tion (NLRI) field ofOperation Two systems form a transport protocol connection between one another. They exchange messages to open and confirm the connection parameters.an UPDATE message. Theinitial data flowpath is theportioninforma- tion reported in the path attributes field of theBGPsame UPDATE mes- sage. RIB Routing Information Base. Adj-RIB-In The Adj-RIBs-In contain unprocessed routingtableinformation thatis allowed by the export policy, called the Adj-Ribs-Out (see 3.2). Incremental updates are sent as the routing tables change. BGP does not require periodic refresh ofhas been advertised to therouting table. Therefore, alocal BGP speakermust retain the current version of the routes advertisedbyall ofitspeers for the duration of the connection. If the implementation decides to not storepeers. Loc-RIB The Loc-RIB contains the routes that have beenreceived from a peer, but have been filtered out according to configured local policy,selected by the local BGPRoute Refresh extension [12] may be used to requestspeaker's Decision Process. Adj-RIB-Out The Adj-RIBs-Out contains thefull set ofroutesfrom a peer without resetting the BGP session when the local policy configuration changes. KEEPALIVE messages may be sent periodicallyfor advertisement toensure the livenessspecific peers by means of theconnection. NOTIFICATION messages are sent in response to errors or special conditions. If a connection encounters an error condition, a NOTIFICATION message is sent and the connection is closed. The hosts executing the Borderlocal speaker's UPDATE messages. IGP Interior Gateway Protocolneed not be routers. A non-routing host could exchange routing information with routers via EGP or even an interior- a routingprotocol. That non-routing host could then use BGPprotocol used to exchange routing informationwithamong routers within aborder router in anothersingle AutonomousSystem. The implications and applications of this architecture areSys- tem. Feasible route A route that is available forfurther study. Connections between BGP speakers of different ASs are referred to as "external" links. BGP connections between BGP speakers within the same AS are referred to as "internal" links. Similarly, a peer in a different ASuse. Unfeasible route A previously advertised feasible route that isreferred tono longer available for use. 2. Acknowledgments This document was originally published asan external peer, while a peerRFC 1267 inthe same AS may be described as an internal peer. Internal BGP and external BGP are commonly abbreviated IBGPOctober 1991, jointly authored by Kirk Lougheed andEBGP. If a particular AS has multiple BGP speakersYakov Rekhter. We would like to express our thanks to Guy Almes, Len Bosack, andis providing transit serviceJeffrey C. Honig forother ASs, then care must be takentheir contributions toensure a consistent view of routing withintheAS. A consistent viewearlier version (BGP-1) ofthe interior routes of the AS is providedthis document. We would like to specially acknowledge numerous contributions by Den- nis Ferguson to theinterior routing protocol. A consistent viewearlier version ofthe routes exteriorthis document. We like to explicitly thank Bob Braden for theAS can be provided by having all BGP speakers within the AS maintain direct IBGP connections with each other. Alternately the interior routing protocol can pass BGP information among routers within an AS, taking care not to lose BGP attributes that will be needed by EBGP speakers if transit connectivity is being provided. Forreview of thepurposeearlier version (BGP-2) ofdiscussion, it is assumed that BGP information is passed within an AS using IBGP. Care must be takenthis document as well as his constructive and valuable comments. We would also like toensure thatthank Bob Hinden, Director for Routing of theinterior routers have all been updated with transit information beforeInternet Engineering Steering Group, and theEBGP speakers announceteam of reviewers he assembled toother ASs that transit service is being provided. 3.1 Routes: Advertisement and Storage Forreview thepurposeearlier version (BGP-2) of thisprotocol, a route is defined as a unit of information that pairs a setdocument. This team, consisting ofdestinationsDeborah Estrin, Milo Medin, John Moy, Radia Perlman, Martha Steenstrup, Mike St. Johns, and Paul Tsuchiya, acted withthe attributes ofapath to those destinations. The setstrong combination ofdestinations are the systems whose IP addresses are reported in the Network Layer Reachability Information (NLRI) fieldtoughness, professionalism, and cour- tesy. Certain sections of thepathdocument borrowed heavily from IDRP [IS10747], which is theinformation reported in the path attributes fieldOSI counterpart of BGP. For this credit should be given to thesame UPDATE message. Routes are advertised between BGP speakers in UPDATE messages. Routes are stored in the Routing Information Bases (RIBs): namely, the Adj-RIBs-In, the Loc-RIB,ANSI X3S3.3 group chaired by Lyman Chapin and to Charles Kunzinger who was theAdj-RIBs-Out. RoutesIDRP editor within thatwill be advertisedgroup. We would also like toother BGP speakers must be presentthank Benjamin Abarbanel, Enke Chen, Edward Crabbe, Mike Craren, Vincent Gillet, Eric Gray, Jeffrey Haas, Dimitry Haskin, John Krawczyk, David LeRoy, Dan Massey, Jonathan Natale, Dan Pei, Mathew Richardson, John Scudder, John Stewart III, Dave Thaler, Paul Traina, Russ White, Curtis Villamizar, and Alex Zinin for their comments. We would like to specially acknowledge Andrew Lange for his help in preparing theAdj-RIB- Out. Routes that will be used by the local BGP speaker must be present infinal version of this document. Finally, we would like to thank all theLoc-RIB, andmembers of thenext hopIDR Working Group foreachtheir ideas and support they have given to this document. 3. Summary ofthese routes must be resolvable via the local BGP speaker's Routing Table. Routes that are received from other BGP speakers are presentOperation The Border Gateway Protocol (BGP) is an inter-Autonomous System rout- ing protocol. It is built on experience gained with EGP as defined in [RFC904] and EGP usage in theAdj- RIBs-In. IfNSFNET Backbone as described in [RFC1092] and [RFC1093]. The primary function of a BGPspeaker chooses to advertise the route, it may addspeaking system is toor modifyexchange network reachability information with other BGP systems. This network reacha- bility information includes information on thepath attributeslist ofthe route before advertising itAutonomous Systems (ASs) that reachability information traverses. This informa- tion is sufficient to construct apeer. BGP provides mechanisms bygraph of AS connectivity from which routing loops may be pruned and some policy decisions at the AS level may be enforced. In the context of this document we assume that a BGP speakercan informadver- tises to itspeerpeers only those routes that it itself uses (in this context apreviously advertised route is no longer available for use. There are three methods by which a givenBGP speakercan indicate thatis said to "use" a BGP routehas been withdrawn from service: a) the IP prefix that expressesif it is thedestination for a previously advertisedmost preferred BGP routecan be advertisedand is used in forwarding). All other cases are outside theWITHDRAWN ROUTES fieldscope of this document. Routing information exchanged via BGP supports only the destination- based forwarding paradigm, which assumes that a router forwards a packet based solely on the destination address carried in theUPDATE message, thus markingIP header of theassociated route as being no longer available for use b) a replacement route withpacket. This, in turn, reflects thesame NLRIset of policy deci- sions that can (and can not) beadvertised, or c) the BGP speaker - BGP speaker connectionenforced using BGP. Note that some policies can not beclosed, which implicitly removes from service all routes whichsupported by thepair of speakers had advertiseddestination-based forwarding paradigm, and thus require techniques such as source routing (aka explicit routing) toeach other. 3.2 Routing Information Bases The Routing Information Base (RIB) within abe enforced. Such policies can not be enforced using BGPspeaker consists of three distinct parts: a) Adj-RIBs-In: The Adj-RIBs-In store routing informationeither. For example, BGP does not enable one AS to send traffic to a neighboring AS for forwarding to some destination (reachable through but) beyond thathas been learned from inbound UPDATE messages. Their contents represent routesneighboring AS intending thatare available as an input to the Decision Process. b) Loc-RIB: The Loc-RIB containsthelocal routing informationtraffic take a different route to thatthe BGP speaker has selectedtaken byapplying its local policies totherouting information containedtraffic originat- ing inits Adj-RIBs-In. c) Adj-RIBs-Out: The Adj-RIBs-Out storetheinformationneighboring AS (for that same destination). On thelocalother hand, BGPspeaker has selected for advertisementcan support any policy conforming toits peers. The routing information stored intheAdj-RIBs-Out willdestination-based forwarding paradigm. A more complete discussion of what policies can and can not becarried in the localenforced with BGPspeaker's UPDATE messages and advertised to its peers. In summary,is outside theAdj-RIBs-In contain unprocessed routing information that has been advertisedscope of this document (but refer to thelocal BGP speaker by its peers; the Loc-RIB contains the routes that have been selected by the localcompanion document discussing BGPspeaker's Decision Process; and the Adj-RIBs-Out organize the routesusage [RFC1772]). BGP-4 provides a new set of mechanisms foradvertisement to specific peers by meanssupporting Classless Inter-Domain Routing (CIDR) [RFC1518, RFC1519]. These mechanisms include support for advertising a set ofthe local speaker's UPDATE messages. Although the conceptual model distinguishes between Adj-RIBs-In, Loc- RIB, and Adj-RIBs-Out, this neither implies nor requires thatdestinations as animplementation must maintain three separate copies ofIP prefix and eliminating therouting information. The choiceconcept ofimplementation (for example, 3 copiesnetwork "class" within BGP. BGP-4 also introduces mechanisms which allow aggregation of routes, includ- ing aggregation of AS paths. This document uses theinformation vs 1 copy with pointers)term `Autonomous System' (AS) throughout. The classic definition of an Autonomous System isnot constrained by the protocol. Routing information thata set of routers under a single technical administration, using an interior gateway protocol (IGP) and common metrics to determine how to route packets within therouter usesAS, and using an inter-AS routing protocol toforwarddetermine how to route packets(ortoconstruct the forwarding table that is usedother ASs. Since this classic definition was developed, it has become common forpacket forwarding) is maintained in the Routing Table. The Routing Table accumulates routesa single AS todirectly connected networks, static routes, routes learned fromuse several IGPs and sometimes several sets of metrics within an AS. The use of theIGP protocols,term Autonomous System here stresses the fact that, even when multiple IGPs androutes learned from BGP. Whether or notmet- rics are used, the administration of an AS appears to other ASs to have aspecificsingle coherent interior routing plan and presents a consis- tent picture of what destinations are reachable through it. The planned use of BGProute should be installedin theRouting Table, and whether aInternet environment, including such issues as topology, the interaction between BGProute should override a route toand IGPs, and thesame destination installed by another source is a localenforcement of routing policydecision, not specifiedrules is presented inthis document. Besides actual packet forwarding, the Routing Tablea companion docu- ment [RFC1772]. This document isused for resolution ofthenext-hop addresses specified infirst of a series of documents planned to explore various aspects of BGPupdates (see Section 9.1.2). 4. Message Formatsapplication. BGP uses TCP [RFC793] as its transport protocol. Thissection describes message formatseliminates the need to implement explicit update fragmentation, retransmission, acknowledgment, and sequencing. BGP listens on TCP port 179. Any authentication scheme used byBGP. Messages are sent over a reliable transport protocol connection. A message is processed only after it is entirely received. The maximum message size is 4096 octets. All implementations are required to support this maximum message size. The smallest message thatTCP (e.g., RFC2385 [RFC2385]) may besent consists of aused. The error notification mechanism used in BGPheader withoutassumes that TCP supports a "graceful" close, i.e., that all outstanding dataportion, or 19 octets. 4.1 Message Header Format Each message has a fixed-size header. There may or may notwill be delivered before the connection is closed. Two systems form a TCP connection between one another. They exchange messages to open and confirm the connection parameters. The initial data flow is the portionfollowingof theheader, depending onBGP routing table that is allowed by themessage type. The layoutexport policy, called the Adj-Ribs-Out (see 3.2). Incremental updates are sent as the routing tables change. BGP does not require periodic refresh ofthese fields is shown below: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | + + | | + + | Marker | + + | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Length | Type | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Marker: This 16-octet field containsthe routing table. To allow local policy changes to have the correct effect without resetting any BGP connections, avalue thatBGP speaker SHOULD either (a) retain thereceivercurrent ver- sion of themessage can predict. Ifroutes advertised to it by all of its peers for theTypedura- tion of themessage is OPEN,connection, orif the OPEN message carries no Authentication Information (as an Optional Parameter), then(b) make use of theMarker mustRoute Refresh extension [RFC2918]. KEEPALIVE messages may beall ones. Otherwise,sent periodically to ensure thevalueliveness of themarker can be predicted by someconnection. NOTIFICATION messages are sent in response to errors or special conditions. If acomputation specified as part of the authentication mechanism (whichconnection encounters an error condition, a NOTIFICATION message isspecified as part ofsent and theAuthentication Information) used.connection is closed. TheMarker canhosts executing BGP need not beusedrouters. A non-routing host could exchange routing information with routers via EGP [RFC904] or even an interior routing protocol. That non-routing host could then use BGP todetect loss of synchronization betweenexchange routing information with apair of BGP peers,border router in another Autonomous System. The implications andto authenticate incoming BGP messages. Length: This 2-octet unsigned integer indicates the total lengthapplications ofthe message, including the header,this architecture are for further study. A peer inoctets. Thus, e.g., it allows onea different AS is referred tolocateas an external peer, while a peer in thetransport-level stream the (Marker field of the) next message. The value of the Length field must alwayssame AS may beat least 19described as an internal peer. Internal BGP andno greater than 4096,external BGP are commonly abbreviated IBGP and EBGP. If a particular AS has multiple BGP speakers andmay be further constrained, depending on the message type. No "padding" of extra data after the messageisallowed, so the Length fieldproviding transit service for other ASs, then care musthave the smallest value required given the restbe taken to ensure a consistent view of routing within themessage. Type: This 1-octet unsigned integer indicatesAS. A consistent view of thetype codeinterior routes of themessage. The following type codes are defined: 1 - OPEN 2 - UPDATE 3 - NOTIFICATION 4 - KEEPALIVE 4.2 OPEN Message Format After a transport protocol connectionAS isestablished, the first message sentprovided byeach side is an OPEN message. IftheOPEN messageIGP used within the AS. For the purpose of this document, it isacceptable,assumed that aKEEPALIVE message confirmingconsistent view of theOPEN is sent back. Onceroutes exterior to theOPENAS isconfirmed, UPDATE, KEEPALIVE, and NOTIFICATION messages mayprovided by having all BGP speakers within the AS maintain IBGP with each other. Care must beexchanged. In additiontaken to ensure that thefixed-size BGP header,interior routers have all been updated with transit information before theOPEN message containsBGP speakers announce to other ASs that tran- sit service is being provided. 3.1 Routes: Advertisement and Storage For thefollowing fields: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+ | Version | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | My Autonomous System | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Hold Time | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | BGP Identifier | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Opt Parm Len | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | Optional Parameters (variable) | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Version: This 1-octet unsigned integer indicates the protocol version numberpurpose ofthe message. The current BGP version numberthis protocol, a route is4. My Autonomous System: This 2-octet unsigned integer indicates the Autonomous System number of the sender. Hold Time: This 2-octet unsigned integer indicates the numberdefined as a unit ofsecondsinformation thatthe sender proposes for the valuepairs a set of destinations with theHold Timer. Upon receiptattributes ofan OPEN message,aBGP speaker MUST calculate the valuepath to those destinations. The set of destinations are systems whose IP addresses are contained in one IP address prefix carried in theHold Timer by using the smallerNetwork Layer Reachability Information (NLRI) field ofits configured Hold Timean UPDATE mes- sage, and theHold Time received inpath is theOPEN message. The Hold Time MUST be either zero or at least three seconds. An implementation may reject connections oninformation reported in thebasispath attributes field of theHold Time. The calculated value indicates the maximum number of seconds that may elapsesame UPDATE message. Routes are advertised betweenthe receipt of successive KEEPALIVE, and/orBGP speakers in UPDATEmessages bymessages. Mul- tiple routes that have thesender. BGP Identifier: This 4-octet unsigned integer indicatessame path attributes can be advertised in a single UPDATE message by including multiple prefixes in theBGP IdentifierNLRI field of thesender. A given BGP speaker setsUPDATE message. Routes are stored in thevalue of itsRouting Information Bases (RIBs): namely, the Adj-RIBs-In, the Loc-RIB, and the Adj-RIBs-Out, as described in Section 3.2. If a BGPIdentifierspeaker chooses toan IP address assignedadvertise the route, it may add tothat BGP speaker. The valueor modify the path attributes of the route before advertising it to a peer. BGPIdentifier is determined on startup andprovides mechanisms by which a BGP speaker can inform its peer that a previously advertised route isthe sameno longer available forevery local interface and everyuse. There are three methods by which a given BGPpeer. Optional Parameters Length: This 1-octet unsigned integer indicatesspeaker can indicate that a route has been withdrawn from service: a) thetotal length ofIP prefix that expresses theOptional Parameters fielddestination for a previously advertised route can be advertised inoctets. Ifthevalue of thisWITHDRAWN ROUTES fieldis zero,in the UPDATE message, thus marking the associated route as being noOptional Parameters are present. Optional Parameters: This field may containlonger available for use b) alistreplacement route with the same NLRI can be advertised, or c) the BGP speaker - BGP speaker connection can be closed, which implicitly removes from service all routes which the pair ofoptional parameters, wherespeakers had advertised to eachparameterother. Changing attribute of a route isencoded asaccomplished by advertising a<Parameter Type, Parameter Length, Parameter Value> triplet. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-... | Parm. Type | Parm. Length | Parameter Value (variable) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-... Parameter Type isreplacement route. The replacement route carries new (changed) attributes and has the same NLRI as the original route. 3.2 Routing Information Bases The Routing Information Base (RIB) within aone octet fieldBGP speaker consists of three distinct parts: a) Adj-RIBs-In: The Adj-RIBs-In store routing information thatunambiguously identifies individual parameters. Parameter Length is a one octet fieldhas been learned from inbound UPDATE messages received from other BGP speakers. Their contents represent routes thatcontainsare available as an input to thelength ofDecision Process. b) Loc-RIB: The Loc-RIB contains theParameter Value field in octets. Parameter Value is a variable length fieldlocal routing information thatis interpreted according tothevalue ofBGP speaker has selected by applying its local policies to theParameter Type field. This document definesrouting information contained in its Adj-RIBs-In. These are thefollowing Optional Parameters: a) Authentication Information (Parameter Type 1): This optional parameter mayroutes that will be usedto authenticate a BGP peer. The Parameter Value field contains a 1-octet Authentication Code followedbya variable length Authentication Data. 0 1 2 3 4 5 6 7 8 +-+-+-+-+-+-+-+-+ | Auth. Code | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | Authentication Data | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Authentication Code: This 1-octet unsigned integer indicatestheauthentication mechanism being used. Whenever an authentication mechanism is specifiedlocal BGP speaker. The next hop foruse within BGP, three thingseach of these routes must beincluded inresolvable via thespecification: -local BGP speaker's Routing Table. c) Adj-RIBs-Out: The Adj-RIBs-Out store thevalue ofinformation that theAuthentication Code which indicates use oflocal BGP speaker has selected for advertisement to its peers. The routing information stored in themechanism, -Adj-RIBs-Out will be carried in theformlocal BGP speaker's UPDATE messages andmeaning ofadvertised to its peers. In summary, theAuthentication Data,Adj-RIBs-In contain unprocessed routing information that has been advertised to the local BGP speaker by its peers; the Loc-RIB contains the routes that have been selected by the local BGP speaker's Decision Process; and-thealgorithmAdj-RIBs-Out organize the routes forcomputing valuesadvertisement to specific peers by means ofMarker fields. Note that a separate authentication mechanism may be used in establishingthetransport level connection. Authentication Data: Authentication Data is a variable length field that is interpreted according tolocal speaker's UPDATE messages. Although thevalueconceptual model distinguishes between Adj-RIBs-In, Loc- RIB, and Adj-RIBs-Out, this neither implies nor requires that an implementation must maintain three separate copies of theAuthentication Code field.routing information. Theminimum lengthchoice of implementation (for example, 3 copies of theOPEN message is 29 octets (including message header). 4.3 UPDATE Message Format UPDATE messages are used to transfer routinginformationbetween BGP peers. Thevs 1 copy with pointers) is not constrained by the protocol. Routing informationinthat theUPDATE packet can be usedrouter uses to forward packets (or to constructa graph describingtherelationships offorwarding table that is used for packet forwarding) is maintained in thevarious Autonomous Systems. By applying rulesRouting Table. The Routing Table accumulates routes tobe discussed, routing information loops and some other anomalies may be detected and removed from inter-AS routing. An UPDATE message is used to advertise feasible routes sharing common path attribute to a peer, or to withdraw multiple unfeasibledirectly connected networks, static routes, routes learned fromservice (see 3.1). An UPDATE message may simultaneously advertise a feasible routethe IGP protocols, andwithdraw multiple unfeasibleroutes learned fromservice. The UPDATE message always includes the fixed-size BGP header, and also includes the other fields as shown below (note, some of the shown fields mayBGP. Whether or not a specific BGP route should bepresent in every UPDATE message): +-----------------------------------------------------+ | Withdrawn Routes Length (2 octets) | +-----------------------------------------------------+ | Withdrawn Routes (variable) | +-----------------------------------------------------+ | Total Path Attribute Length (2 octets) | +-----------------------------------------------------+ | Path Attributes (variable) | +-----------------------------------------------------+ | Network Layer Reachability Information (variable) | +-----------------------------------------------------+ Withdrawn Routes Length: This 2-octets unsigned integer indicates the total length of the Withdrawn Routes fieldinstalled inoctets. Its value must allowthelength of the Network Layer Reachability Information field to be determined as specified below. A value of 0 indicates that no routes are being withdrawn from service,Routing Table, andthatwhether a BGP route should override a route to theWITHDRAWN ROUTES fieldsame destination installed by another source is a local policy decision, notpresentspecified in thisUPDATE message. Withdrawn Routes: This is a variable length field that contains a list of IP address prefixes fordocument. Besides actual packet forwarding, theroutes that are being withdrawn from service. Each IP address prefixRouting Table isencoded as a 2-tupleused for resolution of theform <length, prefix>, whose fieldsnext-hop addresses specified in BGP updates (see Section 5.1.3). 4. Message Formats This section describes message formats used by BGP. BGP messages aredescribed below: +---------------------------+ | Length (1 octet) | +---------------------------+ | Prefix (variable) | +---------------------------+sent over a TCP connection. A message is processed only after it is entirely received. Theuse andmaximum message size is 4096 octets. All implementations are required to support this maximum mes- sage size. The smallest message that may be sent consists of a BGP header without a data portion, or 19 octets. 4.1 Message Header Format Each message has a fixed-size header. There may or may not be a data portion following themeaningheader, depending on the message type. The lay- out of these fieldsare as follows: a) Length: Theis shown below: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | + + | | + + | Marker | + + | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Length | Type | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Marker: This 16-octet field is included for compatibility; it MUST be set to all ones. Length: This 2-octet unsigned integer indicates the total lengthin bitsof theIP address prefix. A length of zero indicates a prefix that matches all IP addresses (with prefix, itself,message, including the header, in octets. Thus, e.g., it allows one to locate in the TCP stream the (Marker field ofzero octets). b) Prefix:the) next message. ThePrefixvalue of the Length fieldcontains an IP address prefix followed by enough trailing bits to makemust always be at least 19 and no greater than 4096, and may be further constrained, depending on theendmessage type. No "padding" of extra data after the message is allowed, so the Length fieldfall on an octet boundary. Note thatmust have the smallest value required given the rest oftrailing bits is irrelevant. Total Path Attribute Length:the message. Type: This2-octet1-octet unsigned integer indicates thetotal lengthtype code of thePath Attributes field in octets. Its value must allowmessage. This document defines thelength offollowing type codes: 1 - OPEN 2 - UPDATE 3 - NOTIFICATION 4 - KEEPALIVE [RFC2918] defines one more type code. 4.2 OPEN Message Format After a TCP is established, theNetwork Layer Reachability field to be determined as specified below. A value of 0 indicates that no Network Layer Reachability Information fieldfirst message sent by each side ispresent in this UPDATEan OPEN message.Path Attributes: A variable length sequence of path attributes is present in every UPDATE. Each path attributeIf the OPEN message is acceptable, atriple <attribute type, attribute length, attribute value> of variable length. Attribute TypeKEEPALIVE message confirming the OPEN isa two-octet field that consists ofsent back. Once theAttribute Flags octet followed byOPEN is confirmed, UPDATE, KEEPALIVE, and NOTIFICATION messages may be exchanged. In addition to theAttribute Type Code octet.fixed-size BGP header, the OPEN message contains the following fields: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+ | Version | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |Attr. Flags |Attr. Type Code|My Autonomous System | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+The high-order bit (bit 0)| Hold Time | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | BGP Identifier | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Opt Parm Len | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | Optional Parameters (variable) | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Version: This 1-octet unsigned integer indicates the protocol version number of theAttribute Flags octetmessage. The current BGP version number is 4. My Autonomous System: This 2-octet unsigned integer indicates theOptional bit. It defines whether the attribute is optional (if set to 1) or well-known (if set to 0). The second high-order bit (bit 1)Autonomous System number of theAttribute Flags octet issender. Hold Time: This 2-octet unsigned integer indicates theTransitive bit. It defines whether an optional attribute is transitive (if set to 1) or non-transitive (if set to 0). For well-known attributes,number of seconds that theTransitive bit must be set to 1. (See Section 5sender proposes fora discussionthe value oftransitive attributes.) The third high-order bit (bit 2)the Hold Timer. Upon receipt of an OPEN message, a BGP speaker MUST calculate theAttribute Flags octet isvalue of thePartial bit. It defines whetherHold Timer by using theinformation containedsmaller of its configured Hold Time and the Hold Time received in theoptional transitive attribute is partial (if set to 1)OPEN message. The Hold Time MUST be either zero orcomplete (if set to 0). For well-known attributes and for optional non-transitive attributesat least three seconds. An implementation may reject connections on thePartial bit must be set to 0. The fourth high-order bit (bit 3)basis of theAttribute Flags octet is the Extended Length bit. It defines whether the Attribute Length is one octet (if set to 0) or two octets (if set to 1). The lower-order four bits of the Attribute Flags octet are unused. They must be zero when sent and must be ignored when received.Hold Time. TheAttribute Type Code octet contains the Attribute Type Code. Currently defined Attribute Type Codes are discussed in Section 5. Ifcalculated value indicates theExtended Length bitmaximum number of seconds that may elapse between theAttribute Flags octet is set to 0, the third octetreceipt of successive KEEPALIVE, and/or UPDATE messages by thePath Attribute containssender. BGP Identifier: This 4-octet unsigned integer indicates thelengthBGP Identifier of theattribute data in octets. Ifsender. A given BGP speaker sets theExtended Length bitvalue ofthe Attribute Flags octet is setits BGP Iden- tifier to1, thenan IP address assigned to that BGP speaker. The value of thethirdBGP Identifier is determined on startup and is thefourth octets of the path attribute containsame for every local interface and every BGP peer. Optional Parameters Length: This 1-octet unsigned integer indicates the total length of theattribute dataOptional Parameters field in octets.The remaining octets of the Path Attribute representIf theattributevalueand are interpreted according to the Attribute Flags and the Attribute Type Code. The supported Attribute Type Codes, their attribute values and uses are the following: a) ORIGIN (Type Code 1): ORIGINof this field is zero, no Optional Parameters are present. Optional Parameters: This field may contain awell-known mandatory attribute that defines the originlist ofthe path information. The data octet can assume the following values: Value Meaning 0 IGP - Network Layer Reachability Informationoptional parameters, where each parameter isinterior to the originating ASencoded as a <Parameter Type, Parameter Length, Parameter Value> triplet. 0 1 0 1EGP - Network Layer Reachability Information learned via the EGP protocol2INCOMPLETE - Network Layer Reachability Information learned by some other means Its usage is defined in 5.1.1 b) AS_PATH (Type Code 2): AS_PATH3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-... | Parm. Type | Parm. Length | Parameter Value (variable) +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-... Parameter Type is awell-known mandatory attributeone octet field that unambiguously identi- fies individual parameters. Parameter Length iscomposed ofasequenceone octet field that contains the length ofAS path segments. Each AS path segment is represented by a triple <path segment type, path segment length, path segment value>. The path segment typethe Parameter Value field in octets. Parameter Value is a1-octet longvariable length fieldwiththat is interpreted according to thefollowing values defined: Value Segmentvalue of the Parameter Type1 AS_SET: unordered setfield. [RFC2842] defines the Capabilities Optional Parameter. The minimum length ofASs a route intheUPDATEOPEN messagehas traversed 2 AS_SEQUENCE: ordered set of ASs a routeis 29 octets (including mes- sage header). 4.3 UPDATE Message Format UPDATE messages are used to transfer routing information between BGP peers. The information in the UPDATE messagehas traversed The path segment length iscan be used to construct a1-octet long field containinggraph describing thenumberrelationships ofASs inthepath segment value field. The path segment value field contains one or more AS numbers, each encoded as a 2-octets long field. Usage of this attribute is defined in 5.1.2. c) NEXT_HOP (Type Code 3): Thisvarious Autonomous Sys- tems. By applying rules to be discussed, routing information loops and some other anomalies may be detected and removed from inter-AS routing. An UPDATE message isa well-known mandatoryused to advertise feasible routes sharing common path attributethat definesto a peer, or to withdraw multiple unfeasible routes from service (see 3.1). An UPDATE message may simultaneously adver- tise a feasible route and withdraw multiple unfeasible routes from service. The UPDATE message always includes theIP addressfixed-size BGP header, and also includes the other fields as shown below (note, some of theborder router that shouldshown fields may not beused aspresent in every UPDATE message): +-----------------------------------------------------+ | Withdrawn Routes Length (2 octets) | +-----------------------------------------------------+ | Withdrawn Routes (variable) | +-----------------------------------------------------+ | Total Path Attribute Length (2 octets) | +-----------------------------------------------------+ | Path Attributes (variable) | +-----------------------------------------------------+ | Network Layer Reachability Information (variable) | +-----------------------------------------------------+ Withdrawn Routes Length: This 2-octets unsigned integer indicates thenext hop tototal length of thedestinations listedWithdrawn Routes field in octets. Its value must allow the length of the Network Layer Reachability Information field to be determined as specified below. A value of 0 indicates that no routes are being withdrawn from service, and that theUPDATE message. Usage of this attributeWITHDRAWN ROUTES field isdefinednot present in5.1.3. d) MULTI_EXIT_DISC (Type Code 4):this UPDATE message. Withdrawn Routes: This isan optional non-transitive attributea variable length field thatiscontains afour octet non-negative integer. The valuelist ofthis attribute may be used by a BGP speaker's decision process to discriminate among multiple entry points to a neighboring autonomous system. Its usage is defined in 5.1.4. e) LOCAL_PREF (Type Code 5): LOCAL_PREF is a well-known attributeIP address prefixes for the routes that are being withdrawn from service. Each IP address prefix is encoded as afour octet non-negative integer. A BGP speaker uses it to inform other internal peers2-tuple of theadvertising speaker's degree of preference for an advertised route. Usage of this attribute isform <length, prefix>, whose fields are describedin 5.1.5. f) ATOMIC_AGGREGATE (Type Code 6) ATOMIC_AGGREGATE is a well-known discretionary attributebelow: +---------------------------+ | Length (1 octet) | +---------------------------+ | Prefix (variable) | +---------------------------+ The use and the meaning of these fields are as follows: a) Length: The Length field indicates the length0. Usage of this attribute is describedin5.1.6. g) AGGREGATOR (Type Code 7) AGGREGATOR is an optional transitive attributebits of the IP address prefix. A length6.of zero indicates a prefix that matches all IP addresses (with prefix, itself, of zero octets). b) Prefix: TheattributePrefix field containsthe last AS number that formed the aggregate route (encoded as 2 octets),an IP address prefix followed by enough trailing bits to make theIP addressend of theBGP speakerfield fall on an octet boundary. Note thatformedtheaggregate route (encoded as 4 octets).value of trailing bits is irrelevant. Total Path Attribute Length: Thisshould be2-octet unsigned integer indicates thesame address astotal length of theone used forPath Attributes field in octets. Its value must allow theBGP Identifierlength of thespeaker. Usage of this attribute is described in 5.1.7.Network Layer ReachabilityInformation: This variable lengthfieldcontains a list of IP address prefixes. The length in octetsto be determined as specified below. A value ofthe0 indicates that no Network Layer Reachability Information field isnot encoded explicitly, but can be calculated as:present in this UPDATEmessage Length - 23 - Totalmessage. PathAttributes Length - Withdrawn Routes Length whereAttributes: A variable length sequence of path attributes is present in every UPDATE message, except for an UPDATE messageLengththat carries only the withdrawn routes. Each path attribute is a triple <attribute type, attribute length, attribute value> of variable length. Attribute Type is a two-octet field that consists of thevalue encoded inAttribute Flags octet followed by thefixed- size BGP header, Total PathAttributeLength and Withdrawn Routes Length areType Code octet. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Attr. Flags |Attr. Type Code| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ The high-order bit (bit 0) of thevalues encoded inAttribute Flags octet is thevariable part ofOptional bit. It defines whether theUPDATE message, and 23attribute isa combined lengthoptional (if set to 1) or well-known (if set to 0). The second high-order bit (bit 1) of thefixed- size BGP header, the Total PathAttributeLength field andFlags octet is theWithdrawn Routes Length field. Reachability informationTransitive bit. It defines whether an optional attribute isencoded as onetransitive (if set to 1) ormore 2-tuples ofnon-transitive (if set to 0). For well-known attributes, theform <length, prefix>, whose fields are described below: +---------------------------+ | Length (1 octet) | +---------------------------+ | Prefix (variable) | +---------------------------+ The use and the meaning of these fields are as follows: a) Length: The Length field indicates the length in bits of the IP address prefix. A length of zero indicatesTransitive bit must be set to 1. (See Section 5 for aprefix that matches all IP addresses (with prefix, itself,discussion ofzero octets). b) Prefix:transitive attributes.) ThePrefix field contains IP address prefixes followed by enough trailing bits to make the endthird high-order bit (bit 2) of thefield fall on anAttribute Flags octetboundary. Note thatis thevalue ofPartial bit. It defines whether thetrailing bits is irrelevant. The minimum length ofinformation con- tained in theUPDATE messageoptional transitive attribute is23 octets -- 19 octets for the fixed header + 2 octetspartial (if set to 1) or complete (if set to 0). For well-known attributes and for optional non-transitive attributes theWithdrawn Routes Length + 2 octets forPartial bit must be set to 0. The fourth high-order bit (bit 3) of theTotal PathAttributeLength (the value of Withdrawn Routes LengthFlags octet is0 andthevalue of Total PathExtended Length bit. It defines whether the Attribute Length is0). An UPDATE message can advertise at mostone octet (if setof path attributes, but multiple destinations, provided that the destinations share these attributes. All path attributes contained in a given UPDATE message applytoall destinations carried in the NLRI field0) or two octets (if set to 1). The lower-order four bits of theUPDATE message. An UPDATE message can list multiple routes toAttribute Flags octet are unused. They must bewithdrawn from service. Each such route is identified by its destination (expressed as an IP prefix), which unambiguously identifieszero when sent and must be ignored when received. The Attribute Type Code octet contains therouteAttribute Type Code. Currently defined Attribute Type Codes are discussed in Section 5. If thecontextExtended Length bit of theBGP speaker - BGP speaker connection to which it has been previously advertised. An UPDATE message might advertise only routesAttribute Flags octet is set tobe withdrawn from service, in which case it will not include path attributes or Network Layer Reachability Information. Conversely, it may advertise only a feasible route, in which case0, theWITHDRAWN ROUTES field need not be present. An UPDATE message should not includethird octet of thesame address prefix inPath Attribute contains theWITHDRAWN ROUTES and Network Layer Reachability Information fields, however a BGP speaker MUST be able to process UPDATE messages in this form. A BGP speaker should treat an UPDATE messagelength ofthis form as iftheWITHDRAWN ROUTES doesn't containattribute data in octets. If theaddress prefix. 4.4 KEEPALIVE Message Format BGP does not use any transport protocol-based keep-alive mechanism to determine if peers are reachable. Instead, KEEPALIVE messages are exchanged between peers often enough as not to causeExtended Length bit of theHold TimerAttribute Flags octet is set toexpire. A reasonable maximum time between KEEPALIVE messages would be one1, then the third and the fourth octets of theHold Time interval. KEEPALIVE messages MUST NOT be sent more frequently than one per second. An implementation MAY adjustpath attribute contain therate at which it sends KEEPALIVE messages as a functionlength of theHold Time interval. If the negotiated Hold Time interval is zero, then periodic KEEPALIVE messages MUST NOT be sent. KEEPALIVE message consistsattribute data in octets. The remaining octets ofonly message headerthe Path Attribute represent the attribute value andhas a length of 19 octets. 4.5 NOTIFICATION Message Format A NOTIFICATION message is sent when an error condition is detected.are interpreted according to the Attribute Flags and the Attribute Type Code. TheBGP connectionsupported Attribute Type Codes, their attribute values and uses are the following: a) ORIGIN (Type Code 1): ORIGIN isclosed immediately after sending it. In addition toa well-known mandatory attribute that defines thefixed-size BGP header,origin of theNOTIFICATION message containspath information. The data octet can assume the followingfields: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9values: Value Meaning 0 IGP - Network Layer Reachability Information is interior to the originating AS 1+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Error code | Error subcode | Data (variable) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Error Code: This 1-octet unsigned integer indicatesEGP - Network Layer Reachability Information learned via thetypeEGP protocol [RFC904] 2 INCOMPLETE - Network Layer Reachability Information learned by some other means Usage ofNOTIFICATION. The following Error Codes have been defined: Errorthis attribute is defined in 5.1.1. b) AS_PATH (Type CodeSymbolic Name Reference2): AS_PATH is a well-known mandatory attribute that is composed of a sequence of AS path segments. Each AS path segment is represented by a triple <path segment type, path segment length, path segment value>. The path segment type is a 1-octet long field with the fol- lowing values defined: Value Segment Type 1Message Header Error Section 6.1AS_SET: unordered set of ASs a route in the UPDATE message has traversed 2OPEN Message Error Section 6.2 3AS_SEQUENCE: ordered set of ASs a route in the UPDATEMessage Error Section 6.3 4 Hold Timer Expired Section 6.5 5 Finite State Machine Error Section 6.6 6 Cease Section 6.7 Error subcode: Thismessage has traversed The path segment length is a 1-octetunsigned integer provides more specific information aboutlong field containing thenaturenumber of ASs (not thereported error. Each Error Code may havenumber of octets) in the path segment value field. The path segment value field contains one or moreError Subcodes associated with it. If no appropriate Error Subcode is defined, thenAS num- bers, each encoded as azero (Unspecific) value2-octets long field. Usage of this attribute is defined in 5.1.2. c) NEXT_HOP (Type Code 3): This is a well-known mandatory attribute that defines the IP address of the border router that should be usedforas the next hop to the destinations listed in the Network Layer Reacha- bility Information field of theError Subcode field. Message Header Error subcodes: 1 - Connection Not Synchronized. 2 - Bad Message Length. 3 - Bad Message Type. OPEN Message Error subcodes: 1 - Unsupported Version Number. 2 - Bad Peer AS. 3 - Bad BGP Identifier. 4 - Unsupported Optional Parameter. 5 - Authentication Failure. 6 - Unacceptable Hold Time.UPDATEMessage Error subcodes: 1 - Malformed Attribute List.message. Usage of this attribute is defined in 5.1.3. d) MULTI_EXIT_DISC (Type Code 4): This is an optional non-transitive attribute that is a four octet non-negative integer. The value of this attribute may be used by a BGP speaker's decision process to discriminate among multiple entry points to a neighboring autonomous sys- tem. Usage of this attribute is defined in 5.1.4. e) LOCAL_PREF (Type Code 5): LOCAL_PREF is a well-known attribute that is a four octet non-negative integer. A BGP speaker uses it to inform other internal peers of the advertising speaker's degree of pref- erence for an advertised route. Usage of this attribute is defined in 5.1.5. f) ATOMIC_AGGREGATE (Type Code 6) ATOMIC_AGGREGATE is a well-known discretionary attribute of length 0. Usage of this attribute is defined in 5.1.6. g) AGGREGATOR (Type Code 7) AGGREGATOR is an optional transitive attribute of length 6. The attribute contains the last AS number that formed the aggregate route (encoded as 2- Unrecognized Well-known Attribute. 3 - Missing Well-known Attribute.octets), followed by the IP address of the BGP speaker that formed the aggregate route (encoded as 4 octets). This should be the same address as the one used for the BGP Identifier of the speaker. Usage of this attribute is defined in 5.1.7. Network Layer Reachability Information: This variable length field contains a list of IP address pre- fixes. The length in octets of the Network Layer Reachability Information is not encoded explicitly, but can be calculated as: UPDATE message Length - 23 - Total Path Attributes Length - Withdrawn Routes Length where UPDATE message Length is the value encoded in the fixed- size BGP header, Total Path Attribute Length and Withdrawn Routes Length are the values encoded in the variable part of the UPDATE message, and 23 is a combined length of the fixed- size BGP header, the Total Path Attribute Length field and the Withdrawn Routes Length field. Reachability information is encoded as one or more 2-tuples of the form <length, prefix>, whose fields are described below: +---------------------------+ | Length (1 octet) | +---------------------------+ | Prefix (variable) | +---------------------------+ The use and the meaning of these fields are as follows: a) Length: The Length field indicates the length in bits of the IP address prefix. A length of zero indicates a prefix that matches all IP addresses (with prefix, itself, of zero octets). b) Prefix: The Prefix field contains an IP address prefix followed by enough trailing bits to make the end of the field fall on an octet boundary. Note that the value of the trailing bits is irrelevant. The minimum length of the UPDATE message is 23 octets -- 19 octets for the fixed header + 2 octets for the Withdrawn Routes Length + 2 octets for the Total Path Attribute Length (the value of Withdrawn Routes Length is 0 and the value of Total Path Attribute Length is 0). An UPDATE message can advertise at most one set of path attributes, but multiple destinations, provided that the destinations share these attributes. All path attributes contained in a given UPDATE message apply to all destinations carried in the NLRI field of the UPDATE message. An UPDATE message can list multiple routes to be withdrawn from ser- vice. Each such route is identified by its destination (expressed as an IP prefix), which unambiguously identifies the route in the con- text of the BGP speaker - BGP speaker connection to which it has been previously advertised. An UPDATE message might advertise only routes to be withdrawn from service, in which case it will not include path attributes or Network Layer Reachability Information. Conversely, it may advertise only a feasible route, in which case the WITHDRAWN ROUTES field need not be present. An UPDATE message should not include the same address prefix in the WITHDRAWN ROUTES and Network Layer Reachability Information fields, however a BGP speaker MUST be able to process UPDATE messages in this form. A BGP speaker should treat an UPDATE message of this form as if the WITHDRAWN ROUTES doesn't contain the address prefix. 4.4 KEEPALIVE Message Format BGP does not use any TCP-based keep-alive mechanism to determine if peers are reachable. Instead, KEEPALIVE messages are exchanged between peers often enough as not to cause the Hold Timer to expire. A reasonable maximum time between KEEPALIVE messages would be one third of the Hold Time interval. KEEPALIVE messages MUST NOT be sent more frequently than one per second. An implementation MAY adjust the rate at which it sends KEEPALIVE messages as a function of the Hold Time interval. If the negotiated Hold Time interval is zero, then periodic KEEPALIVE messages MUST NOT be sent. KEEPALIVE message consists of only message header and has a length of 19 octets. 4.5 NOTIFICATION Message Format A NOTIFICATION message is sent when an error condition is detected. The BGP connection is closed immediately after sending it. In addition to the fixed-size BGP header, the NOTIFICATION message contains the following fields: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Error code | Error subcode | Data (variable) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Error Code: This 1-octet unsigned integer indicates the type of NOTIFICATION. The following Error Codes have been defined: Error Code Symbolic Name Reference 1 Message Header Error Section 6.1 2 OPEN Message Error Section 6.2 3 UPDATE Message Error Section 6.3 4 Hold Timer Expired Section 6.5 5 Finite State Machine Error Section 6.6 6 Cease Section 6.7 Error subcode: This 1-octet unsigned integer provides more specific informa- tion about the nature of the reported error. Each Error Code may have one or more Error Subcodes associated with it. If no appropriate Error Subcode is defined, then a zero (Unspecific) value is used for the Error Subcode field. Message Header Error subcodes: 1 - Connection Not Synchronized. 2 - Bad Message Length. 3 - Bad Message Type. OPEN Message Error subcodes: 1 - Unsupported Version Number. 2 - Bad Peer AS. 3 - Bad BGP Identifier. 4 - Unsupported Optional Parameter. 5 - Authentication Failure. 6 - Unacceptable Hold Time. UPDATE Message Error subcodes: 1 - Malformed Attribute List. 2 - Unrecognized Well-known Attribute. 3 - Missing Well-known Attribute. 4 - Attribute Flags Error. 5 - Attribute Length Error. 6 - Invalid ORIGIN Attribute 8 - Invalid NEXT_HOP Attribute. 9 - Optional Attribute Error. 10 - Invalid Network Field. 11 - Malformed AS_PATH. Data: This variable-length field is used to diagnose the reason for the NOTIFICATION. The contents of the Data field depend upon the Error Code and Error Subcode. See Section 6 below for more details. Note that the length of the Data field can be determined from the message Length field by the formula: Message Length = 21 + Data Length The minimum length of the NOTIFICATION message is 21 octets (includ- ing message header). 5. Path Attributes This section discusses the path attributes of the UPDATE message. Path attributes fall into four separate categories: 1. Well-known mandatory. 2. Well-known discretionary. 3. Optional transitive. 4. Optional non-transitive. Well-known attributes must be recognized by all BGP implementations. Some of these attributes are mandatory and must be included in every UPDATE message that contains NLRI. Others are discretionary and may or may not be sent in a particular UPDATE message. All well-known attributes must be passed along (after proper updat- ing, if necessary) to other BGP peers. In addition to well-known attributes, each path may contain one or more optional attributes. It is not required or expected that all BGP implementations support all optional attributes. The handling of an unrecognized optional attribute is determined by the setting of the Transitive bit in the attribute flags octet. Paths with unrecognized transitive optional attributes should be accepted. If a path with unrecognized transitive optional attribute is accepted and passed along to other BGP peers, then the unrecognized transitive optional attribute of that path must be passed along with the path to other BGP peers with the Partial bit in the Attribute Flags octet set to 1. If a path with recognized transitive optional attribute is accepted and passed along to other BGP peers and the Partial bit in the Attribute Flags octet is set to 1 by some previous AS, it is not set back to 0 by the current AS. Unrecognized non-transitive optional attributes must be quietly ignored and not passed along to other BGP peers. New transitive optional attributes may be attached to the path by the originator or by any other BGP speaker in the path. If they are not attached by the originator, the Partial bit in the Attribute Flags octet is set to 1. The rules for attaching new non-transitive optional attributes will depend on the nature of the specific attribute. The documentation of each new non-transitive optional attribute will be expected to include such rules. (The description of the MULTI_EXIT_DISC attribute gives an example.) All optional attributes (both transitive and non-transitive) may be updated (if appropriate) by BGP speakers in the path. The sender of an UPDATE message should order path attributes within the UPDATE message in ascending order of attribute type. The receiver of an UPDATE message must be prepared to handle path attributes within the UPDATE message that are out of order. The same attribute can not appear more than once within the Path Attributes field of a particular UPDATE message. The mandatory category refers to an attribute which must be present in both IBGP and EBGP exchanges if NLRI are contained in the UPDATE message. Attributes classified as optional for the purpose of the protocol extension mechanism may be purely discretionary, or discre- tionary, required, or disallowed in certain contexts. attribute EBGP IBGP ORIGIN mandatory mandatory AS_PATH mandatory mandatory NEXT_HOP mandatory mandatory MULTI_EXIT_DISC discretionary discretionary LOCAL_PREF see section 5.1.5 required ATOMIC_AGGREGATE see section 5.1.6 and 9.1.4 AGGREGATOR discretionary discretionary 5.1 Path Attribute Usage The usage of each BGP path attributes is described in the following clauses. 5.1.1 ORIGIN ORIGIN is a well-known mandatory attribute. The ORIGIN attribute shall be generated by the speaker that originates the associated routing information. Its value SHOULD NOT be changed by any other speaker. 5.1.2 AS_PATH AS_PATH is a well-known mandatory attribute. This attribute identi- fies the autonomous systems through which routing information carried in this UPDATE message has passed. The components of this list can be AS_SETs or AS_SEQUENCEs. When a BGP speaker propagates a route which it has learned from another BGP speaker's UPDATE message, it shall modify the route's AS_PATH attribute based on the location of the BGP speaker to which the route will be sent: a) When a given BGP speaker advertises the route to an internal peer, the advertising speaker shall not modify the AS_PATH attribute associated with the route. b) When a given BGP speaker advertises the route to an external peer, then the advertising speaker shall update the AS_PATH attribute as follows: 1) if the first path segment of the AS_PATH is of type AS_SEQUENCE, the local system shall prepend its own AS number as the last element of the sequence (put it in the leftmost position). If the act of prepending will cause an overflow in the AS_PATH segment, i.e. more than 255 ASs, it shall be legal to prepend a new segment of type AS_SEQUENCE and prepend its own AS number to this new segment. 2) if the first path segment of the AS_PATH is of type AS_SET, the local system shall prepend a new path segment of type AS_SEQUENCE to the AS_PATH, including its own AS number in that segment. When a BGP speaker originates a route then: a) the originating speaker shall include its own AS number in a path segment of type AS_SEQUENCE in the AS_PATH attribute of all UPDATE messages sent to an external peer. (In this case, the AS number of the originating speaker's autonomous system will be the only entry the path segment, and this path segment will be the only segment in the AS_PATH attribute). b) the originating speaker shall include an empty AS_PATH attribute in all UPDATE messages sent to internal peers. (An empty AS_PATH attribute is one whose length field contains the value zero). Whenever the modification of the AS_PATH attribute calls for includ- ing or prepending the AS number of the local system, the local system may include/prepend more than one instance of its own AS number in the AS_PATH attribute. This is controlled via local configuration. 5.1.3 NEXT_HOP The NEXT_HOP is a well-known mandatory attribute that defines the IP address of the border router that should be used as the next hop to the destinations listed in the UPDATE message. The NEXT_HOP attribute is calculated as follows. 1) When sending a message to an internal peer, if the route is not locally originated the BGP speaker should not modify the NEXT_HOP attribute, unless it has been explicitly configured to announce its own IP address as the NEXT_HOP. When announcing a locally originated route to an internal peer, the BGP speaker should use as the NEXT_HOP the interface address of the router through which the announced network is reachable for the speaker; if the route is directly connected to the speaker, or the interface address of the router through which the announced network is reachable for the speaker is the internal peer's address, then the BGP speaker should use for the NEXT_HOP attribute its own IP address (the address of the interface that is used to reach the peer). 2) When sending a message to an external peer X, and the peer is one IP hop away from the speaker: -Attribute Flags Error. 5 - Attribute Length Error. 6 - Invalid ORIGIN Attribute 8 - InvalidIf the route being announced was learned from an internal peer or is locally originated, the BGP speaker can use for the NEXT_HOPAttribute. 9 - Optional Attribute Error. 10attribute an interface address of the internal peer router (or the internal router) through which the announced network is reachable for the speaker, provided that peer X shares a common subnet with this address. This is a form of "third party" NEXT_HOP attribute. -Invalid Network Field. 11Otherwise, if the route being announced was learned from an external peer, the speaker can use in the NEXT_HOP attribute an IP address of any adjacent router (known from the received NEXT_HOP attribute) that the speaker itself uses for local route calculation, provided that peer X shares a common subnet with this address. This is a second form of "third party" NEXT_HOP attribute. -Malformed AS_PATH. Data:Otherwise, if the external peer to which the route is being advertised shares a common subnet with one of the announcing router's own interfaces, the router may use the IP address associated with such an interface in the NEXT_HOP attribute. Thisvariable-length fieldisusedknown as a "first party" NEXT_HOP attribute. - By default (if none of the above conditions apply), the BGP speaker should use in the NEXT_HOP attribute the IP address of the interface that the speaker uses to establish the BGP con- nection to peer X. 3) When sending a message to an external peer X, and the peer is multiple IP hops away from the speaker (aka "multihop EBGP"): - The speaker may be configured todiagnosepropagate thereason forNEXT_HOP attribute. In this case when advertising a route that theNOTIFICATION. The contentsspeaker learned from one of its peers, theData field depend uponNEXT_HOP attribute of theError Code and Error Subcode. See Section 6 below for more details. Note thatadvertised route is exactly thelengthsame as the NEXT_HOP attribute of theData field can be determined fromlearned route (the speaker just doesn't modify themessage Length field byNEXT_HOP attribute). - By default, theformula: Message Length = 21 + Data Length The minimum lengthBGP speaker should use in the NEXT_HOP attribute the IP address of theNOTIFICATION messageinterface that the speaker uses to establish the BGP connection to peer X. Normally the NEXT_HOP attribute is21 octets (including message header). 5. Path Attributes This section discusseschosen such that the shortest available pathattributes of the UPDATE message. Path attributes fall into four separate categories: 1. Well-known mandatory. 2. Well-known discretionary. 3. Optional transitive. 4. Optional non-transitive. Well-known attributes mustwill berecognized by alltaken. A BGPimplementations. Somespeaker must be able to support disabling advertisement ofthesethird party NEXT_HOP attributesare mandatory andto handle imperfectly bridged media. A BGP speaker mustbe included in every UPDATE messagenever advertise an address of a peer to thatcontains NLRI. Others are discretionary and may or may not be sent inpeer as aparticular UPDATE message. All well-known attributesNEXT_HOP, for a route that the speaker is originating. A BGP speaker mustbe passed along (after proper updating, if necessary) to othernever install a route with itself as the next hop. The NEXT_HOP attribute is used by the BGPpeers. In additionspeaker towell-known attributes, each path may contain one or more optional attributes. It is not required or expecteddetermine the actual outbound interface and immediate next-hop address thatall BGP implementations support all optional attributes.should be used to forward transit packets to the associated destinations. Thehandling of an unrecognized optional attributeimmediate next-hop address is determined by performing a recur- sive route lookup operation for thesettingIP address in the NEXT_HOP attribute using the contents of theTransitive bitRouting Table, selecting one entry if multiple entries of equal cost exist. The Routing Table entry which resolves the IP address in the NEXT_HOP attribute will always specify the outbound interface. If the entry specifies an attached subnet, but does not specify a next-hop address, then the address in the NEXT_HOP attributeflags octet. Paths with unrecognized transitive optional attributesshould beaccepted.used as the immediate next-hop address. Ifa path with unrecognized transitivethe entry also specifies the next-hop address, this address should be used as the immediate next-hop address for packet forwarding. 5.1.4 MULTI_EXIT_DISC The MULTI_EXIT_DISC is an optional non-transitive attribute which may be used on external (inter-AS) links to discriminate among multiple exit or entry points to the same neighboring AS. The value of the MULTI_EXIT_DISC attribute isaccepted and passed alonga four octet unsigned number which is called a metric. All other factors being equal, the exit point with lower metric should be preferred. If received over EBGP, the MULTI_EXIT_DISC attribute MAY be propagated over IBGP to other BGPpeers, thenspeakers within theunrecognized transitive optionalsame AS. The MULTI_EXIT_DISC attributeof that path mustreceived from a neighboring AS MUST NOT bepassed along with the pathpropagated to other neighboring ASs. A BGPpeers with the Partial bit inspeaker MUST IMPLEMENT a mechanism based on local configuration which allows theAttribute Flags octet setMULTI_EXIT_DISC attribute to1. Ifbe removed from apath with recognized transitive optional attribute is accepted and passed alongroute. This MAY be done prior toother BGP peersdetermining the degree of preference of the route and performing route selection (decision process phases 1 and 2). An implementation MAY also (based on local configuration) alter thePartial bit invalue of theAttribute Flags octet is setMULTI_EXIT_DISC attribute received over EBGP. This MAY be done prior to determining the degree of preference of the route and performing route selection (decision process phases 1by some previous AS, itand 2). See section 9.1.2.2 for necessary restricts on this. 5.1.5 LOCAL_PREF LOCAL_PREF isnot set back to 0 by the current AS. Unrecognized non-transitive optional attributes musta well-known attribute that SHALL bequietly ignored and not passed along to otherincluded in all UPDATE messages that a given BGPpeers. New transitive optional attributes may be attachedspeaker sends to thepath by the originator or by anyother internal peers. A BGP speakerin the path. If they are not attached by the originator, the Partial bit inSHALL calculate theAttribute Flags octet is set to 1. The rulesdegree of preference forattaching new non-transitive optional attributes will dependeach external route based on thenature oflocally configured policy, and include thespecific attribute. The documentationdegree ofeach new non-transitive optional attribute will be expectedpreference when advertising a route toinclude such rules. (The descriptionits internal peers. The higher degree ofthe MULTI_EXIT_DISC attribute gives an example.) All optional attributes (both transitive and non-transitive) maypreference MUST beupdated (if appropriate) bypreferred. A BGPspeakers inspeaker shall use thepath. The senderdegree ofan UPDATE message should order path attributes within the UPDATE messagepreference learned via LOCAL_PREF inascending order ofits decision process (see section 9.1.1). A BGP speaker MUST NOT include this attributetype. The receiver of anin UPDATEmessage must be preparedmessages that it sends tohandle path attributes withinexternal peers, except for the case of BGP Confederations [RFC3065]. If it is contained in an UPDATE message thatare out of order. The same attribute cannot appear more than once within the Path Attributes field of a particular UPDATE message. The mandatory category refers tois received from an external peer, then this attributewhich mustMUST bepresent in both IBGP and EBGP exchanges if NLRI are contained inignored by theUPDATE message. Attributes classified as optionalreceiving speaker, except for thepurpose of the protocol extension mechanism may be purely discretionary, or discretionary, required, or disallowed in certain contexts. attribute EBGP IBGP ORIGIN mandatory mandatory AS_PATH mandatory mandatory NEXT_HOP mandatory mandatory MULTI_EXIT_DISC discretionary discretionary LOCAL_PREF disallowed required ATOMIC_AGGREGATE see section 5.1.6 and 9.1.4 AGGREGATOR discretionary discretionary 5.1 Path Attribute Usage The usagecase ofeachBGPpath attributes is described in the following clauses. 5.1.1 ORIGIN ORIGINConfederations [RF3065]. 5.1.6 ATOMIC_AGGREGATE ATOMIC_AGGREGATE is a well-knownmandatorydiscretionary attribute.The ORIGIN attribute shall be generated byWhen a router aggregates several routes for theautonomous systempurpose of advertise- ment to a particular peer, the AS_PATH of the aggregated route nor- mally includes an AS_SET formed from the set of AS from which the aggregate was formed. In many cases the network administrator can determine thatoriginatestheassociated routing information. It shallaggregate can safely beincluded inadvertised without theUPDATE messagesAS_SET and not form route loops. If an aggregate excludes at least some ofall BGP speakers that choose to propagate this information to other BGP speakers. 5.1.2 AS_PATH AS_PATH is a well-known mandatory attribute. This attribute identifiestheautonomous systems through which routing information carriedAS numbers present inthis UPDATE message has passed. The componentsthe AS_PATH ofthis list can be AS_SETs or AS_SEQUENCEs. Whenthe routes that are aggregated as a result of dropping the AS_SET, the aggregated route, when advertised to the peer, SHOULD include the ATOMIC_AGGREGATE attribute. A BGP speakerpropagatesthat receives a routewhich it has learned from another BGP speaker's UPDATE message, it shall modifywith theroute's AS_PATHATOMIC_AGGREGATE attributebased onSHOULD NOT remove thelocation ofattribute from the route when propa- gating it to other speakers. A BGP speakerto whichthat receives a route with the ATOMIC_AGGREGATE attribute MUST NOT make any NLRI of that routewill be sent: a) When a givenmore specific (as defined in 9.1.4) when advertising this route to other BGP speakers. A BGP speakeradvertises thethat receives a route with the ATOMIC_AGGREGATE attribute needs toan internal peer,be cognizant of the fact that the actual path to destinations, as specified in theadvertising speaker shallNLRI of the route, while having the loop-free property, may notmodifybe the path specified in the AS_PATH attributeassociated withof the route.b) When a given5.1.7 AGGREGATOR AGGREGATOR is an optional transitive attribute which may be included in updates which are formed by aggregation (see Section 9.2.2.2). A BGP speakeradvertises thewhich performs routeto an external peer, then the advertising speaker shall updateaggregation may add theAS_PATHAGGREGATOR attributeas follows: 1) if the first path segment of the AS_PATH is of type AS_SEQUENCE, the local systemwhich shallprependcontain its own AS number and IP address. The IP address should be the same as thelast elementBGP Identifier of thesequence (put it inspeaker. 6. BGP Error Handling. This section describes actions to be taken when errors are detected while processing BGP messages. When any of theleftmost position). Ifconditions described here are detected, a NOTIFICA- TION message with theact of prepending will cause an overflow inindicated Error Code, Error Subcode, and Data fields is sent, and theAS_PATH segment, i.e. more than 255 elements,BGP connection is closed, unless itshall be legalis explicitly stated that no NOTIFICATION message is toprepend a new segment of type AS_SEQUENCEbe sent andprepend its own AS numberthe BGP connection is not tothis new segment. 2) ifbe closed. If no Error Subcode is specified, then a zero must be used. The phrase "the BGP connection is closed" means that thefirst path segment ofTCP connec- tion has been closed, theAS_PATH is of type AS_SET,associated Adj-RIB-In has been cleared, and that all resources for that BGP connection have been deallocated. Entries in thelocal system shall prepend a new path segment of type AS_SEQUENCE toLoc-RIB associated with theAS_PATH, including its own AS number inremote peer are marked as invalid. The fact thatsegment. When athe routes have become invalid is passed to other BGPspeaker originates a route then: a)peers before theoriginating speaker shall include its own AS number in a path segment of type AS_SEQUENCE inroutes are deleted from theAS_PATH attributesystem. Unless specified explicitly, the Data field ofall UPDATE messagesthe NOTIFICATION mes- sage that is sent to indicate anexternal peer. (In this case, the AS number of the originating speaker's autonomous system will beerror is empty. 6.1 Message Header error handling. All errors detected while processing theonly entryMessage Header are indicated by sending thepath segment, and this path segment will beNOTIFICATION message with Error Code Message Header Error. The Error Subcode elaborates on theonly segment inspecific nature of theAS_PATH attribute). b)error. The expected value of theoriginating speaker shall include an empty AS_PATH attribute in all UPDATE messages sent to internal peers. (An empty AS_PATH attribute is one whose lengthMarker fieldcontainsof thevalue zero). Whenevermessage header is all ones. If themodificationMarker field of theAS_PATH attribute calls for including or prependingmessage header is not as expected, then a synchronization error has occurred and theAS number ofError Subcode is set to Connection Not Synchronized. If thelocal system,Length field of thelocal system may include/prepend moremessage header is less thanone instance of its own AS number in19 or greater than 4096, or if theAS_PATH attribute. ThisLength field of an OPEN message iscontrolled via local configuration. 5.1.3 NEXT_HOP The NEXT_HOP path attribute definesless than theIP addressminimum length of theborder router that should be used asOPEN message, or if thenext hop toLength field of an UPDATE message is less than thedestinations listed inminimum length of the UPDATEmessage. The NEXT_HOP attribute is calculated as follows. 1) When sendingmessage, or if the Length field of a KEEPALIVE messageto an internal peer, the BGP speaker shouldis notmodify the NEXT_HOP attribute, unless it has been explicitly configuredequal toannounce its own IP address as19, or if theNEXT_HOP. 2) When sendingLength field of a NOTIFICATION messageto an external peer X, and the peerisone IP hop away fromless than thespeaker: - Ifmini- mum length of theroute being announced was learned from an internal peer orNOTIFICATION message, then the Error Subcode islocally originated,set to Bad Message Length. The Data field contains theBGP speaker can use forerroneous Length field. If theNEXT_HOP attribute an interface addressType field of theinternal peer router (or the internal router) through whichmessage header is not recognized, then theannounced networkError Subcode isreachable forset to Bad Message Type. The Data field contains thespeaker, provided that peer X shares a common subneterroneous Type field. 6.2 OPEN message error handling. All errors detected while processing the OPEN message are indicated by sending the NOTIFICATION message withthis address. This is a formError Code OPEN Message Error. The Error Subcode elaborates on the specific nature of"third party" NEXT_HOP attribute. - Iftheroute being announced was learned from an external peer,error. If thespeaker can useversion number contained in theNEXT_HOP attribute an IP addressVersion field ofany adjacent router (known fromthe receivedNEXT_HOP attribute) that the speaker itself uses for local route calculation, provided that peer X shares a common subnet with this address. ThisOPEN message isa second form of "third party" NEXT_HOP attribute. - Ifnot supported, then theexternal peerError Subcode is set towhich the routeUnsupported Version Number. The Data field isbeing advertised sharesacommon subnet with one of2-octets unsigned integer, which indicates theannouncing router's own interfaces,largest locally supported version number less than therouter may useversion theIP address associated with such an interfaceremote BGP peer bid (as indicated in theNEXT_HOP attribute. Thisreceived OPEN message), or if the smallest locally supported version number isknown as a "first party" NEXT_HOP attribute. - By default (if none ofgreater than theabove conditions apply),version the remote BGPspeaker should use inpeer bid, then theNEXT_HOP attributesmallest locally supported version number. If theIP addressAutonomous System field of theinterface that the speaker uses to establish the BGP session to peer X. 3) When sending aOPEN messageto an external peer X, and the peerismultiple IP hops away fromunacceptable, then thespeaker (aka "multihop EBGP"): - The speaker may be configuredError Subcode is set topropagate the NEXT_HOP attribute. In this case when advertising a route thatBad Peer AS. The determination of acceptable Autonomous System numbers is outside thespeaker learned from onescope ofits peers,this protocol. If theNEXT_HOP attributeHold Time field of theadvertised routeOPEN message isexactly the same asunacceptable, then theNEXT_HOP attributeError Subcode MUST be set to Unacceptable Hold Time. An implementa- tion MUST reject Hold Time values of one or two seconds. An imple- mentation MAY reject any proposed Hold Time. An implementation which accepts a Hold Time MUST use thelearned route (the speaker just doesn't modifynegotiated value for theNEXT_HOP attribute). - By default,Hold Time. If the BGPspeaker should use in the NEXT_HOP attribute the IP addressIdentifier field of theinterface thatOPEN message is syntactically incorrect, then thespeaker usesError Subcode is set toestablish theBad BGPsession to peer X. Normally the NEXT_HOP attribute is chosen suchIdentifier. Syn- tactic correctness means that theshortest available path will be taken. ABGPspeaker must be able to support disabling advertisementIdentifier field represents a valid IP host address. If one ofthird party NEXT_HOP attributesthe Optional Parameters in the OPEN message is not recognized, then the Error Subcode is set tohandle imperfectly bridged media. A BGP speaker must never advertise an addressUnsupported Optional Parameters. If one ofa peer to that peer as a NEXT_HOP, for a route thatthespeakerOptional Parameters in the OPEN message isoriginating. A BGP speaker must never install a route with itself asrecognized, but is malformed, then thenext hop.Error Subcode is set to 0 (Unspecific). 6.3 UPDATE message error handling. All errors detected while processing the UPDATE message are indicated by sending the NOTIFICATION message with Error Code UPDATE Message Error. TheNEXT_HOP attribute is used byerror subcode elaborates on theBGP speaker to determinespecific nature of theactual outbound interface and immediate next-hop address that should be used to forward transit packets toerror. Error checking of an UPDATE message begins by examining theassociated destinations. The immediate next-hop addresspath attributes. If the Withdrawn Routes Length or Total Attribute Length isdetermined by performing a recursive route lookup operation fortoo large (i.e., if Withdrawn Routes Length + Total Attribute Length + 23 exceeds theIP address inmessage Length), then theNEXT_HOPError Subcode is set to Malformed Attribute List. If any recognized attributeusinghas Attribute Flags that conflict with thecontents ofAttribute Type Code, then theRouting Table (see Section 9.1.2.2).Error Subcode is set to Attribute Flags Error. Theresolving route will always specifyData field contains theoutbound interface.erroneous attribute (type, length and value). If any recognized attribute has Attribute Length that conflicts with theresolving route specifiesexpected length (based on thenext-hop address, this address should be used asattribute type code), then theimmediate address for packet forwarding.Error Subcode is set to Attribute Length Error. The Data field con- tains the erroneous attribute (type, length and value). If any of theaddress inmandatory well-known attributes are not present, then theNEXT_HOP attributeError Subcode isdirectly resolved through a routeset toan attached subnet (such a route will not specifyMissing Well-known Attribute. The Data field contains thenext-hop address),Attribute Type Code of theoutbound interface should be taken frommissing well-known attribute. If any of theresolving route andmandatory well-known attributes are not recognized, then theaddress inError Subcode is set to Unrecognized Well-known Attribute. The Data field contains theNEXT_HOPunrecognized attributeshould be used as(type, length and value). If theimmediate next-hop address. 5.1.4 MULTI_EXIT_DISC The MULTI_EXIT_DISCORIGIN attributemay be used on external (inter-AS) links to discriminate among multiple exit or entry points tohas an undefined value, then thesame neighboring AS.Error Sub- code is set to Invalid Origin Attribute. Thevalue ofData field contains theMULTI_EXIT_DISCunrecognized attributeis a four octet unsigned number which is called a metric. All other factors being equal, the exit point with lower metric should be preferred.(type, length and value). Ifreceived over external links,theMULTI_EXIT_DISCNEXT_HOP attributeMAY be propagated over internal links to other BGP speakers withinfield is syntactically incorrect, then thesame AS.Error Subcode is set to Invalid NEXT_HOP Attribute. TheMULTI_EXIT_DISCData field contains the incorrect attributereceived from a neighboring AS MUST NOT be propagated to other neighboring ASs. A BGP speaker MUST IMPLEMENT a mechanism based on local configuration which allows(type, length and value). Syntactic correctness means that theMULTI_EXIT_DISCNEXT_HOP attributeto be removed fromrepresents aroute. This MAY be done prior to determiningvalid IP host address. The IP address in thedegree of preference ofNEXT_HOP must meet theroute and performing route selection (decision process phases 1 and 2). An implementation MAY also (based on local configuration) alterfollowing criteria to be considered semantically correct: a) It must not be thevalueIP address of theMULTI_EXIT_DISC attribute received over an external link. If it does so, it shall do so prior to determiningreceiving speaker b) In thedegree of preferencecase of an EBGP where theroute and performing route selection (decision process phases 1sender and2). 5.1.5 LOCAL_PREF LOCAL_PREF is a well-known attribute that SHALL be includedreceiver are one IP hop away from each other, either the IP address inall UPDATE messages that a given BGP speaker sendsthe NEXT_HOP must be the sender's IP address (that is used to establish theother internal peers. ABGPspeaker SHALL calculateconnection), or thedegree of preference for each external route based oninterface associated with thelocally configured policy,NEXT_HOP IP address must share a common subnet with the receiving BGP speaker. If the NEXT_HOP attribute is semantically incorrect, the error should be logged, andincludethedegree of preference when advertising arouteto its internal peers. The higher degree of preference MUSTshould bepreferred. A BGP speaker shall use the degree of preference learned via LOCAL_PREF in its decision process (see section 9.1.1). A BGP speaker MUST NOT includeignored. In this case, no NOTIFI- CATION message should be sent, and connection should not be closed. The AS_PATH attributein UPDATE messages that it sendsis checked for syntactic correctness. If the path is syntactically incorrect, then the Error Subcode is set to Malformed AS_PATH. If the UPDATE message is received from an externalpeers, except forpeer, thecaselocal system MAY check whether the leftmost AS in the AS_PATH attribute is equal to the autonomous system number ofBGP Confederations [13].the peer than sent the mes- sage. Ifitthe check determines that this iscontained innot the case, the Error Subcode is set to Malformed AS_PATH. If anUPDATE message thatoptional attribute isreceived from an external peer,recognized, then the value of this attributeMUST be ignored by the receiving speaker, except foris checked. If an error is detected, thecase of BGP Confederations [13]. 5.1.6 ATOMIC_AGGREGATE ATOMIC_AGGREGATEattribute isa well-known discretionary attribute. When a router aggregates several routes fordis- carded, and thepurpose of advertisementError Subcode is set toa particular peer, andOptional Attribute Error. The Data field contains theAS_PATH ofattribute (type, length and value). If any attribute appears more than once in theaggregated route excludes at least some ofUPDATE message, then theAS numbers presentError Subcode is set to Malformed Attribute List. The NLRI field in theAS_PATH ofUPDATE message is checked for syntactic valid- ity. If theroutes that are aggregated,field is syntactically incorrect, then theaggregated route, when advertisedError Subcode is set tothe peer, MUST include the ATOMIC_AGGREGATE attribute. A BGP speaker that receivesInvalid Network Field. If aroute with the ATOMIC_AGGREGATE attribute MUST NOT removeprefix in theattribute fromNLRI field is semantically incorrect (e.g., an unexpected multicast IP address), an error should be logged locally, and theroute when propagating it to other speakers. A BGP speakerprefix should be ignored. An UPDATE message thatreceivescontains correct path attributes, but no NLRI, shall be treated as aroute withvalid UPDATE message. 6.4 NOTIFICATION message error handling. If a peer sends a NOTIFICATION message, and theATOMIC_AGGREGATE attribute MUST NOT make any NLRIreceiver ofthat route more specific (as definedthe mes- sage detects an error in9.1.4) when advertisingthat message, the receiver can not use a NOTIFICATION message to report thisrouteerror back toother BGP speakers. A BGP speaker that receives a route withtheATOMIC_AGGREGATE attribute needs topeer. Any such error, such as an unrecognized Error Code or Error Subcode, should becognizantnoticed, logged locally, and brought to the attention of thefact thatadminis- tration of theactual pathpeer. The means todestinations, asdo this, however, lies outside the scope of this document. 6.5 Hold Timer Expired error handling. If a system does not receive successive KEEPALIVE and/or UPDATE and/or NOTIFICATION messages within the period specified in theNLRIHold Time field of theroute, while havingOPEN message, then theloop-free property, may notNOTIFICATION message with Hold Timer Expired Error Code must be sent and thepath specified inBGP connection closed. 6.6 Finite State Machine error handling. Any error detected by theAS_PATH attributeBGP Finite State Machine (e.g., receipt ofthe route. 5.1.7 AGGREGATOR AGGREGATOR isanoptional transitive attribute whichunexpected event) is indicated by sending the NOTIFICATION message with Error Code Finite State Machine Error. 6.7 Cease. In absence of any fatal errors (that are indicated in this section), a BGP peer may choose at any given time to close its BGP connection by sending the NOTIFICATION message with Error Code Cease. However, the Cease NOTIFICATION message must not beincluded in updates which are formedused when a fatal error indicated byaggregation (see Section 9.2.2.2).this section does exist. A BGP speakerwhich performs route aggregationmayaddsupport the ability to impose an (locally config- ured) upper bound on the number of address prefixes the speaker is willing to accept from a neighbor. When the upper bound is reached, theAGGREGATOR attribute which shall contain its own AS number and IP address. The IPspeaker (under control of local configuration) may either (a) discard new addressshould beprefixes from thesame asneighbor (while maintaining BGP connection with the neighbor), or (b) terminate the BGPIdentifier ofconnection with the neighbor. If thespeaker. 6.BGPError Handling. This section describes actionsspeaker decides tobe taken when errors are detected while processingterminate its BGPmessages. When anyconnection with a neighbor because the number of address prefixes received from theconditions described here are detected,neighbor exceeds the locally configured upper bound, then the speaker must send to the neighbor a NOTIFICATIONmessagemes- sage with theindicatedErrorCode, Error Subcode, and Data fields is sent, and theCode Cease. 6.8 BGP connectionis closed.collision detection. Ifno Error Subcode is specified, thenazero must be used. The phrase "thepair of BGPconnection is closed" means that the transport protocol connection has been closed, the associated Adj-RIB-In has been cleared, and that all resources for thatspeakers try simultaneously to establish a BGPconnection have been deallocated. Entries incon- nection to each other, then two parallel connections between this pair of speakers might well be formed. If theLoc-RIB associated withsource IP address used by one of these connections is theremote peer are markedsame asinvalid. The fact that the routes have become invalid is passed to other BGP peers beforetheroutes are deleted fromdestination IP address used by thesystem. Unless specified explicitly,other, and theData field ofdestination IP address used by theNOTIFICATION message that is sent to indicate an errorfirst connection isempty. 6.1 Message Header error handling. All errors detected while processingtheMessage Header are indicatedsame as the source IP address used bysendingtheNOTIFICATION message with Error Code Message Header Error. The Error Subcode elaborates onother, we refer to this situation as connection collision. Clearly in thespecific naturepresence ofthe error. The expected valueconnection collision, one of these connections must be closed. Based on theMarker fieldvalue of themessage headerBGP Identifier a convention isall ones if the message typeestablished for detecting which BGP connection isOPEN.to be preserved when a colli- sion does occur. Theexpected value ofconvention is to compare theMarker field for all other types ofBGPmessages determined based on the presenceIdentifiers of theAuthentication Information Optional Parameterpeers involved in theBGP OPEN messagecollision and to retain only theactual authentication mechanism (ifconnection initiated by theAuthentication Information inBGP speaker with the higher-valued BGP Identifier. Upon receipt of an OPENmessage is present). The Marker field should bemessage, the local system must examine allonesof its connections that are in the OpenConfirm state. A BGP speaker may also examine connections in an OpenSent state if it knows theOPEN message carried no authentication information. IfBGP Identifier of theMarker fieldpeer by means outside of themessage headerprotocol. If among these connections there isnot the expected one, thenasynchronization error has occurred and the Error Subcode is setconnection toConnection Not Synchronized. If the Length field of the message header is less than 19 or greater than 4096, or if the Length field of an OPEN message is less thana remote BGP speaker whose BGP Identifier equals theminimum length ofone in the OPEN message,or ifand this connec- tion collides with theLength field of an UPDATEconnection over which the OPEN message isless thanreceived then theminimum lengthlocal system performs the following collision reso- lution procedure: 1. The BGP Identifier of theUPDATE message, or iflocal system is compared to theLength fieldBGP Identifier ofa KEEPALIVE messagethe remote system (as specified in the OPEN mes- sage). Comparing BGP Identifiers isnot equal to 19, or ifdone by treating them as (4-octet long) unsigned integers. 2. If theLength fieldvalue ofa NOTIFICATION messagethe local BGP Identifier is less than theminimum length of the NOTIFICATION message, thenremote one, theError Subcodelocal system closes BGP connection that already exists (the one that isset to Bad Message Length. The Data field containsalready in theerroneous Length field. IfOpenConfirm state), and accepts BGP connection initiated by theType field ofremote system. 3. Otherwise, themessage headerlocal system closes newly created BGP connection (the one associated with the newly received OPEN message), and continues to use the existing one (the one that isnot recognized, thenalready in theError SubcodeOpenConfirm state). Unless allowed via configuration, a connection collision with an existing BGP connection that isset to Bad Message Type. The Data field containsin Established state causes closing of theerroneous Type field. 6.2 OPEN message error handling. All errorsnewly created connection. Note that a connection collision can not be detectedwhile processing the OPEN messagewith connections that areindicatedin Idle, or Connect, or Active states. Closing the BGP connection (that results from the collision resolu- tion procedure) is accomplished by sending the NOTIFICATION message with the Error Code Cease. 7. BGP Version Negotiation BGP speakers may negotiate the version of the protocol by making mul- tiple attempts to open a BGP connection, starting with the highest version number each supports. If an open attempt fails with an Error Code OPEN MessageError. TheError, and an Error Subcodeelaborates onUnsupported Version Number, then thespecific nature ofBGP speaker has available theerror. Ifversion number it tried, the version numbercontainedits peer tried, the version number passed by its peer in theVersion field ofNOTIFICATION message, and thereceived OPEN message is not supported,version numbers that it supports. If the two peers do support one or more common versions, then this will allow them to rapidly determine theError Subcode is sethighest common version. In order toUnsupported Version Number. The Data field issupport BGP version negotiation, future versions of BGP must retain the format of the OPEN and NOTIFICATION messages. 8. BGP Finite State machine This section specifies the BGP operation in terms of a2-octets unsigned integer, which indicatesFinite State Machine (FSM). The section falls into 2 parts: 1) Description of Events for thelargest locally supported version number less thanState machine (section 8.1) 2) Description of theversionFSM (section 8.2) Session Attributes required for each connection are; 1) State 2) Connect Retry timer 3) Hold timer 4) Hold time 5) Keepalive timer 8.1 Events for theremoteBGP FSM 8.1.1 Administrative Events Please note that only Event 1 (manual start) and Event 2 (manual stop) are mandatory administrative events. All other administrative events are optional. Event1: Manual start Definition: Administrator manually starts peerbid (as indicated inconnection. Status: Mandatory Event2: Manual stop Definition: Local system administrator manually stops thereceived OPEN message), or ifpeer connection. Status: Mandatory Event3: Automatic start Definition: Local system automatically starts the BGP connection. Status: Optional depending on local system Event4: Manual start with passive TCP establishment Definition: Administrator manually start thesmallest locally supported version number is greater thanpeer connection, but has theversionpassive flag enabled. The passive flag indicates that theremote BGPpeerbid, thenwill listen prior to establishing thesmallest locally supported version number. Ifconnection. Status: Optional depending on local system Event5: Automatic start with passive TCP establishment Definition: Local system automatically starts theAutonomous System field ofBGP connection with theOPEN message is unacceptable, thenpassive flag enabled. The passive flag indicates that theError Subcode is setpeer will listen prior toBad Peer AS.establishing a connection. Status: Optional depending on local system use of a passive connection. Event6: Automatic start with bgp_stop_flap option set Definition: Local system automatically starts the BGP peer connection with persistent peer oscillation damping enabled. Thedeterminationexact method ofacceptable Autonomous System numbersdamping persistent peer oscillations is left up to the implementation. These methods of damping persistent BGP adjacency flapping are outside the scope of thisprotocol. Ifdocument. Status: Optional, used only if theHold Time fieldbgp peer has Enabled a method of damping persistent BGP peer flapping. Event7: Auto stop Definition: Local system automatically stops theOPEN message is unacceptable, then the Error Subcode MUST be set to Unacceptable Hold Time. An implementation MUST reject Hold Time values of one or two seconds. An implementation MAY reject any proposed Hold Time. An implementation which accepts aBGP connection. Status: Optional depending on local system 8.1.2 Timer Events Event8: Idle hold timer expires Definition: Idle HoldTime MUST use the negotiated value for thetimer expires. The Idle HoldTime. If the BGP Identifier field of the OPEN message is syntactically incorrect, then the Error SubcodeTimer isset to Badonly used when persistent BGPIdentifier. Syntactic correctness means that theoscillation damping functions are enabled. Status: Optional. Used when persistent BGPIdentifier field represents a valid IP host address. If one ofpeer oscillation damping functions are enabled. Event9: Connect retry timer expires Definition: An event triggered by theOptional Parameters inexpiration of theOPEN message is not recognized, thenConnectRetry timer. Status: Mandatory Event10: Hold time expires Definition: An event generated when theError Subcode is setHoldTimer expires. Status: Mandatory Event11: Keepalive timer expires Definition: A periodic event generated due toUnsupported Optional Parameters. If onethe expiration of theOptional Parameters inKeepAlive Timer. Status: Mandatory Event12: DelayBGP open timer expires Definition: A timer that delays sending of theOPENBGP Open messageis recognized, but is malformed, then the Error Subcode is set to 0 (Unspecific). Iffor n seconds after theOPEN message carries Authentication Information (as anTCP connection has been completed. Status: OptionalParameter), then the corresponding authentication procedure is invoked. If the authentication procedure (based on Authentication Code8.1.3 TCP Connection based Events Event13: TCP connection indication & valid remote peer Definition: Event indicating that TCP connection request with a valid source IP address andAuthentication Data) fails, then the Error SubcodeTCP port, and valid destination IP address and TCP Port. The definition of invalid source, and invalid destination IP address issetleft toAuthentication Failure. 6.3 UPDATE message error handling. All errors detected while processingtheUPDATE message are indicatedimplementation. BGP's destination port should be port 179 as defined by IANA. TCP connection request is denoted bysendingtheNOTIFICATION messagelocal system receiving a TCP SYN. Status: Mandatory Event14: RCV TCP connection indication withError Code UPDATE Message Error. The error subcode elaborates on the specific nature of the error. Error checking ofinvalid source or destination Definition: TCP connection request received with either anUPDATE message begins by examining the path attributes. If the Withdrawn Routes Lengthinvalid source address orTotal Attribute Lengthport number or an invalid destination address or port number. BGP destination port number should be 179 as defined by IANA. Again, a TCP connection request istoo large (i.e., if Withdrawn Routes Length + Total Attribute Length + 23 exceeds the message Length), then the Error Subcodeisset to Malformed Attribute List. If any recognized attribute has Attribute Flags that conflictdenoted by local system receiving a TCP SYN withthe Attribute Type Code, then the Error Subcode is setan invalid source port or destination address or port number. Status: Mandatory Event15: TCP connection request sent received an ACK. Definition: Local system's request toAttribute Flags Error. The Data field contains the erroneous attribute (type, length and value). If any recognized attribute has Attribute Length that conflicts with the expected length (based on the attribute type code), then the Error Subcode is setestablish a TCP connection toAttribute Length Error. The Data field containstheerroneous attribute (type, lengthremote side received an ACK. The local system's TCP session sent a TCP SYN, andvalue). If anyreceived a TCP SYN, ACK pair ofthe mandatory well-known attributes are not present, then the Error Subcode is set to Missing Well-known Attribute.messages, and Sent a TCP ACK. Status: Mandatory Event16: TCP connection confirmed Definition: TheData field contains the Attribute Type Code of the missing well-known attribute. If any oflocal system has received a confirmation that themandatory well-known attributes are not recognized, thenTCP connection has been established by theError Subcode is set to Unrecognized Well-known Attribute.remote site. TheData field contains the unrecognized attribute (type, lengthremote peer's TCP engine sent a TCP SYN. The local peer's TCP engine sent a SYN, ACK pair, andvalue). If the ORIGIN attributenow hasan undefined value, then the Error Subcode is set to Invalid Origin Attribute.received a final ACK. Status: Mandatory Event17: TCP connection fails Definition: This BGP peer receives a TCP connection failure notice. TheData field contains the unrecognized attribute (type, length and value). If the NEXT_HOP attribute fieldremote BGP peer's TCP machine could have sent a FIN. The local peer would respond with a FIN-ACK. Another alternative issyntactically incorrect, thenthat theError Subcode is set to Invalid NEXT_HOP Attribute. The Data field containslocal peer indicated a timeout in theincorrect attribute (type, lengthTCP session andvalue). Syntactic correctness means thatdowned theNEXT_HOP attribute representsconnection. Status: Mandatory 8.1.4 BGP Messages based Events Event18: BGPOpen Definition: An event indicating that a validIP host address. Semantic correctness applies only to the externalOpen message has been received. Status: Mandatory Event19: BGPOpen with BGPlinks, and only when the sender and the receiving speaker are one IP hop away from each other. To be semantically correct, the IP address in the NEXT_HOP must not beDelay Open Timer running Definition: An event indicating that a valid Open message has been successful established for a peer that is currently delaying theIP addresssending ofthe receiving speaker, and the NEXT_HOP IP address must either be the sender's IP address (used to establish thean BGPsession), or the interface associatedOpen message. Status: Optional Event20: BGPHeaderErr Definition: BGP message header is not valid. Status: Mandatory Event21: BGPOpenMsgErr Definition: An BGP Open message has been received withthe NEXT_HOP IP address must shareerrors. Status: Mandatory Event22: Open collision dump Definition: An event generated administratively when acommon subnetconnection Collision has been detected while processing an incoming Open message. This connection has been selected to disconnected. See section 6.8 for more information on collision detection. Event 22 is an administrative could occur if FSM is implemented as two linked state machines. Status: Optional Event23: NotifMsgVerErr Definition: An event is generated when a NOTIFICIATION message withthe receiving BGP speaker. If the NEXT_HOP attribute"version error" issemantically incorrect, the error should be logged,received. Status: Mandatory Event24: NotifMsg Definition: An event is generated when a NOTIFICATION messages is received and theroute should be ignored. In this case, no NOTIFICATIONerror code is anything but "version error". Status: Mandatory Event25: KeepAliveMsg Definition: An event is generated when a KEEPALIVE messageshould be sent. The AS_PATH attributeischecked for syntactic correctness. If the pathreceived. Status: Mandatory Event26: UpdateMsg Definition: An event issyntactically incorrect, then the Error Subcodegenerated when a valid Update message isset to Malformed AS_PATH. The information carried by the AS_PATH attributereceived. Status: Mandatory Event27: UpdateMsgErr Definition: An event ischecked for AS loops. AS loop detectiongenerated when an invalid Update message isdone by scanning the full AS path (as specifiedreceived. Status: Mandatory 8.2 Description of FSM 8.2.1 FSM Definition BGP must maintain a separate FSM for each configured peer, Each BGP peer paired inthe AS_PATH attribute), and checking that the autonomous system number of the local system does not appeara potential connection unless configured to remain in theAS path. Ifidle state, or configured to remain passive, will attempt to to connect to theautonomous system number appears inother. For theAS pathpurpose of this discussion, theroute may be stored inactive or connect side of theAdj-RIB-In, but unlessTCP connection (the side of a TCP connection (the side sending therouterfirst TCP SYN packet) isconfigured to accept routes with its own autonomous system in the AS path,called outgoing. The passive or listening side (the sender of theroute shall not be passed tofirst SYN ACK) is called an incoming connection. [See section on the terms active and passive below.] A BGPDecision Process. Operations of a router that is configuredimplementation must connect toaccept routes with its own autonomous system numberand listen on TCP port 179 for incoming connections in addition to trying to connect to peers. For each incoming connection, a state machine must be instantiated. There exists a period in which theAS path are outside the scopeidentity ofthis document. If an optional attribute is recognized, thenthevaluepeer on the other end ofthis attribute is checked. Ifanerrorincoming connection isdetected,known but theattributeBGP identifier isdiscarded,not known. During this time, both an incoming and an outgoing connection for theError Subcodesame configured peering may exist. This issetreferred toOptional Attribute Error. The Data field containsas a connection collision (see Section x.x, was 6.8). A BGP implementation will have at most one FSM for each configured peering plus one FSM for each incoming TCP connection for which theattribute (type, length and value). If any attribute appearspeer has not yet been identified. Each FSM corresponds to exactly one TCP connection. There may be more thanonce in the UPDATE message, thenone connections between a pair of peers if theError Subcodeconnections are configured to use a different pair of IP addresses. This issetreferred toMalformed Attribute List.as multiple "configured peerings" to the same peer. 8.2.1.1 Terms "active" and "passive" TheNLRI fieldterms active and passive have been in our vocabulary for almost a decade and have proven useful. The words active and passive have slightly different meanings applied to a TCP connection or applied to a peer. There is only one active side and one passive side to any one TCP connection per theUPDATE messagedefinition above and the state machine below. When a BGP speaker ischecked for syntactic validity. Ifconfigured active it may end up on either thefieldactive or passive side of the connection that eventually gets established. Once the TCP connection issyntactically incorrect, thencompleted, it doesn't matter which end was active and which end was passive and theError Subcodeonly difference is which side of the TCP connection has port number 179. 8.2.1.2 FSM and collision detection There issetone FSM per BGP connection. Prior toInvalid Network Field. Ifdetermining what peer aprefix in the NLRI fieldconnection issemantically incorrect (e.g., an unexpected multicast IP address), an error shouldassociated with there may belogged locally, and the prefixtwo connections for a given peer. There should beignored. An UPDATE message that contains correct path attributes, butnoNLRI, shall be treated as a valid UPDATE message. 6.4 NOTIFICATION message error handling. If a peer sends a NOTIFICATION message, andmore than one connection per peer. The collision detection identifies the case where there isan error inmore than one connection per peer and provides guidance for which connection to get rid of. When this occurs, the corresponding FSM for the connec- tion thatmessage, thereisunfortunately no means of reporting this error via a subsequent NOTIFICATION message. Any such error, such as an unrecognized Error Code or Error Subcode,closed should benoticed, logged locally, and brought to the attentiondisposed of 8.2.2 Finite State Machine Idle state: Initially BGP is in theadministration ofIdle state. In this state BGP refuses all incoming BGP connections. No resources are allocated to the peer.The meansIn response todo this, however, lies outside the scope of this document. 6.5 Hold Timer Expired error handling. Ifasystem does not receive successive KEEPALIVE and/or UPDATE and/or NOTIFICATION messages within the period specified in the Hold Time field of the OPEN message, thenmanual start event(Event1) or an automatic start event(Event3), theNOTIFICATION message with Hold Timer Expired Error Code must be sent andlocal system - initializes all BGP resources, - sets ConnectRetryCnt (the connect retry counter) to zero - starts the connect retry timer with initial value, - initiates a TCP connection to the other BGP peer, - listens for a connectionclosed. 6.6 Finite State Machine error handling. Any error detectedthat may be initiated by the remote BGPFinite State Machine (e.g., receipt of an unexpected event)peer, and - changes its state to connect. An manual stop event (Event2) isindicated by sendingignored in theNOTIFICATION message with Error Code Finite State Machine Error. 6.7 Cease.Idle state. Inabsence of any fatal errors (that are indicated in this section),response to a manual start event with the passive TCP connection flag (Event 4) or automatic start with the passive TCP connection flag (Event 5), the local system: - initializes all BGPpeer may choose at any given timeresources, - sets ConnectRetryCnt (the connect retry counter) toclose its BGP connection by sendingzero, - start theNOTIFICATION messageconnect retry timer withError Code Cease. However, the Cease NOTIFICATION message must not be used wheninitial value, - listens for afatal error indicated by this section does exist. A BGP speakerconnection that maysupportbe initiated by theabilityremote peer, and - changes its state toimpose an (locally configured) upper bound on the numberActive. The exact value ofaddress prefixesthespeakerConnectRetry timer iswilling to accept fromaneighbor. When the upper bound is reached, the speaker (under control oflocalconfiguration) may either (a) discard new address prefixes from the neighbor, or (b) terminate the BGP peering with the neighbor.matter, but it should be sufficiently large to allow TCP initialization. Ifthea persistent BGPspeaker decides to terminate its peeringpeer oscillation damping function is enabled, two additional events may occur within Idle state: - Automatic start witha neighbor becausebgp_stop_flap set [Event6], - Idle Hold Timer expired [Event 8]. The method of preventing persistent BGP peer oscillation is outside thenumberscope ofaddress prefixesthis document. Any other events [Events 9-27] receivedfrom the neighbor exceedsin thelocally configured upper bound, thenIdle state, are noted by thespeaker must send toMIB processing as FSM Errors and theneighbor a NOTIFICATION message withlocal peer stays in theError Code Cease. 6.8 Connection collision detection. If a pair of BGP speakers try simultaneously to establish aIdle State. Connect State: In this state, BGP is waiting for the TCP connection toeach other, then two parallel connections between this pair of speakers might wellbeformed.completed. If thesource IP address used by one of these connectionsTCP connection succeeds [Event 15 or Event 16], the local system checks the "Delay Open Flag". If the delay Open flag is set, thesame aslocal system: - clears thedestination IP address used byconnect retry timer, - set theother, andBGP open delay timer to thedestination IP address used byinitial value. If thefirst connectionDelay Open flag is not set, thesame as the source IP address used bylocal system: - clears theother, we referconnect retry timer, - completes BGP initialization - send an Open message tothis situation as connection collision. Clearly in the presence of connection collision, one of these connections must be closed. Based onits peer, - sets hold timer to a large value, and - Change the state to Open Sent. A hold timer value of 4 minutes is suggested. If the Open Delay timer expires [Event 12] in the connect state, - send an Open message to its peer, - set theBGP Identifier a convention is established for detecting which BGP connection ishold timer tobe preserved whenacollision does occur. The convention islarge value, and - change the state tocompareOpen Sent. If the BGPIdentifiers of the peers involved inport receives a TCP connection indication [Event 13], thecollisionTCP connection is processed andto retain onlythe connectioninitiated byremains in theBGP speaker withconnected state. If thehigher-valued BGP Identifier. Upon receipt ofTCP connection receives anOPEN message, the local system must examine all of its connectionsindication thatare inis invalid or unconfigured. [Event 14]: - theOpenConfirm state. A BGP speaker may also examine connections in an OpenSent state if it knowsTCP connection is rejected. If theBGP Identifier ofTCP connection fails (timeout or disconnect) [Event17], thepeer by means outside oflocal system: - restarts theprotocol. If among these connections there is a connectionconnect retry timer, - continues to listen for a connection that may be initiated by the remote BGPspeaker whose BGP Identifier equals the one in the OPEN message,peer, andthis connection collides- changes its state to Active. If an Open is received with theconnection over which the OPEN messageBGP Delay Open timer isreceived thenrunning [Event 19], the localsystem performssystem: - clears the connect retry timer (cleared to zero), - completes thefollowing collision resolution procedure: 1. TheBGPIdentifier ofinitialization, - Stops and clears thelocal system is comparedBGP Open Delay timer - Sends an Open message - Set the hold timer to a large value (4 minutes), and - changes its state to Open Confirm. The start events [Event 1, 3-6] are ignored in connect state. A manual stop event[Event2], theBGP Identifier oflocal system: - drops theremote system (as specified inTCP connection, - releases all BGP resources, - sets ConnectRetryCnt (the connect retry count) to zero - resets theOPEN message). 2. Ifconnect retry timer (sets to zero), and - goes to Idle state. In response to thevalue ofconnect retry timer expired event(Event 9), the localBGP Identifier is less thansystem: - Sets theremote one,MIB FSM error information with connect retry expired, - drops thelocal system closes BGPTCP connectionthat already exists (the one that is already in- restarts theOpenConfirm state), and acceptsconnect retry timer - initiates a TCP connection to the other BGP peer, - continues to listen for a connection that may be initiated by the remotesystem. 3. Otherwise,BGP peer, and - stays in Connect state. In response to any other events [Events 7-8, 10-11, 18, 20- 27] the localsystem closes newly created BGP connection (the one associated withsystem: - resets thenewly received OPEN message), and continuesconnect retry timer (sets tousezero), - drops theexisting one (the one that is already inTCP connection, - release all BGP resources, - increments theOpenConfirm state). ComparingConnectRetryCnt (connect retry count) by 1, - [optionally] performs bgp peer oscillation damping, and - goes to Idle state. Active State: In this state BGPIdentifiersisdonetrying to acquire a peer bytreating them as (4-octet long) unsigned integers. Unless allowed via configuration,listening for and accepting aconnection collision with an existing BGP connection that is in Established state causes closing of the newly createdTCP connection.Note that aA TCP connectioncollision cannot be detected with connections that are in Idle, or Connect,succeeds [Event 15 orActive states. Closing the BGP connection (that results fromEvent 16], thecollision resolution procedure) is accomplished by sendinglocal system: process theNOTIFICATION message withTCP connection flags - If theError Code Cease. 7. BGP Version Negotiation.BGPspeakers may negotiatedelay open flag is set: o clears theversion ofconnect retry timer, o completes theprotocol by making multiple attempts to open aBGPconnection, starting withinitialization, and o sets thehighest version number each supports.BGP delay Open timer - Ifan open attempt fails with an Error Code OPEN Message Error, and an Error Subcode Unsupported Version Number, thenthe BGPspeaker has availabledelay open flag is not set: o clears theversion number it tried,connect retry timer, o completes theversion number its peer tried,BGP initialization, o sends theversion number passed byOpen message to it's peer, o sets itspeer in the NOTIFICATION message,hold timer to a large value, andthe version numbers that it supports.changes its state to OpenSent. A Hold timer value of 4 minutes is suggested. If thetwo peers do support one or more common versions, then this will allow them to rapidly determinelocal system receives a valid TCP Indication [Event 13], thehighest common version. In order to support BGP version negotiation, future versions of BGP must retainlocal system processes theformat ofTCP connection flags. If theOPEN and NOTIFICATION messages. 8. BGP Finite State machine. This section specifies BGP operation in terms oflocal system receives aFinite State Machine (FSM). FollowingTCP indication that isa brief summary and overview of BGP operations by state as determined byinvalid for thisFSM. Initially BGP is inconnection [Event 14]: - theIdle state. Idle state: A manual start event is a start event initiated by an operator. An automatic start eventTCP connection isa start event generated byrejected. If the local system receives a TCP connection failed [Event 17] (timeout or receives connection disconnect), thesystem. In this state BGP refuseslocal system will: - set TCP disconnect in the MIB reason code, - restart connect retry timer (with initial value) - release allincomingBGPconnections. Noresourcesare allocated to- Acknowledge thepeer. In response todrop of TCP connection if TCP disconnect (send aStart event (manual or automatic),FIN ACK), - Increment ConnectRetryCnt (connect retry count) by 1, and - perform the BGP peer oscillation damping process [2]. If the local system has the delay open timer expired [event 12] local system: -initializes all BGP resources, - startsclears theConnectRetry timer,connect retry timer (set to zero), -initiates a transport connectionstops and clears the delay open timer (set to zero) - completes theotherBGPpeer,initialization, -listens for a connection that may be initiated bysends the Open message to it's remoteBGPpeer,and-changessets its hold timer to a large value, - and set the state toconnect. The exactOpen Confirm. A hold timer value ofthe ConnectRetry timer4 minutes is also suggested for this state transition. If an Open isa local matter, but it should be sufficiently large to allow TCP initialization. Any other eventreceivedinwith theIDLE state,BGP delay open timer isignored. IdleHold state: The IdleHold state keepsrunning [Event 19], the local systemin "Idle" mode until a certain time period has passed or an operator intervenes- clears the connect retry timer (cleared tomanually restartzero), - stops and clears theconnection. This "IdleHold timeout" prevents persistent flapping of aBGPpeering session. Upon entering the Idle Hold state, if the IdleHoldTimer exceedsopen delay timer - completes thelocal limitBGP initialization, - stops and clears the"Keep Idle" flag is set. Upon receivingBGP open delay timer - sends an Open message - set its hold timer to aManual start,large value (4 minutes), and - changes its state to Open Confirm. In response the ConnectRetry timer expired event[Event9], the local system: -clears the IdleHoldtimer, - clears "keep Idle" flag - initializes all BGP resources, - startsrestarts theConnectRetry timer,connect retry timer (with initial value), - initiates atransportTCP connection to the other BGP peer, -listensContinues to listen foraTCP connection that may be initiated bytheremoteBGPPeer, andBGP peer, - and changes its state toconnect. Upon receiving a IdleHoldtimer expired event, the local system checks to see thatConnect. The start events [Event1, 3-6] are ignored in theKeep Idle flag is set. IfActive state. A manual stop event[Event2], theKeep Idle flag is set,local system: - Sets thesystem staysadministrative down in the"Idle Hold" state.MIB reason code, - Sends a Notification with a Cease, - If any BGP routes exist, delete the routes - release all BGP resources, - drops the TCP connection, - sets ConnectRetryCnt (connect retry count) to zero - resets theKeepconnect retry timer (sets to zero), - goes to Idleflag is not set,state. In response to any other event (Events 7-8, 10-11,18, 20- 27), the local system: -clearsstores theIdleHoldtimer,MIB information to indicate appropriate error [FSM for Events 7-8, 10-11, 18, 20-27] -and transitionsreset thestateconnect retry timer (sets toIdle. Getting out of the IdleHoldstate requires either operator intervention via a manual start orzero), - release all BGP resources, - drops theIdleHoldtimer to expire withTCP connection, - increments the"Keep Idle" flagConnectRetryCnt (connect retry count) by one, - optionally performs BGP peer oscillation damping, - and goes tobe clear. Any other event received intheIdleHoldidle stateis ignored. Connect State:Open Sent: In thisstate,state BGP waits for an Open Message from its peer. When an OPEN message iswaitingreceived, all fields are checked forthe transport protocol connection to be completed.correctness. If there are no errors in thetransport connection succeeds,OPEN message [Event 18] the local system: -clearsresets theConnectRetry timer,BGP Delay timer to zero, -completes initialization,reset BGP Connect Timer to zero, -send an Opensends a KEEPALIVE messageto its peer,and - sets a KeepAlive timer (via the text below) -setsets the Hold timer according toa large value,the negotiated value (see section 4.2), and -changes itssets the state to OpenSent. A hold timerConfirm. If the negotiated Hold time valueof 4 minutesissuggested.zero, then the Hold and KeepAlive timers are not started. If thetransport protocolvalue of the Autonomous System field is the same as the local Autonomous System number, then the connectionfails (e.g., retransmission timeout),is an "internal" connection; otherwise, it is an "external" connection. (This will impact UPDATE processing as described below.) If the BGP message header checking [Event20] or OPEN message check detects an error (see Section 6.2)[Event21], the local system: -restarts the ConnectRetry timer,sends a NOTIFICATION message with appropriate error code, -continuesreset the connect retry timer (sets tolisten for a connection that may be initiated byzero), - if there are any routes associated with theremoteBGPpeer, andsession, delete these routes -changes its state to Active. In response to the ConnectRetry timer expired event,release all BGP resources, - drop thelocal system:TCP connection -restartsincrements theConnectRetry timer,ConnectRetryCnt (connect retry cout) by 1, -initiates a transport connectionbgp peer oscillation damping process, - and goes to theotherIdle state. Collision detection mechanisms (section 6.8) need to be applied when a valid BGPpeer, - continuesOpen is received [Event 18 or Event 19]. Please refer tolistensection 6.8 fora connection that may be initiated bytheremotedetails of the comparison. An administrative collision detect is when BGPpeer, and - staysimplementation determines my means outside the scope of this document that a connection collision has occurred. If a connection inConnect state. The start event (manual or automatic)Open Sent isignored indetermined to be theConnect state. In responseconnection that must be closed, an administrative collision detect [Event 22] is signaled toany other event (initiated bythesystem or operator),state machine. If such an administrative collision detect dump [Event 22] is received in Open Sent, the local system: -IdleHoldtimer = 2**(ConnectRetryCnt)*60sets MIB state information to collision detect closure, -Increment ConnectRetryCnt by 1,send a NOTIFICATION with a CEASE -Setresets the connect retrytimer to zero, - Drops TCP connection,timer, -Releasesrelease all BGP resources,and-Goes to IdleHoldstate Active State: In this statedrop the TCP connection, - increments ConnectRetryCnt (connect rery count) by 1, - performs any BGPis trying to acquire apeerby listening foroscillation damp process, andaccepting a transport protocol connection.- enters Idle state. Ifthe transport connection succeeds,a NOTIFICATION message is received with a version error[Event23], Notification message without version number [Event 24], the local system: -clears the ConnectRetry timer, - completes the initialization, - sendsresets theOpen message to it's peer, - sets its Holdconnect retry timer (sets toa large value, - and changes its state to OpenSent. A Hold timer value of 4 minutes is suggested. In response the ConnectRetry timer expired event, the local system:zero) -restartsdrops theConnectRetry timer,TCP connection, -initiates a transport connection to the otherreleases all BGPpeer,resources, -continues to listen for connection that may be initiatedincrements the ConnectRetryCnt (connect retry count) byremote BGP peer,1 -and changes its state to Connect. If the local system does not allowprocess any BGPconnections with unconfigured peers, then the local system: - rejects connections from IP addresses that are not configured peers,peer oscillation damping, - andremains insets theActive state.state to Idle. ThestartStart events(initiated by the system or operator)[Event1, 3-6] are ignored in theActiveOpenSent state.In response to any otherIf a manual stop event(initiated by[Event 2] is issued in Open sent state, the local system: - Sets administrative down reason in MIB reason, - sends thesystem or operator),Notification with a cease, - if BGP routes exists, delete thelocal system:routes, -IdleHoldtimer = 2**(ConnectRetryCnt)*60Release all BGP resources, -Increment ConnectRetryCnt by 1,Drops the TCP connection, -Set connectset ConnectRetryCnt (connect retrytimercount) to zero,and - Drops TCP connection,-Releases all BGP resources,resets the Connect Retry timer (set to zero), and -Goestransitions toIdleHoldthe Idle state.Open Sent: In this state BGP waits for an Open Message from its peer. When an OPEN message is received, all fields are check for correctness.Ifthe BGP message header checking or OPEN message check detectsanerror (see Section 6.2), or a connection collision (see Section 6.8)automatic stop event [Event 7] is issued in Open sent state, the local system: - Sets administrative down reason in MIB reason, - sends the Notification with aNOTIFICATION messagecease, -IdleHoldtimer = 2**(ConnectRetryCnt)*60 - Increment ConnectRetryCnt by 1,if any routes are associated with te BGP session, delete the routes, -Set connect retry timer to zero, andrelease all the BGP resources - Drops the TCP connection, -Releases allincrements the ConnectRetryCnt (connect retry count) by 1, - BGPresources,peer oscillation process [2], and -Goestransitions toIdleHoldthe Idle state. Ifthere are no errors intheOPEN message,Hold Timer expires[Event 10], the local system: -sends a KEEPALIVE message andset Hold timer expired in MIB Error reason code, -setssend aKeepAlive timer (via the text below)NOTIFICATION message with error code Hold Timer Expired, -setreset theHoldconnect retry timeraccording(sets to zero), - releases all BGP resources, - drops thenegotiated value (see section 4.2),TCP connection, -setincrements thestateConnectRetryCnt (connect retry count) by 1, and transitions toOpen Confirm. Ifthenegotiated Hold time valueIdle state. If a TCP indication is received for valid connection [Event 13] or TCP request aknowledgement [Event 15] is received, or a TCP connect confirm [Event 16] is received a second TCP session may be in progress. This second TCP session iszero, then the Hold Time timer and KeepAlive timers are not started. If the value oftracked per theAutonomous System fieldCall Collision processing (section 6.8) until an OPEN message isthe same as the local Autonomous System number, then thereceived. A TCP connectionisfor an"internal" connection; otherwise, itinvalid port [Event 14] isan "external" connection. (This will impact UPDATE processing as described below.)ignored. If adisconnect NOTIFICATIONTCP connection failure [Event17], is receivedfrom the underlying transport protocol,the local system: - closes the BGP connection, - restarts the Connect Retry timer, - and continues to listen for a connection that may be initiated by the remote BGP peer, - and goes into Active state.If the Hold Timer expires,In response to any other event [Events 8-9, 11-12, 19, 25-27], the local system: -send asends the NOTIFICATIONmessagewitherror code Hold Timer Expired,the Error Code Finite state machine error, -IdleHoldtimer = 2**(ConnectRetryCnt)*60resets the connect retry timer (sets to zero), -Incrementreleases all BGP resources - drops the TCP connection, - increments the ConnectRetryCnt (connect retry count) by 1, -Set connect retry timerprocess any bgp peer oscillation damping[2], - and sets the state tozero,idle. Open Confirm State: In this state BGP waits for a KEEPALIVE or NOTIFICATION message. If the local system receives a KEEPALIVE message[Event 25], - restarts the Hold timer, and -Dropschanges its state to Established. If the local system receives a NOTIFICATION message [Event 23-24] or receives a TCPconnection,Disconnect [Event 17] from the underlying TCP , the local system: - sets the appropriate MIB information for FSM error, - resets the connect retry timer (sets the timer to zero), -Releasesreleases all BGP resources,and-Goesdrops the TCP connection, - increments the ConnectRetryCnt (connect retry count) by 1, - and sets the state toIdleHold state. The Startidle. Any start event(manual and automatic)[Event1, 3-6] is ignored in theOpenSentOpenConfirm state.If a NOTIFICATION message is received withIn response to aversion error,manual stop event[Event 2] initiated by the operator, the local system: -Closesset Administrative down in MIB Reason code, - sends thetransport connectionNOTIFICATION message with Cease, - if any BGP routes, dete the routes -Releasesreleases all BGP resources, -ConnectRetryCnt = 0, - Connect retry timer = 0, and - transition to Idle state. If any other NOTIFICATION is received,drop thelocal system: - IdleHoldtimer = 2**(ConnectRetryCnt)*60TCP connection, -Incrementsets the ConnectRetryCntby 1,(connect retry count) to zero -Setsets the connect retry timer to zero, and -Drops TCP connection, - Releases all BGP resources, - Goestransitions toIdleHoldIdle state. In response toany other event,the Automatic stop event initiated by the system[Event 7], the local system: - sets the MIB entry for this peer to administratively down, - sends theNOTFICATIONNOTIFICATION message withError Code Finite State Machine Error, - IdleHoldtimer = 2**(ConnectRetryCnt)*60 - Increment ConnectRetryCnt by 1,Cease, -Setconnect retry timer reset (set tozero,zero) -Drops TCP connection,If any BGP routes exist, delete the routes, -Releasesrelease all BGP resources, - drops the TCP connection, - increments the ConnectRetryCnt (connect retry count) by 1, and -Goestransitions toIdleHold state. Open Confirm State In this state BGP waits for a KEEPALIVE or NOTIFICATION message. Ifthelocal system receives a KEEPALIVE message, it changes its state to Established.Idle State. If the Hold Timer expires before a KEEPALIVE message isreceived,received [Event 10], the local system: - set the MIB reason to Hold time expired, - send the NOTIFICATION message with the error code set to HoldTimerTime Expired, -sets IdleHoldTimer = 2**(ConnectRetryCnt)*60 - Increments ConnectRetryCnt by 1, - Setsresets the connect retry timer (sets the timer tozero,to zero), - releases all BGP resources, -Dropdrops the TCP connection, -Releases all BGP resources,increments the ConnectRetryCnt (connect retry count) by 1, - and sets the state to Idle. If the local system receives a KEEPALIVE timer expires event [Event 11], the system: - sends a KEEPALIVE message, -Goesrestarts the Keepalive timer, and - remains in Open Confirmed state. In the event of TCP establishment [Event 13], or TCP connection succeeding [Event 15 or Event 16] while in Open Confirm, the local system needs to track the 2nd connection. If a TCP connection is attempted toIdleHoldState.an invalid port [Event 14], the local system will ignore the second connection attempt. If an OPEN message is received, all fields are check for correctness. If thelocal system receives a NOTIFICATIONBGP message header checking [Event20] orreceives a disconnect NOTIFICATION from the underlying transport protocol,OPEN message check detects an error (see Section 6.2)[Event21], the local system: -Sets IdleHold Timer = 2**(ConnectRetryCnt)*60 - Increments ConnectRetryCnt by 1,sends a NOTIFICATION message with appropriate error code, -Setsresets the connect retry timer (sets the timer tozero,zero), -Dropsreleases all BGP resources, - drops the TCP connection, -Releases allincrements the ConnectRetryCnt (connect retry count) by 1, - runs the BGPresources,peer oscillation damping process [2] -Goes to IdleHoldstate. In responseand goes to theStop event initiated byIdle state. If thesystem,Open messages is valid [Event 18], the collision detect function is processed per section 6.8. If this connection is to be dropped due to call collision, the local system: -sends the NOTIFICATION message with Cease, -setsIdleHoldtimer = 2**(ConnectRetryCnt)*60the Call Collision cease in the MIB reason code, -Increments ConnectRetryCnt by 1,sends a Notification with a Cease -Setsresets the Connectretrytimer (set tozero,zero), - releases all BGP resources, - Drops the TCPconnection,connection (send TCP FIN), -Releases all BGP resources,increments the ConnectRetryCnt by 1 (connect retry count), and -Goes to IdleHoldstate. In responseperforms any BGP peer oscillation damping process [2]. If during the processing of another Open message, the BGP implementation determines my means outside the scope of this document that a connection collision has occurred and this connection is to be closed, the local system will issue aStop event initiated bycall collision dump [Event 22]. When theoperator,local system receives a call collision dump event [Event 22], the local system: -sendsSets the MIB FSM variable to indicate collision detected and dump connection. - send a NOTIFICATIONmessagewithCease,a CEASE - deletes all routes associated with connection, - resets the connect retry timer, - releases all BGP resources -sets the ConnectRetryCnt to zerodrops all TCP connection, -setsincrements theconnectConnectRetryCnt (connect retrytimer to 0count) by 1, -transitions to Idle state. The Start event is ignored in the OpenConfirmand performs any BGP peer oscillation damping, and - enters Idle state. In response to any otherevent,event [Events 8-9, 12, 19, 26-27], the local system: - sends a NOTIFICATION with a code of Finite State Machine Error, -sets IdleHoldtimer = 2**(ConnectRetryCnt)*60 - Increments ConnectRetryCnt by 1, - Setsresets theConnectconnect retry timer (sets tozero,zero) -Dropsdrops the TCP connection, -Releasesreleases all BGP resources, -Goesincrements the ConnectRetryCnt (connect retrycount) by 1, - performs any BGP peer oscillation damping, and - transitions toIdleHoldstate.Idle state. Established State: In the Established state BGP can exchange UPDATE, NOTFICATION, and KEEPALIVE messages with its peer. If the local system receives an UPDATEor KEEPALIVE message, itmessage [Event26], the local system will: - process the update packet - restarts its HoldTimer,timer, if the negotiated Hold Time value isnon-zero.non-zero, and - remain in the Established state. If the local system receives a NOTIFICATION message [Event23 or Event24] or a disconnect [Event17] from the underlyingtransport protocol,TCP, it: - setsIdleHoldtimer = 2**(ConnectRetryCnt)*60,the appropriate error code in MIB reason code, -Increments ConnectRetryCnt by 1,if any BGP routes exist, delete all BGP routes, -Setsresets theConnectconnect retry timer (sets tozero,zero), -Dropsreleases all the BGP resources, - drops the TCP connection, -Releases all BGP resources,increments the ConnectRetryCnt (connect retry count) by 1, and -Goesgoes toIdleHoldstate.the Idle state. If the local system receives a Keepalive message [Event 25], the local system will: - restarts its Hold Timer, if the negotiated Hold Time value is non-zero, and - remain in the Established state. If the local system receives an UPDATE message, and the Update message error handling procedure (see Section 6.3)detecsdetects an error [Event27], the local system: - sends a NOTIFICATION message with Update error, - resets the connect retry timer (sets to zero), - drops the TCP connection, - releases all BGP resources, - increments the ConnectRetryCnt (connect retry count) by 1, - performs any BGP peer oscillation damping, - and goes to Idle state. Any start event (Event 1, 3-6) is ignored in the Established state. In response to a manual stop event (initiated by an operator)[Event2], the local sytem: - sets the Administrative stop in MIB reason code, - sends the NOTIFICATION message with Cease, - if BGP routes exist, delete the BGP routes, - release BGP resources, - drops TCP connection, - sets ConnectRetryCnt (connect retry count) to zero (0), - resets connect retry timer to zero (0), and - transitions to the Idle. In response to an automatic stop event initiated by the system (automatic) [Event7], the local system: - sets Administrative Stop in MIB Reason code, - sends a NOTIFICATIONmessagewithUpdate error, - sets IdleHoldtimer = 2**(ConnectRetryCnt)*60 - Increments ConnectRetryCnt by 1,Cease, -Setsresets theConnectconnect retry timer (sets tozero,zero) -Drops the TCPdeletes all routes associated with bgp connection, -Releasesreleases all BGP resources, - drops the TCP connection, - increments the ConnectRetryCnt (connect retry count) by 1, - performs any BGP peer oscillation damping, and -Goestransitions toIdleHoldstate.the idle state. An example automatic stop event is exceeding the number of prefixes for a given peer and the local system automatically disconnecting the peer. If the Hold timerexpires,expires [Event10], the local system: - sends a NOTIFICATION message with Error Code Hold Timer Expired, -sets IdleHoldtimer = 2**(ConnectRetryCnt)*60 - Increments ConnectRetryCnt by 1, - Setsresets the connect retry timer (sets tozero,zero), -Dropsreleases all BGP resources, - drops the TCP connection, -Releases allincrements the ConnectRetryCnt (connect retry count) by 1, - performs any BGPresources,peer oscillation damping, -Goesand goes toIdleHoldIdle state. If the KeepAlive timerexpires,expires [Event11], the local system sends a KEEPALIVE message, it restarts its KeepAlive timer, unless the negotiated Hold Time value is zero. Each time time the local system sends a KEEPALIVE or UPDATE message, it restarts its KeepAlive timer, unless the negotiated Hold Time value is zero. A TCP connection indication [Event 13] received for a valid port will cause the 2nd connection to be tracked. A TCP connection indications for invalid port [Event 14], will be ignored. In response to a TCP connection succeeds [Event 15 or Event 16], theStop event initiated by2nd connection shall be tracked until it sends an OPEN message. If a valid Open message [Event 18] is received, it will be checked to see if it collides (section 6.8) with any other session. If thesystem (automatic),BGP implementation determines that this connection needs to be terminated, it will process an Call Collision dump event[Event 22]. If this session needs to be terminated, thelocal system:connection will be terminated by: -sendssend a NOTIFICATION withCease, - sets IdleHoldtimer = 2**(ConnectRetryCnt)*60a CEASE -increments ConnectRetryCnt by 1,deletes all routes associated with connection, -setsresets the connect retrytimer to zero, - drops the TCP connection, - releases all BGP resources, - goes to IdleHold state, andtimer, -deletes all routes. An example automatic stop event is exceeding the number of prefixes for a given peer and the local system automatically disconnectingif any BGP routes, delete thepeer. In response to a stop event initiated by an operator:routes, - release allresources (including deleting all routes),BGP resources, -set ConnectRetryCnt to zero (0),drops the TCP connection, -set connectincrements ConnectRetryCnt (connect retrytimer to zero (0),count) by 1, - and performs any BGP peer oscillation damping, -transition to the Idle. The Start event is ignored inand enters theEstablished state.Idle state In response to any otherevent,event [Events 8-9,12, 19-21] the local system: - sends a NOTIFICATION message with Error Code Finite State Machine Error, -sets IdleHoldtimer = 2**(ConnectRetryCnt)*60 - increments ConnectRetryCnt by 1,deletes all routes associated with BGP connection, -setsresets the connect retry timer (sets tozero,zero) - releases all BGP resources, - drops the TCP connection, -releases all BGP resourcesincrements the ConnectRetryCnt (connect retry count) by 1, -goes to IdleHoldstate,performs any BGP peer oscillation damping, and -deletes all routes.transitions to Idle. 9. UPDATE Message Handling An UPDATE message may be received only in the Established state. When an UPDATE message is received, each field is checked forvalidityvalid- ity as specified in Section 6.3. If an optional non-transitive attribute is unrecognized, it isquietlyqui- etly ignored. If an optional transitive attribute is unrecognized, the Partial bit (the third high-order bit) in the attribute flags octet is set to 1, and the attribute is retained for propagation to other BGP speakers. If an optional attribute is recognized, and has a valid value, then, depending on the type of the optional attribute, it is processed locally, retained, and updated, if necessary, for possiblepropagationpropaga- tion to other BGP speakers. The information carried by the AS_PATH attribute is checked for AS loops. AS loop detection is done by scanning the full AS path (as specified in the AS_PATH attribute), and checking that the autonomous system number of the local system does not appear in the AS path. If the autonomous system number appears in the AS path the route may be stored in the Adj-RIB-In, but unless the router is configured to accept routes with its own autonomous system in the AS path, the route shall not be passed to the BGP Decision Process. Operations of a router that is configured to accept routes with its own autonomous system number in the AS path are outside the scope of this document. If the UPDATE message contains a non-empty WITHDRAWN ROUTES field, the previously advertised routes whose destinations (expressed as IP prefixes) contained in this field shall be removed from the Adj-RIB- In. This BGP speaker shall run its Decision Process since thepreviouslyprevi- ously advertised route is no longer available for use. If the UPDATE message contains a feasible route, the Adj-RIB-In will be updated with this route as follows: if the NLRI of the new route is identical to the one of the route currently stored in the Adj-RIB- In, then the new route shall replace the older route in the Adj-RIB- In, thus implicitly withdrawing the older route from service.Otherwise,Other- wise, if the Adj-RIB-In has no route with NLRI identical to the new route, the new route shall be placed in the Adj-RIB-In. Once the BGP speaker updates the Adj-RIB-In, the speaker shall run its Decision Process. 9.1 Decision Process The Decision Process selects routes for subsequent advertisement by applying the policies in the local Policy Information Base (PIB) to the routes stored in its Adj-RIBs-In. The output of the DecisionProcessPro- cess is the set of routes that will be advertised to all peers; the selected routes will be stored in the local speaker'sAdj-RIB- Out.Adj-RIB-Out. The selection process is formalized by defining a function that takes the attribute of a given route as an argument and returns either (a) a non-negative integer denoting the degree of preference for the route, or (b) a value denoting that this route is ineligible to be installed in LocRib and will be excluded from the next phase of route selection. The function that calculates the degree of preference for a given route shall not use as its inputs any of the following: the existence of other routes, the non-existence of other routes, or the path attributes of other routes. Route selection then consists ofindividualindivid- ual application of the degree of preference function to each feasible route, followed by the choice of the one with the highest degree of preference. The Decision Process operates on routes contained in the Adj-RIB-In, and is responsible for: - selection of routes to be used locally by the speaker - selection of routes to be advertised to other BGP peers - route aggregation and route information reduction The Decision Process takes place in three distinct phases, eachtriggeredtrig- gered by a different event: a) Phase 1 is responsible for calculating the degree of preference for each route received from a peer. b) Phase 2 is invoked on completion of phase 1. It is responsible for choosing the best route out of all those available for each distinct destination, and for installing each chosen route into the Loc-RIB. c) Phase 3 is invoked after the Loc-RIB has been modified. It is responsible for disseminating routes in the Loc-RIB to each peer, according to the policies contained in the PIB. Route aggregation and information reduction can optionally be performed within this phase. 9.1.1 Phase 1: Calculation of Degree of Preference The Phase 1 decision function shall be invoked whenever the local BGP speaker receives from a peer an UPDATE message that advertises a new route, a replacement route, or withdrawn routes. The Phase 1 decision function is a separate process which completes when it has no further work to do. The Phase 1 decision function shall lock an Adj-RIB-In prior tooperatingoper- ating on any route contained within it, and shall unlock it after operating on all new or unfeasible routes contained within it. For each newly received or replacement feasible route, the local BGP speaker shall determine a degree of preference as follows: If the route is learned from an internal peer, either the value of the LOCAL_PREF attribute shall be taken as the degree ofpreference,prefer- ence, or the local system may compute the degree of preference of the route based on preconfigured policy information. Note that the latter (computing the degree of preference based on preconfigured policy information) may result in formation of persistent routing loops. If the route is learned from an external peer, then the local BGP speaker computes the degree of preference based on preconfigured policy information. If the return value indicates that the route is ineligible, the route may not serve as an input to the next phase of route selection; otherwise the return value is used as the LOCAL_PREF value in any IBGP readvertisement. The exact nature of this policy information and the computation involved is a local matter. 9.1.2 Phase 2: Route Selection The Phase 2 decision function shall be invoked on completion of Phase 1. The Phase 2 function is a separate process which completes when it has no further work to do. The Phase 2 process shall consider all routes that are eligible in the Adj-RIBs-In. The Phase 2 decision function shall be blocked from running while the Phase 3 decision function is in process. The Phase 2 function shall lock all Adj-RIBs-In prior to commencing its function, and shall unlock them on completion. If the NEXT_HOP attribute of a BGP route depicts an address that is not resolvable, or it would become unresolvable if the route was installed in the routing table the BGP route should be excluded from the Phase 2 decision function. It is critical that routers within an AS do not make conflicting decisions regarding route selection that would cause forwarding loops to occur. For each set of destinations for which a feasible route exists in the Adj-RIBs-In, the local BGP speaker shall identify the route that has: a) the highest degree of preference of any route to the same set of destinations, or b) is the only route to that destination, or c) is selected as a result of the Phase 2 tie breaking rulesspecifiedspec- ified in 9.1.2.2. The local speaker SHALL then install that route in the Loc-RIB, replacing any route to the same destination that is currently being held in the Loc-RIB.IfWhen the new BGP route is installed in theRouting Table (as a result of the local policy decision),Rout- ing Table, care must be taken to ensure thatinvalid BGPexisting routes to the same destination that are now considered invalid are removed from the Routing Table. Whether or not the new BGP route replaces analreadyexisting non-BGP route in therouting tableRouting Table depends on the policy configured on the BGP speaker. The local speaker MUST determine the immediatenext hop to thenext-hop addressdepicted byfrom the NEXT_HOP attribute of the selected routeby performing a best matching route lookup in the Routing Table and selecting one of the possible paths (if multiple best paths to the same prefix are available).(see section 5.1.3). Ifthe route to the address depicted by the NEXT_HOP attribute changes such thateither the immediate next hop or the IGP cost to the NEXT_HOP(if(where the NEXT_HOP is resolved through an IGP route) changes,route selectionPhase 2: Route Selection should berecalculated as specified above.performed again. Notice that even though BGP routes do not have to be installed in the Routing Table with the immediate next hop(s), implementations must take care that before any packets are forwarded along a BGP route, its associated NEXT_HOP address is resolved to the immediate (directly connected) next-hop address and this address (or multiple addresses) is finally used for actual packet forwarding. Unresolvable routes SHALL be removed from the Loc-RIB and the routing table. However, corresponding unresolvable routes SHOULD be kept in theAdj-RIBs-In.Adj-RIBs-In (in case they become resolvable). 9.1.2.1 Route Resolvability Condition As indicated in Section 9.1.2, BGP routers should excludeunresolvableunresolv- able routes from the Phase 2 decision. This ensures that only valid routes are installed in Loc-RIB and the Routing Table. The route resolvability condition is defined as follows. 1. A route Rte1, referencing only the intermediate network address, is considered resolvable if the Routing Table contains at least one resolvable route Rte2 that matches Rte1's intermediate network address and is not recursively resolved (directly orindirectly)indi- rectly) through Rte1. If multiple matching routes are available, only the longest matching route should be considered. 2. Routes referencing interfaces (with or without intermediate addresses) are considered resolvable if the state of thereferencedrefer- enced interface is up and IP processing is enabled on thisinterface.inter- face. BGP routes do not refer to interfaces, but can be resolved through the routes in the Routing Table that can be of bothtypes.types (those that specify interfaces or those that do not). IGP routes and routes to directly connected networks are expected to specify the outbound interface. Static routes can specify the outbound interface, or the intermediate address, or both. Note that a BGP route is considered unresolvable not only insituationssitua- tions where the router's Routing Table contains no route matching the BGP route's NEXT_HOP. Mutually recursive routes (routes resolving each other or themselves), also fail the resolvability check. It is also important that implementations do not consider feasible routes that would become unresolvable if they were installed in the Routing Table even if their NEXT_HOPs are resolvable using thecurrentcur- rent contents of the Routing Table (an example of such routes would be mutually recursive routes). This check ensures that a BGP speaker does not install in the Routing Table routes that will be removed and not used by the speaker. Therefore, in addition to local Routing Table stability, this check also improves behavior of the protocol in the network. Whenever a BGP speaker identifies a route that fails theresolvabilityresolvabil- ity check because of mutual recursion, an error message should be logged. 9.1.2.2 Breaking Ties (Phase 2) In its Adj-RIBs-In a BGP speaker may have several routes to the same destination that have the same degree of preference. The local speaker can select only one of these routes for inclusion in the associated Loc-RIB. The local speaker considers all routes with the same degrees of preference, both those received from internal peers, and those received from external peers. The following tie-breaking procedure assumes that for each candidate route all the BGP speakers within an autonomous system can ascertain the cost of a path (interior distance) to the address depicted by the NEXT_HOP attribute of the route, and follow the same route selection algorithm. The tie-breaking algorithm begins by considering all equallypreferableprefer- able routes to the same destination, and then selects routes to be removed from consideration. The algorithm terminates as soon as only one route remains in consideration. The criteria must be applied in the order specified. Several of the criteria are described using pseudo-code. Note that the pseudo-code shown was chosen for clarity, not efficiency. It is not intended to specify any particular implementation. BGPimplementationsimplemen- tations MAY use any algorithm which produces the same results as those described here. a) Remove from consideration all routes which are not tied for having the smallest number of AS numbers present in their AS_PATH attributes. Note, that when counting this number, an AS_SET counts as 1, no matter how many ASs are in theset, and that, if the implementation supports [13], then AS numbers present in segments of type AS_CONFED_SEQUENCE or AS_CONFED_SET are not included in the count of AS numbers present in the AS_PATH.set. b) Remove from consideration all routes which are not tied for having the lowest Origin number in their Origin attribute. c) Remove from consideration routes with less-preferred MULTI_EXIT_DISC attributes. MULTI_EXIT_DISC is only comparable between routes learned from the same neighboring AS. Routes which do not have the MULTI_EXIT_DISC attribute are considered to have the lowest possible MULTI_EXIT_DISC value. This is also described in the following procedure: for m = all routes still under consideration for n = all routes still under consideration if (neighborAS(m) == neighborAS(n)) and (MED(n) < MED(m)) remove route m from consideration In thepseudo-code above, MED(n) is a function which returnspseudo-code above, MED(n) is a function which returns the value of route n's MULTI_EXIT_DISC attribute. If route n has no MULTI_EXIT_DISC attribute, the function returns the lowest possi- ble MULTI_EXIT_DISC value, i.e. 0. Similarly, neighborAS(n) is a function which returns the neighbor AS from which the route was received. If the route is learned via IBGP, and the other IBGP speaker didn't originate the route, it is the neighbor AS from which the other IBGP speaker learned the route. If the route is learned via IBGP, and the other IBGP speaker originated the route, it is the local AS. If a MULTI_EXIT_DISC attribute is removed before re-advertising a route into IBGP, the MULTI_EXIT_DISC attribute may only be consid- ered in the comparison of EBGP learned routes, then removed, then the remaining EBGP learned route may be compared to the remaining IBGP learned routes, without considering the MULTI_EXIT_DISC attribute for those EBGP learned routes whose MULTI_EXIT_DISC will be dropped before advertising to IBGP. Including thevalue of route n'sMULTI_EXIT_DISCattribute. Ifof an EBGP learned routen has no MULTI_EXIT_DISC attribute,in thefunction returnscomparison with an IBGP learned route, then dropping thelowest possibleMULTI_EXIT_DISCvalue, i.e. 0. Similarly, neighborAS(n) is a function which returns the neighbor AS from whichand adver- tising the routewas received.has been proven to cause route loops. d) If at least one of the candidate routes was received from an external peer in a neighboring autonomous system, remove fromconsiderationcon- sideration all routes which were received from internal peers. e) Remove from consideration any routes with less-preferredinteriorinte- rior cost. The interior cost of a route is determined bycalculatingcalcu- lating the metric to thenext hopNEXT_HOP for the route using the Routing Table. If thenextNEXT_HOP hop for a route is reachable, but no cost can be determined, then this step should be skipped (equivalently, consider all routes to have equal costs). This is also described in the following procedure. for m = all routes still under consideration for n = all routes in still under consideration if (cost(n) is better than cost(m)) remove m from consideration In the pseudo-code above, cost(n) is a function which returns the cost of the path (interior distance) to the address given in the NEXT_HOP attribute of the route. f) Remove from consideration all routes other than the route that was advertised by the BGP speaker whose BGP Identifier has the lowest value. g) Prefer the route received from the lowest neighbor address. 9.1.3 Phase 3: Route Dissemination The Phase 3 decision function shall be invoked on completion of Phase 2, or when any of the following events occur: a) when routes in the Loc-RIB to local destinations have changed b) when locally generated routes learned by means outside of BGP have changed c) when a new BGP speaker - BGP speaker connection has beenestablishedestab- lished The Phase 3 function is a separate process which completes when it has no further work to do. The Phase 3 Routing Decision function shall be blocked from running while the Phase 2 decision function is in process. All routes in the Loc-RIB shall be processed into Adj-RIBs-Out according to configured policy. This policy may exclude a route in the Loc-RIB from being installed in a particular Adj-RIB-Out. A route shall not be installed in the Adj-Rib-Out unless thedestinationdestina- tion and NEXT_HOP described by this route may be forwardedappropriatelyappropri- ately by the Routing Table. If a route in Loc-RIB is excluded from a particular Adj-RIB-Out the previously advertised route in thatAdj-RIB-OutAdj- RIB-Out must be withdrawn from service by means of an UPDATE message (see 9.2). Route aggregation and information reduction techniques (see 9.2.2.1) may optionally be applied. Any local policy which results in routes being added to an Adj-RIB- Out without also being added to the local BGP speaker's forwarding table, is outside the scope of this document. When the updating of the Adj-RIBs-Out and the Routing Table iscomplete,com- plete, the local BGP speaker shall run the Update-Send process of 9.2. 9.1.4 Overlapping Routes A BGP speaker may transmit routes with overlapping Network Layer Reachability Information (NLRI) to another BGP speaker. NLRI overlap occurs when a set of destinations are identified in non-matchingmultiplemul- tiple routes. Since BGP encodes NLRI using IP prefixes, overlap will always exhibit subset relationships. A route describing a smaller set of destinations (a longer prefix) is said to be more specific than a route describing a larger set of destinations (ashorted prefix);shorter pre- fix); similarly, a route describing a larger set of destinations(a shorter prefix)is said to be less specific than a route describing a smaller set ofdestinations (a longer prefix).destinations. The precedence relationship effectively decomposes less specific routes into two parts: - a set of destinations described only by the less specific route, and - a set of destinations described by the overlap of the lessspecificspe- cific and the more specific routes When overlapping routes are present in the same Adj-RIB-In, the more specific route shall take precedence, in order from more specific to least specific. The set of destinations described by the overlap represents a portion of the less specific route that is feasible, but is not currently in use. If a more specific route is later withdrawn, the set ofdestinationsdesti- nations described by the overlap will still be reachable using the less specific route. If a BGP speaker receives overlapping routes, the Decision Process MUST consider both routes based on the configured acceptance policy. If both a less and a more specific route are accepted, then theDecisionDeci- sion Process MUST either install both the less and the more specific routes or it MUST aggregate the two routes and install the aggregated route, provided that both routes have the same value of the NEXT_HOP attribute. If a BGP speaker chooses to aggregate, then itMUSTSHOULD either include all AS used to form the aggreagate in an AS_SET or add the ATOMIC_AGGREGATE attribute to the route. This attribute is now pri- marily informational. With the elimination of IP routing protocols that do not support classless routing and the elimination of router and host implementations that do not support classless routing, there is no longer a need to deaggregate. Routes SHOULD NOT be de-aggre- gated. A route that carries ATOMIC_AGGREGATE attributecan notin particular MUST NOT be de-aggregated. That is, the NLRI of this route can not be made more specific. Forwarding along such a route does not guarantee that IP packets will actually traverse only ASs listed in the AS_PATH attribute of the route. 9.2 Update-Send Process The Update-Send process is responsible for advertising UPDATEmessagesmes- sages to all peers. For example, it distributes the routes chosen by the Decision Process to other BGP speakers which may be located in either the same autonomous system or a neighboring autonomous system. When a BGP speaker receives an UPDATE message from an internal peer, the receiving BGP speaker shall not re-distribute the routinginformationinfor- mation contained in that UPDATE message to other internal peers, unless the speaker acts as a BGP Route Reflector[11].[RFC2796]. As part of Phase 3 of the route selection process, the BGP speaker has updated its Adj-RIBs-Out. All newly installed routes and all newly unfeasible routes for which there is no replacement route shall be advertised to its peers by means of an UPDATE message. A BGP speaker should not advertise a given feasible BGP route from its Adj-RIB-Out if it would produce an UPDATE message containing the same BGP route as was previously advertised. Any routes in the Loc-RIB marked as unfeasible shall be removed. Changes to the reachable destinations within its own autonomoussystemsys- tem shall also be advertised in an UPDATE message. If due to the limits on the maximum size of an UPDATE message (see Section 4) a single route doesn't fit into the message, the BGP speaker MUST not advertise the route to its peers and MAY choose to log an error locally. 9.2.1 Controlling Routing Traffic Overhead The BGP protocol constrains the amount of routing traffic (that is, UPDATE messages) in order to limit both the link bandwidth needed to advertise UPDATE messages and the processing power needed by the Decision Process to digest the information contained in the UPDATE messages. 9.2.1.1 Frequency of Route Advertisement The parameter MinRouteAdvertisementInterval determines the minimum amount of time that must elapse between advertisement and/or with- drawal of routes to a particular destinationfromby asingleBGPspeaker.speaker to a peer. This rate limiting procedure applies on a per-destination basis, although the value of MinRouteAdvertisementInterval is set on a per BGP peer basis. Two UPDATE messages sentfromby asingleBGP speaker to a peer that advertise feasible routes and/or withdrawal of unfeasible routes to some commonset of destinations received from external peers mustset of destinations MUST be separated by at leastMinRouteAdvertisementInterval.MinRouteAdvertise- mentInterval. Clearly, this can only be achieved precisely by keeping a separate timer for each common set of destinations. This would be unwarranted overhead. Any technique which ensures that the interval between two UPDATE messages sent from asingleBGP speaker to a peer that advertise feasible routes and/or withdrawal of unfeasible routes to some common set of destinationsreceived from external peerswill be at leastMinRouteAdvertisementInterval,MinRouteAdvertise- mentInterval, and will also ensure a constant upper bound on the interval is acceptable. Since fast convergence is needed within an autonomous system,this procedure does not applyeither (a) the MinRouteAdvertisementInterval used forroutes received from otherinternalpeers. To avoid long-lived black holes,peers SHOULD be shorter than the MinRouteAdvertisementInterval used for external peers, or (b) the proceduredoes notdescribe in this section SHOULD NOT applyto the explicit withdrawal of unfeasible routes (that is,for routeswhose destinations (expressed as IP prefixes) are listed in the WITHDRAWN ROUTES field of an UPDATE message).sent to internal peers. This procedure does not limit the rate of route selection, but only the rate of route advertisement. If new routes are selected multiple times while awaiting the expiration of MinRouteAdvertisementInterval, the last route selectedshallSHALL be advertised at the end ofMinRouteAdvertisementInterval.MinRouteAd- vertisementInterval. 9.2.1.2 Frequency of Route Origination The parameter MinASOriginationInterval determines the minimum amount of time that must elapse between successive advertisements of UPDATE messages that report changes within the advertising BGP speaker's own autonomous systems.9.2.1.3 Jitter To minimize the likelihood that the distribution of BGP messages by a given BGP speaker will contain peaks, jitter should be applied to the timers associated with MinASOriginationInterval, Keepalive, and MinRouteAdvertisementInterval. A given BGP speaker shall apply the same jitter to each of these quantities regardless of the destinations to which the updates are being sent; that is, jitter will not be applied on a "per peer" basis. The amount of jitter to be introduced shall be determined by multiplying the base value of the appropriate timer by a random factor which is uniformly distributed in the range from 0.75 to 1.0.9.2.2 Efficient Organization of Routing Information Having selected the routing information which it will advertise, a BGP speaker may avail itself of several methods to organize this information in an efficient manner. 9.2.2.1 Information Reduction Information reduction may imply a reduction in granularity of policy control - after information is collapsed, the same policies will apply to all destinations and paths in the equivalence class. The Decision Process may optionally reduce the amount of information that it will place in the Adj-RIBs-Out by any of the followingmethods:meth- ods: a) Network Layer Reachability Information (NLRI): Destination IP addresses can be represented as IP addressprefixes.pre- fixes. In cases where there is a correspondence between the address structure and the systems under control of an autonomous system administrator, it will be possible to reduce the size of the NLRI carried in the UPDATE messages. b) AS_PATHs: AS path information can be represented as ordered AS_SEQUENCEs or unordered AS_SETs. AS_SETs are used in the route aggregationalgorithmalgo- rithm described in 9.2.2.2. They reduce the size of the AS_PATH information by listing each AS number only once, regardless of how many times it may have appeared in multiple AS_PATHs that were aggregated. An AS_SET implies that the destinations listed in the NLRI can be reached through paths that traverse at least some of theconstituentcon- stituent autonomous systems. AS_SETs provide sufficientinformationinforma- tion to avoid routing information looping; however their use may prune potentially feasible paths, since such paths are no longer listed individually as in the form of AS_SEQUENCEs. In practice this is not likely to be a problem, since once an IP packet arrives at the edge of a group of autonomous systems, the BGP speaker at that point is likely to have more detailed pathinformationinfor- mation and can distinguish individual paths to destinations. 9.2.2.2 Aggregating Routing Information Aggregation is the process of combining the characteristics ofseveralsev- eral different routes in such a way that a single route can beadvertised.adver- tised. Aggregation can occur as part of the decision process to reduce the amount of routing information that will be placed in the Adj-RIBs-Out. Aggregation reduces the amount of information that a BGP speaker must store and exchange with other BGP speakers. Routes can be aggregated by applying the following procedure separately to path attributes of like type and to the Network Layer Reachability Information. Routes that havethe following attributes shall not be aggregated unless the corresponding attributes of each route are identical: MULTI_EXIT_DISC, NEXT_HOP. If the aggregation occurs as part of the update process, routes withdifferentNEXT_HOP values canMULTI_EXIT_DISC attribute SHALL NOT beaggregated when announced through an external BGP session.aggregated. Path attributes that have different type codes can not be aggregated together. Path attributes of the same type code may be aggregated, according to thefollowing rules:following rules: NEXT_HOP: When aggregating routes that have different NEXT_HOP attribute, the NEXT_HOP attribute of the aggregated route SHALL identify an interface on the router that performs the aggregation. ORIGIN attribute: If at least one route among routes that are aggregated hasORIGINORI- GIN with the value INCOMPLETE, then the aggregated route must have the ORIGIN attribute with the value INCOMPLETE.Otherwise,Other- wise, if at least one route among routes that are aggregated has ORIGIN with the value EGP, then the aggregated route must have the origin attribute with the value EGP. In all other case the value of the ORIGIN attribute of the aggregated route is IGP. AS_PATH attribute: If routes to be aggregated have identical AS_PATH attributes, then the aggregated route has the same AS_PATH attribute as each individual route. For the purpose of aggregating AS_PATH attributes we model each AS within the AS_PATH attribute as a tuple <type, value>, where "type" identifies a type of the path segment the AS belongs to (e.g. AS_SEQUENCE, AS_SET), and "value" is the AS number. If the routes to be aggregated have different AS_PATH attributes, then the aggregated AS_PATH attribute shall satisfy all of the following conditions: - all tuples of type AS_SEQUENCE in the aggregated AS_PATH shall appear in all of the AS_PATH in the initial set of routes to be aggregated. - all tuples of type AS_SET in the aggregated AS_PATH shall appear in at least one of the AS_PATH in the initial set (they may appear as either AS_SET or AS_SEQUENCE types). - for any tuple X of type AS_SEQUENCE in the aggregated AS_PATH which precedes tuple Y in the aggregated AS_PATH, X precedes Y in each AS_PATH in the initial set which contains Y, regardless of the type of Y. - No tuple of type AS_SET with the same value shall appear more than once in the aggregated AS_PATH. - Multiple tuples of type AS_SEQUENCE with the same value may appear in the aggregated AS_PATH only when adjacent to another tuple of the same type and value. An implementation may choose any algorithm which conforms to these rules. At a minimum a conformant implementation shall be able to perform the following algorithm that meets all of the above conditions: - determine the longest leading sequence of tuples (as defined above) common to all the AS_PATH attributes of the routes to be aggregated. Make this sequence the leading sequence of the aggregated AS_PATH attribute. - set the type of the rest of the tuples from the AS_PATH attributes of the routes to be aggregated to AS_SET, and append them to the aggregated AS_PATH attribute. - if the aggregated AS_PATH has more than one tuple with the same value (regardless of tuple's type), eliminate all, but one such tuple by deleting tuples of the type AS_SET from the aggregated AS_PATH attribute. - for each pair of adjacent tuples in the aggregated AS_PATH, if both tuples have the same type, merge them together, as long as doing so will not cause a segment with length greater than 255 to be generated. Appendix6,F, section6.8F.6 presents another algorithm thatsatisfiessatis- fies the conditions and allows for more complex policyconfigurations.configu- rations. ATOMIC_AGGREGATE: If at least one of the routes to be aggregated has ATOMIC_AGGREGATE path attribute, then the aggregated route shall have this attribute as well. AGGREGATOR: All AGGREGATOR attributes of all routes to be aggregated should be ignored. The BGP speaker performing the route aggregation may attach a new AGGREGATOR attribute (see Section 5.1.7). 9.3 Route Selection Criteria Generally speaking, additional rules for comparing routes amongseveralsev- eral alternatives are outside the scope of this document. There are two exceptions: - If the local AS appears in the AS path of the new route being considered, then that new routecannotcan not be viewed as better than any other route (provided that the speaker is configured to accept such routes). If such a route were ever used, a routing loop could result (see Section 6.3). - In order to achieve successful distributed operation, only routes with a likelihood of stability can be chosen. Thus, an AS must avoid using unstable routes, and it must not make rapidspontaneousspon- taneous changes to its choice of route. Quantifying the terms "unstable" and "rapid" in the previous sentence will requireexperience,expe- rience, but the principle is clear. Care must be taken to ensure that BGP speakers in the same AS do not make inconsistent decisions. 9.4 Originating BGP routes A BGP speaker may originate BGP routes by injecting routinginformationinforma- tion acquired by some other means (e.g. via an IGP) into BGP. A BGP speaker that originates BGP routes shall assign the degree ofpreferenceprefer- ence to these routes by passing them through the Decision Process (see Section 9.1). These routes may also be distributed to other BGP speakers within the local AS as part of the update process (seeSectionSec- tion 9.2). The decision whether to distribute non-BGP acquired routes within an AS via BGP or not depends on theenvironment withinenvironment within the AS (e.g. type of IGP) and should be controlled via configuration. 10 BGP Timers BGP employs five timers: ConnectRetry (see Section 8), Hold Time (see Section 4.2), KeepAlive (see Section 8), MinASOriginationInterval (see Section 9.2.1.2), and MinRouteAdvertisementInterval (see Section 9.2.1.1). The suggested default value for the ConnectRetry timer is 120 sec- onds. The suggested default value for the Hold Time is 90 seconds. The suggested default value for the KeepAlive timer is 1/3 of the Hold Time. The suggested default value for the MinASOriginationInterval is 15 seconds. The suggested default value for the MinRouteAdvertisementInterval is 30 seconds. An implementation of BGP MUST allow the Hold Time timer to be config- urable on a per peer basis, and MAY allow the other timers to be con- figurable. To minimize the likelihood that the distribution of BGP messages by a given BGP speaker will contain peaks, jitter should be applied to the timers associated with MinASOriginationInterval, KeepAlive, Min- RouteAdvertisementInterval, and ConnectRetry. A given BGP speaker may apply the same jitter to each of these quantities regardless of the destinations to which the updates are being sent; that is, jitter need not be configured on a "per peer" basis. The suggested default amount of jitter shall be determined by multi- plying the base value of the appropriate timer by a random factor which is uniformly distributed in theAS (e.g. type of IGP) andrange from 0.75 to 1.0. A new random value should becontrolled via configuration.picked each time the timer is set. The range of the jitter random value MAY be configurable. Appendix1.A. Comparison with RFC1771 There are numerous editorial changes (too many to list here). The following list the technical changes: Changes to reflect the usages of such features as TCP MD5[10],[RFC2385], BGP Route Reflectors[11],[RFC2796], BGP Confederations[13],[RFC3065], and BGP Route Refresh[12].[RFC2918]. Clarification on the use of the BGP Identifier in the AGGREGATOR attribute. Procedures for imposing an upper bound on the number of prefixes that a BGP speaker would accept from a peer. The ability of a BGP speaker to include more than one instance of its own AS in the AS_PATH attribute for the purpose of inter-AS traffic engineering. Clarifications on the various types of NEXT_HOPs. Clarifications to the use of the ATOMIC_AGGREGATE attribute. The relationship between the immediate next hop, and the next hop as specified in the NEXT_HOP path attribute. Clarifications on the tie-breaking procedures. Clarifications on the frequency of route advertisements. Optional Parameter Type 1 (Authentication Information) has been deprecated. UPDATE Message Error subcode 7 (AS Routing Loop) has been depre- cated. Use of the Marker field for authentication has been deprecated. Appendix2.B. Comparison with RFC1267 All the changes listed in Appendix1,A, plus the following. BGP-4 is capable of operating in an environment where a set ofreachablereach- able destinations may be expressed via a single IP prefix. Theconceptcon- cept of network classes, or subnetting is foreign to BGP-4. To accommodate these capabilities BGP-4 changes semantics and encoding associated with the AS_PATH attribute. New text has been added to define semantics associated with IP prefixes. These abilities allow BGP-4 to support the proposed supernetting scheme [9]. To simplify configuration this version introduces a new attribute, LOCAL_PREF, that facilitates route selection procedures. The INTER_AS_METRIC attribute has been renamed to be MULTI_EXIT_DISC. A new attribute, ATOMIC_AGGREGATE, has been introduced to insure that certain aggregates are not de-aggregated. Another new attribute, AGGREGATOR, can be added to aggregate routes in order to advertise which AS and which BGP speaker within that AS caused the aggregation. To insure that Hold Timers are symmetric, the Hold Time is nownegotiatednego- tiated on a per-connection basis. Hold Times of zero are nowsupported.sup- ported. Appendix3.C. Comparison with RFC 1163 All of the changes listed in Appendices1A and2,B, plus the following. To detect and recover from BGP connection collision, a new field (BGP Identifier) has been added to the OPEN message. New text (Section 6.8) has been added to specify the procedure for detecting andrecoveringrecov- ering from collision. The new document no longer restricts the border router that is passed in the NEXT_HOP path attribute to be part of the same AutonomousSystemSys- tem as the BGP Speaker. New document optimizes and simplifies the exchange of the information about previously reachable routes. Appendix4.D. Comparison with RFC 1105 All of the changes listed in Appendices1, 2A, B and3,C, plus thefollowing.follow- ing. Minor changes to the RFC1105 Finite State Machine were necessary to accommodate the TCP user interface provided by 4.3 BSD. The notion of Up/Down/Horizontal relations present in RFC1105 has been removed from the protocol. The changes in the message format from RFC1105 are as follows: 1. The Hold Time field has been removed from the BGP header and added to the OPEN message. 2. The version field has been removed from the BGP header and added to the OPEN message. 3. The Link Type field has been removed from the OPEN message. 4. The OPEN CONFIRM message has been eliminated and replaced with implicit confirmation provided by the KEEPALIVE message. 5. The format of the UPDATE message has been changedsignificantly.signifi- cantly. New fields were added to the UPDATE message to support multiple path attributes. 6. The Marker field has been expanded and its role broadened to support authentication. Note that quite often BGP, as specified in RFC 1105, is referred to as BGP-1, BGP, as specified in RFC 1163, is referred to as BGP-2, BGP, as specified in RFC1267 is referred to as BGP-3, and BGP, as specified in this document is referred to as BGP-4. Appendix5.E. TCP options that may be used with BGP If a local system TCP user interface supports TCP PUSH function, then each BGP message should be transmitted with PUSH flag set. Setting PUSH flag forces BGP messages to be transmitted promptly to the receiver. If a local system TCP user interface supports setting precedence for TCP connection, thenthe BGP transportTCP connection used by BGP should be opened with precedence set to Internetwork Control (110) value (see also[6]).[RFC791]). A local system may protect its BGPsessionsconnections by using the TCP MD5 Signature Option[10].[RFC2385]. Appendix6.F. Implementation Recommendations This section presents some implementation recommendations.6.1Appendix F.1 Multiple Networks Per Message The BGP protocol allows for multiple address prefixes with the same path attributes to be specified in one message. Making use of this capability is highly recommended. With one address prefix per message there is a substantial increase in overhead in the receiver. Not only does the system overhead increase due to the reception of multiple messages, but the overhead of scanning the routing table for updates to BGP peers and other routing protocols (and sending the associated messages) is incurred multiple times as well. One method of building messages containing many address prefixes per a path attribute set from a routing table that is not organized on a per path attribute set basis is to build many messages as the routing table is scanned. As each address prefix is processed, a message for the associated set of path attributes is allocated, if it does not exist, and the new address prefix is added to it. If such a message exists, the new address prefix is just appended to it. If the message lacks the space to hold the new address prefix, it is transmitted, a new message is allocated, and the new address prefix is inserted into the new message. When the entire routing table has been scanned, all allocated messages are sent and their resources released. Maximum compression is achieved when all the destinations covered by the address prefixes share a common set of path attributes making itpossiblepos- sible to send many address prefixes in one 4096-byte message. When peering with a BGP implementation that does not compressmultiplemulti- ple address prefixes into one message, it may be necessary to take steps to reduce the overhead from the flood of data received when a peer is acquired or a significant network topologychange occurs. One method of doing this is to limit the rate of updates. This will eliminate the redundant scanning of the routing table to provide flash updates for BGP peers and other routing protocols. A disadvantage of this approach is that it increases the propagation latency of routing information. By choosing a minimum flash update interval that is not much greater than the time it takes to process the multiple messages this latency should be minimized. A better method would be to read all received messages before sending updates. 6.2 Processing Messages on a Stream Protocol BGP uses TCP as a transport mechanism. Due to the stream nature of TCP, all the data for received messages does not necessarily arrive at the same time. This can make it difficult to process the data as messages, especially on systems such as BSD Unix where it is not possible to determine how much data has been received but not yet processed.change occurs. One methodthat can be used inof doing thissituationis tofirst try to read justlimit themessage header. Forrate of updates. This will elim- inate theKEEPALIVE message type, this is a complete message;redundant scanning of the routing table to provide flash updates for BGP peers and othermessage types, the header should first be verified, in particular the total length. If all checks are successful, the specified length, minus the sizerouting protocols. A disadvantage ofthe message headerthis approach is that it increases theamountpropagation latency ofdata left to read. An implementationrouting information. By choosing a minimum flash update interval thatwould "hang"is not much greater than therouting informationtime it takes to processwhile tryingthe multiple messages this latency should be minimized. A better method would be to readfrom a peer could set up a message buffer (4096 bytes) per peer and fill it with data as available until a complete message has been received. 6.3all received messages before sending updates. Appendix F.2 Reducing route flapping To avoid excessive route flapping a BGP speaker which needs towithdraw a destination and send an update about a more specific or less specific route SHOULD combine them into the same UPDATE message. 6.4 BGP Timers BGP employs five timers: ConnectRetry, Hold Time, KeepAlive, MinASOriginationInterval, and MinRouteAdvertisementInterval The suggested value for the ConnectRetry timer is 120 seconds. The suggested value for the Hold Time is 90 seconds. The suggested value for the KeepAlive timer is 1/3 of the Hold Time. The suggested value for the MinASOriginationInterval is 15 seconds. The suggested value for the MinRouteAdvertisementInterval is 30 seconds. An implementation of BGP MUST allow the Hold Time timer to be configurable, and MAY allow the other timers to be configurable. 6.5with- draw a destination and send an update about a more specific or less specific route SHOULD combine them into the same UPDATE message. Appendix F.3 Path attribute ordering Implementations which combine update messages as described above in 6.1 may prefer to see all path attributes presented in a known order. This permits them to quickly identify sets of attributes fromdifferentdiffer- ent update messages which are semantically identical. To facilitate this, it is a useful optimization to order the path attributes according to type code. This optimization is entirely optional.6.6Appendix F.4 AS_SET sorting Another useful optimization that can be done to simplify thissituationsitua- tion is to sort the AS numbers found in an AS_SET. This optimization is entirely optional.6.7Appendix F.5 Control over version negotiation Since BGP-4 is capable of carrying aggregated routes whichcannotcan not be properly represented in BGP-3, an implementation which supports BGP-4 and another BGP version should provide the capability to only speak BGP-4 on a per-peer basis.6.8Appendix F.6 Complex AS_PATH aggregation An implementation which chooses to provide a path aggregationalgorithmalgo- rithm which retains significant amounts of path information may wish to use the following procedure: For the purpose of aggregating AS_PATH attributes of two routes, we model each AS as a tuple <type, value>, where "type" identifies a type of the path segment the AS belongs to (e.g. AS_SEQUENCE, AS_SET), and "value" is the AS number. Two ASs are said to be the same if their corresponding <type, value> tuples are the same. The algorithm to aggregate two AS_PATH attributes works asfollows:fol- lows: a) Identify the same ASs (as defined above) within each AS_PATH attribute that are in the same relative order within both AS_PATH attributes. Two ASs, X and Y, are said to be in the same order if either: - X precedes Y in both AS_PATH attributes, or - Y precedes X in both AS_PATH attributes. b) The aggregated AS_PATH attribute consists of ASs identified in (a) in exactly the same order as they appear in the AS_PATH attributes to be aggregated. If two consecutive ASs identified in (a) do not immediately follow each other in both of the AS_PATH attributes to be aggregated, then the intervening ASs (ASs that are between the two consecutive ASs that are the same) in both attributes are combined into an AS_SET pathsegmentseg- ment that consists of the intervening ASs from both AS_PATH attributes; this segment is then placed in between the twoconsecutivecon- secutive ASs identified in (a) of the aggregated attribute. If two consecutive ASs identified in (a) immediately follow each other in one attribute, but do not follow in another, then the intervening ASs of the latter are combined into an AS_SET path segment; this segment is then placed in between the twoconsecutiveconsec- utive ASs identified in (a) of the aggregated attribute. c) For each pair of adjacent tuples in the aggregated AS_PATH, if both tuples have the same type, merge them together, as long as doing so will not cause a segment with length greater than 255 to be generated. If as a result of the above procedure a given AS number appears more than once within the aggregated AS_PATH attribute, all, but the last instance (rightmost occurrence) of that AS number should be removed from the aggregated AS_PATH attribute. Security Considerations BGP supports the ability to authenticate BGP messages by using BGP authentication. The authentication could be done on a per peer basis. In addition, BGP supports the ability to authenticate its data stream by using[10].[RFC2385]. This authentication could be done on a per peer basis. Finally, BGP could also use IPSec to authenticate its data stream. Among the mechanisms mentioned in this paragraph,[10][RFC2385] is the most widely deployed. Normative References [RFC793] Postel, J., "Transmission Control Protocol - DARPA Internet Program Protocol Specification", RFC793, September 1981. [RFC791] Postel, J., "Internet Protocol - DARPA Internet Program Pro- tocol Specification", RFC791, September 1981. [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, March 1997. Non-normative References[1][RFC904] Mills, D., "Exterior Gateway Protocol Formal Specification", RFC904, April 1984.[2][RFC1092] Rekhter, Y., "EGP and Policy Based Routing in the New NSFNET Backbone", RFC1092, February 1989.[3][RFC1093] Braun, H-W., "The NSFNET Routing Architecture", RFC1093, February 1989.[4] Postel, J., "Transmission Control Protocol - DARPA Internet Program Protocol Specification", RFC793, September 1981. [5][RFC1772] Rekhter, Y., and P. Gross, "Application of the BorderGatewayGate- way Protocol in the Internet", RFC1772, March 1995.[6] Postel, J., "Internet Protocol - DARPA Internet Program Protocol Specification", RFC791, September 1981. [7] "Information Processing Systems - Telecommunications and Information Exchange between Systems - Protocol[RFC1518] Rekhter, Y., Li, T., "An Architecture forExchange of Inter-domain Routeing Information among Intermediate Systems to Support Forwarding of ISO 8473 PDUs", ISO/IEC IS10747, 1993 [8]IP Address Allo- cation with CIDR", RFC 1518, September 1993. [RFC1519] Fuller, V., Li, T., Yu, J., and Varadhan, K., ""ClasslessInter- DomainInter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy", RFC1519, September 1993.[9] Rekhter, Y.,[RFC1997] R. Chandra, P. Traina, T. Li,T., "An Architecture for IP Address Allocation with CIDR","BGP Communities Attribute", RFC1518, September 1993. [10]1997, August 1996. [RFC2385] Heffernan, A., "Protection of BGP Sessions via the TCP MD5 Signature Option", RFC2385, August 1998.[11][RFC2439] C. Villamizar, R. Chandra, R. Govindan, "BGP Route Flap Damping", RFC2439, November 1998. [RFC2796] Bates, T., Chandra, R., Chen, E., "BGP Route Reflection - An Alternative to Full Mesh IBGP", RFC2796, April 2000.[12][RFC2842] R. Chandra, J. Scudder, "Capabilities Advertisement with BGP-4", RFC2842. [RFC2858] T. Bates, R. Chandra, D. Katz, Y. Rekhter, "Multiprotocol Extensions for BGP-4", RFC2858. [RFC2918] Chen, E., "Route Refresh Capability for BGP-4", RFC2918, September 2000.[13][RFC3065] Traina, P, McPherson, D., Scudder, J., "Autonomous System Confederations for BGP", RFC3065, February 2001. [IS10747] "Information Processing Systems - Telecommunications and Information Exchange between Systems - Protocol for Exchange of Inter-domain Routeing Information among Intermediate Systems to Sup- port Forwarding of ISO 8473 PDUs", ISO/IEC IS10747, 1993 Editors' Addresses Yakov Rekhter Juniper Networks1194 N. Mathilda Avenue Sunnyvale, CA 94089email: yakov@juniper.net Tony Li ProcketNetworks 1100 Cadillac Ct. Milpitas, CA 95035 Email:Networks, Inc. email: tli@procket.com Susan Hares NextHop Technologies, Inc. email: skh@nexthop.com