# Border Gateway Protocol

Border Gateway Protocol (BGP) is a standardized exterior gateway protocol designed to exchange routing and reachability information among autonomous systems (AS) on the Internet. BGP is classified as a path-vector routing protocol, and it makes routing decisions based on paths, network policies, or rule-sets configured by a network administrator.
BGP used for routing within an autonomous system is called Interior Border Gateway Protocol (iBGP). In contrast, the Internet application of the protocol is called Exterior Border Gateway Protocol (EBGP).

## History

The genesis of BGP was in 1989 when Kirk Lougheed, Len Bosack and Yakov Rekhter were sharing a meal at an IETF conference. They famously sketched the outline of their new routing protocol on the back of some napkins, hence often referenced to as the “Two Napkin Protocol”.
It was first described in 1989 in RFC 1105, and has been in use on the Internet since 1994. IPv6 BGP was first defined in RFC 1654 in 1994, and it was improved to RFC 2283 in 1998.
The current version of BGP is version 4 (BGP4), which was first published as RFC 1654 in 1994, subsequently updated by RFC 1771 in 1995 and RFC 4271 in 2006. RFC 4271 corrected errors, clarified ambiguities and updated the specification with common industry practices. The major enhancement of BGP4 was the support for Classless Inter-Domain Routing (CIDR) and use of route aggregation to decrease the size of routing tables. RFC 4271 allows BGP4 to carry a wide range of IPv4 and IPv6 "address families". It is also called the Multiprotocol Extensions which is Multiprotocol BGP (MP-BGP).

## Operation

BGP neighbors, called peers, are established by manual configuration among routers to create a TCP session on port 179. A BGP speaker sends 19-byte keep-alive messages every 30 seconds (protocol default value, tunable) to maintain the connection. Among routing protocols, BGP is unique in using TCP as its transport protocol.
When BGP runs between two peers in the same autonomous system (AS), it is referred to as Internal BGP (iBGP or Interior Border Gateway Protocol). When it runs between different autonomous systems, it is called External BGP (eBGP or Exterior Border Gateway Protocol). Routers on the boundary of one AS exchanging information with another AS are called border or edge routers or simply eBGP peers and are typically connected directly, while iBGP peers can be interconnected through other intermediate routers. Other deployment topologies are also possible, such as running eBGP peering inside a VPN tunnel, allowing two remote sites to exchange routing information in a secure and isolated manner.
The main difference between iBGP and eBGP peering is in the way routes that were received from one peer are typically propagated by default to other peers:
* New routes learned from an eBGP peer are re-advertised to all iBGP and eBGP peers.
* New routes learned from an iBGP peer are re-advertised to all eBGP peers only.
These route-propagation rules effectively require that all iBGP peers inside an AS are interconnected in a full mesh with iBGP sessions.
How routes are propagated can be controlled in detail via the route-maps mechanism. This mechanism consists of a set of rules. Each rule describes, for routes matching some given criteria, what action should be taken. The action could be to drop the route, or it could be to modify some attributes of the route before inserting it in the routing table.

### Extensions negotiation

During the peering handshake, when OPEN messages are exchanged, BGP speakers can negotiate optional capabilities of the session, including multiprotocol extensions and various recovery modes. If the multiprotocol extensions to BGP are negotiated at the time of creation, the BGP speaker can prefix the Network Layer Reachability Information (NLRI) it advertises with an address family prefix. These families include the IPv4 (default), IPv6, IPv4/IPv6 Virtual Private Networks and multicast BGP. Increasingly, BGP is used as a generalized signaling protocol to carry information about routes that may not be part of the global Internet, such as VPNs.
In order to make decisions in its operations with peers, a BGP peer uses a simple finite-state machine (FSM) that consists of six states: Idle; Connect; Active; OpenSent; OpenConfirm; and Established. For each peer-to-peer session, a BGP implementation maintains a state variable that tracks which of these six states the session is in. The BGP defines the messages that each peer should exchange in order to change the session from one state to another.
The first state is the Idle state. In the Idle state, BGP initializes all resources, refuses all inbound BGP connection attempts and initiates a TCP connection to the peer. The second state is Connect. In the Connect state, the router waits for the TCP connection to complete and transitions to the OpenSent state if successful. If unsuccessful, it starts the ConnectRetry timer and transitions to the Active state upon expiration. In the Active state, the router resets the ConnectRetry timer to zero and returns to the Connect state. In the OpenSent state, the router sends an Open message and waits for one in return in order to transition to the OpenConfirm state. Keepalive messages are exchanged and, upon successful receipt, the router is placed into the Established state. In the Established state, the router can send and receive: Keepalive; Update; and Notification messages to and from its peer.
* Idle State:
** Refuse all incoming BGP connections.
** Start the initialization of event triggers.
** Initiates a TCP connection with its configured BGP peer.
** Listens for a TCP connection from its peer.
** Changes its state to Connect.
** If an error occurs at any state of the FSM process, the BGP session is terminated immediately and returned to the Idle state. Some of the reasons why a router does not progress from the Idle state are:
*** TCP port 179 is not open.
*** A random TCP port over 1023 is not open.
*** Peer address configured incorrectly on either router.
*** AS number configured incorrectly on either router.
* Connect State:
** Waits for successful TCP negotiation with peer.
** BGP does not spend much time in this state if the TCP session has been successfully established.
** Sends Open message to peer and changes state to OpenSent.
** If an error occurs, BGP moves to the Active state. Some reasons for the error are:
*** TCP port 179 is not open.
*** A random TCP port over 1023 is not open.
*** Peer address configured incorrectly on either router.
*** AS number configured incorrectly on either router.
* Active State:
** If the router was unable to establish a successful TCP session, then it ends up in the Active state.
** BGP FSM tries to restart another TCP session with the peer and, if successful, then it sends an Open message to the peer.
** If it is unsuccessful again, the FSM is reset to the Idle state.
** Repeated failures may result in a router cycling between the Idle and Active states. Some of the reasons for this include:
*** TCP port 179 is not open.
*** A random TCP port over 1023 is not open.
*** BGP configuration error.
*** Network congestion.
*** Flapping network interface.
* OpenSent State:
** BGP FSM listens for an Open message from its peer.
** Once the message has been received, the router checks the validity of the Open message.
** If there is an error it is because one of the fields in the Open message does not match between the peers, e.g., BGP version mismatch, the peering router expects a different My AS, etc. The router then sends a Notification message to the peer indicating why the error occurred.
** If there is no error, a Keepalive message is sent, various timers are set and the state is changed to OpenConfirm.
* OpenConfirm State:
** The peer is listening for a Keepalive message from its peer.
** If a Keepalive message is received and no timer has expired before reception of the Keepalive, BGP transitions to the Established state.
** If a timer expires before a Keepalive message is received, or if an error condition occurs, the router transitions back to the Idle state.
* Established State:
** In this state, the peers send Update messages to exchange information about each route being advertised to the BGP peer.
** If there is any error in the Update message then a Notification message is sent to the peer, and BGP transitions back to the Idle state.

### Router connectivity and learning routes

In the simplest arrangement, all routers within a single AS and participating in BGP routing must be configured in a full mesh: each router must be configured as a peer to every other router. This causes scaling problems, since the number of required connections grows quadratically with the number of routers involved. To alleviate the problem, BGP implements two options: route reflectors (RFC 4456) and BGP confederations (RFC 5065). The following discussion of basic update processing assumes a full iBGP mesh.
A given BGP router may accept network-layer reachability information (NLRI) updates from multiple neighbors and advertise NLRI to the same, or a different set, of neighbors. The BGP process maintains several routing information bases:
* RIB: routers main routing information base table.
* Loc-RIB: local routing information base BGP maintains its own master routing table separate from the main routing table of the router.
* Adj-RIB-In: For each neighbor, the BGP process maintains a conceptual adjacent routing information base, incoming, containing the NLRI received from the neighbor.
* Adj-RIB-Out: For each neighbor, the BGP process maintains a conceptual adjacent routing information base, outgoing , containing the NLRI sent to the neighbor.
The physical storage and structure of these conceptual tables are decided by the implementer of the BGP code. Their structure is not visible to other BGP routers, although they usually can be interrogated with management commands on the local router. It is quite common, for example, to store the Adj-RIB-In, Adj-RIB-Out and the Loc-RIB together in the same data structure, with additional information attached to the RIB entries. The additional information tells the BGP process such things as whether individual entries belong in the Adj-RIBs for specific neighbors, whether the peer-neighbor route selection process made received policies eligible for the Loc-RIB, and whether Loc-RIB entries are eligible to be submitted to the local router's routing table management process.
BGP submits the routes that it considers best to the main routing table process. Depending on the implementation of that process, the BGP route is not necessarily selected. For example, a directly connected prefix, learned from the router's own hardware, is usually most preferred. As long as that directly connected route's interface is active, the BGP route to the destination will not be put into the routing table. Once the interface goes down, and there are no more preferred routes, the Loc-RIB route would be installed in the main routing table.
BGP carries the information with which rules inside BGP-speaking routers can make policy decisions. Some of the information carried that is explicitly intended to be used in policy decisions are:
* Communities
* multi-exit discriminators (MED).
* autonomous systems (AS)

### Route selection process

The BGP standard specifies a number of decision factors, more than the ones that are used by any other common routing process, for selecting NLRI to go into the Loc-RIB. The first decision point for evaluating NLRI is that its next-hop attribute must be reachable (or resolvable). Another way of saying the next-hop must be reachable is that there must be an active route, already in the main routing table of the router, to the prefix in which the next-hop address is reachable.
Next, for each neighbor, the BGP process applies various standard and implementation-dependent criteria to decide which routes conceptually should go into the Adj-RIB-In. The neighbor could send several possible routes to a destination, but the first level of preference is at the neighbor level. Only one route to each destination will be installed in the conceptual Adj-RIB-In. This process will also delete, from the Adj-RIB-In, any routes that are withdrawn by the neighbor.
Whenever a conceptual Adj-RIB-In changes, the main BGP process decides if any of the neighbor's new routes are preferred to routes already in the Loc-RIB. If so, it replaces them. If a given route is withdrawn by a neighbor, and there is no other route to that destination, the route is removed from the Loc-RIB and no longer sent by BGP to the main routing table manager. If the router does not have a route to that destination from any non-BGP source, the withdrawn route will be removed from the main routing table.
As long as there is tiebreaker the route selection process moves to the next step.
Steps to determine best path, in order of tiebreaker: :
| Step | Scope | Name | Default | Preferred | BGP field | NOTE |
| 1 | Local to router | local Weight | "Off" | Higher | | Cisco-specific parameter |
| 2 | Internal to AS | Local preference | "Off", all set to 100. | Higher | LOCAL_PREF | If there are several iBGP routes from the neighbor, the one with the highest local preference is selected unless there are several routes with the same local preference. |
| 3 | Internal to AS | Accumulated Interior Gateway Protocol (AIGP) | "Off" | Lowest | AIGP | rfc7311 |
| 4 | External to AS | Autonomous system (AS) jumps | "On", skipped if ignored in configuration | Lowest | AS-path | AS jumps is the number of AS numbers that must be traversed to reach the advertised destination. AS1–AS2–AS3 is a shorter path with fewer jumps than AS4–AS5–AS6–AS7. |
| 5 | External to AS | origin type | "IGP" | Lowest | ORIGIN | 0 = IGP 1 = EGP 2 = Incomplete |
| 6 | External to AS | multi-exit discriminator (MED) | "on", imported from IGP | Lowest | MULTI_EXIT_DISC | By default only route with the same autonomous system (AS) is compared. Can be set to ignore same autonomous system (AS). By default Internal IGP is not added. Can be set to add IGP metric. Before the most recent edition of the BGP standard, if an update had no MED value, several implementations created a MED with the highest possible value. The current standard specifies that missing MEDs are treated as the lowest possible value. Since the current rule may cause different behavior than the vendor interpretations, BGP implementations that used the nonstandard default value have a configuration feature that allows the old or standard rule to be selected. |
| 7 | Local to router (Loc-RIB) | eBGP over iBGP paths | "on" | | | Directly connected, over indirectly |
| 8 | Local to router (Loc-RIB) | IGP metric to BGP next hop | "on", imported from IGP | Lowest | | Continue, even if bestpath is already selected. Prefer the route with the lowest interior cost to the next hop, according to the main routing table. If two neighbors advertised the same route, but one neighbor is reachable via a low-bitrate link and the other by a high-bitrate link, and the interior routing protocol calculates lowest cost based on highest bitrate, the route through the high-bitrate link would be preferred and other routes dropped. |
| 9 | Local to router (Loc-RIB) | Path that was received first | "on" | oldest | | Used to ignore changes on the steps 10+ |
| 10 | Local to router (Loc-RIB) | Router ID | "on" | Lowest | | |
| 11 | Local to router (Loc-RIB) | Cluster list length | "on" | Lowest | | |
| 12 | Local to router (Loc-RIB) | Neighbor address | "on" | Lowest |
The local preference, weight, and other criteria can be manipulated by local configuration and software capabilities. Such manipulation, although commonly used, is outside the scope of the standard. For example, the community attribute (see below) is not directly used by the BGP selection process. The BGP neighbor process can have a rule to set local preference or another factor based on a manually programmed rule to set the attribute if the community value matches some pattern-matching criterion. If the route was learned from an external peer the per-neighbor BGP process computes a local preference value from local policy rules and then compares the local preference of all routes from the neighbor.

### Communities

BGP communities are attribute tags that can be applied to incoming or outgoing prefixes to achieve some common goal. While it is common to say that BGP allows an administrator to set policies on how prefixes are handled by ISPs, this is generally not possible, strictly speaking. For instance, BGP natively has no concept to allow one AS to tell another AS to restrict advertisement of a prefix to only North American peering customers. Instead, an ISP generally publishes a list of well-known or proprietary communities with a description for each one, which essentially becomes an agreement of how prefixes are to be treated.
Well-known BGP communities :
| Attribute value | Attribute | Description | Reference |
| 0x00000000-0x0000FFFF | Reserved | | RFC 1997 |
| 0x00010000-0xFFFEFFFF | Reserved for private use | | RFC 1997 |
| 0xFFFF0000 | GRACEFUL_SHUTDOWN | At neighbor AS-peer, set LOCAL_PREF, lower to route away from source. | RFC 8326 |
| 0xFFFF0001 | ACCEPT_OWN | Used to modify how a route originated within one VRF is imported into other VRFs | RFC 7611 |
| 0xFFFF0002 | ROUTE_FILTER_TRANSLATED_v4 | | RFC draft-l3vpn-legacy-rtc |
| 0xFFFF0003 | ROUTE_FILTER_v4 | | RFC draft-l3vpn-legacy-rtc |
| 0xFFFF0004 | ROUTE_FILTER_TRANSLATED_v6 | | RFC draft-l3vpn-legacy-rtc |
| 0xFFFF0005 | ROUTE_FILTER_v6 | | RFC draft-l3vpn-legacy-rtc |
| 0xFFFF0006 | LLGR_STALE | Stale routes are retained for longer after a session failure | RFC 9494 |
| 0xFFFF0007 | NO_LLGR | LLGR capability should not apply | RFC 9494 |
| 0xFFFF0008 | accept-own-nexthop | | RFC draft-agrewal-idr-accept-own-nexthop |
| 0xFFFF0009 | Standby PE | Allow for faster recovery of connectivity on different types of failures, with multicast in BGP/MPLS VPNs. | RFC 9026 |
| 0xFFFF029A | BLACKHOLE | To temporarily protect against denial-of-service attack by asking the neighbour AS to discard all traffic to the prefix (blackholing) | RFC 7999 |
| 0xFFFFFF01 | NO_EXPORT | Limit to a BGP confederation boundary | RFC 1997 |
| 0xFFFFFF02 | NO_ADVERTISE | Limit to a BGP peer | RFC 1997 |
| 0xFFFFFF03 | NO_EXPORT_SUBCONFED | Limit to an AS | RFC 1997 |
| 0xFFFFFF04 | NOPEER | "No need" to advertise over a peer link | RFC 3765 |
Examples of common communities include:
* local preference adjustments,
* geographic
* peer type restrictions
* denial-of-service attack identification
* AS prepending options.
An ISP might state that any routes received from customers with following examples:
* To Customers North America (East Coast) 3491:100
* To Customers North America (West Coast) 3491:200
The customer simply adjusts their configuration to include the correct community or communities for each route, and the ISP is responsible for controlling who the prefix is advertised to. The end user has no technical ability to enforce correct actions being taken by the ISP, though problems in this area are generally rare and accidental.
It is a common tactic for end customers to use BGP communities (usually ASN:70,80,90,100) to control the local preference the ISP assigns to advertised routes instead of using MED (the effect is similar). The community attribute is transitive, but communities applied by the customer very rarely propagated outside the next-hop AS. Not all ISPs give out their communities to the public.

#### BGP Extended Community Attribute

The BGP Extended Community Attribute was added in 2006, in order to extend the range of such attributes and to provide a community attribute structuring by means of a type field. The extended format consists of one or two octets for the type field followed by seven or six octets for the respective community attribute content. The definition of this Extended Community Attribute is documented in RFC 4360. The IANA administers the registry for BGP Extended Communities Types. The Extended Communities Attribute itself is a transitive optional BGP attribute. A bit in the type field within the attribute decides whether the encoded extended community is of a transitive or non-transitive nature. The IANA registry therefore provides different number ranges for the attribute types. Due to the extended attribute range, its usage can be manifold. RFC 4360 exemplarily defines the "Two-Octet AS Specific Extended Community", the "IPv4 Address Specific Extended Community", the "Opaque Extended Community", the "Route Target Community", and the "Route Origin Community". A number of BGP QoS drafts also use this Extended Community Attribute structure for inter-domain QoS signalling.
With the introduction of 32-bit AS numbers, some issues were immediately obvious with the community attribute that only defines a 16-bit ASN field, which prevents the matching between this field and the real ASN value. Since RFC 7153, extended communities are compatible with 32-bit ASNs. RFC 8092 and RFC 8195 introduce a Large Community attribute of 12 bytes, divided in three field of 4 bytes each (AS:function:parameter).

### Multi-exit discriminators

MEDs, defined in the main BGP standard, were originally intended to show to another neighbor AS the advertising AS's preference as to which of several links are preferred for inbound traffic. Another application of MEDs is to advertise the value, typically based on delay, of multiple ASs that have a presence at an IXP, that they impose to send traffic to some destination.
Some routers (like Juniper) will use the Metric from OSPF to set MED.
Examples of MED used with BGP when exported to BGP on Juniper SRX

## Packet format
### Message header format

BGP version 4 message header format :
| bit offset | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 0–15 | 16–23 | 16–23 | 16–23 | 16–23 | 16–23 | 16–23 | 16–23 | 16–23 | 24–31 | 24–31 | 24–31 | 24–31 | 24–31 | 24–31 | 24–31 | 24–31 |
| 0 | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) |
| 32 | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) |
| 64 | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) |
| 96 | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) | Marker (always: ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff ff) |
| 128 | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Length | Type | Type | Type | Type | Type | Type | Type | Type | | | | | | | | |
* Marker: Included for compatibility, must be set to all ones.
* Length: Total length of the message in octets, including the header.
* Type: Type of BGP message. The following values are defined:
** Open (1)
** Update (2)
** Notification (3)
** KeepAlive (4)
** Route-Refresh (5)
note: "Marker" and "Length" is omitted from the examples.

### Open Packet
#### Version (8bit)

    Version of BGP used.

#### My AS (16bit)

    Senders autonomous system number.

#### Hold Time (16bit)

    Timeout timer, used to calculate KeepAlive messages. Default 90 seconds.

#### BGP Identifier (32bit)

    IP-address of sender.
    Optional Parameters Length (8 bit): total length of the Optional parameters field.
Example of Open Message

### Update Packet

Only changes are sent, after initial exchange, only difference (add/change/removed) are sent.
Example of UPDATE Message

### Notification

If there is an error it is because one of the fields in the OPEN or UPDATE message does not match between the peers, e.g., BGP version mismatch, the peering router expects a different My AS, etc. The router then sends a Notification message to the peer indicating why the error occurred.
Error Codes :
| Error Code | Name | subcodes | subcodes |
| Error Code | Name | Code | Name |
| 1 | Message Header Error | 1 | Connection Not Synchronized |
| 1 | Message Header Error | 2 | Bad Message Length |
| 1 | Message Header Error | 3 | Bad Message Type |
| 2 | OPEN Message Error | 1 | Unsupported Version Number. |
| 2 | OPEN Message Error | 2 | Bad Peer AS. |
| 2 | OPEN Message Error | 3 | Bad BGP Identifier. |
| 2 | OPEN Message Error | 4 | Unsupported Authentication Code. |
| 2 | OPEN Message Error | 5 | Authentication Failure. |
| 2 | OPEN Message Error | 6 | Unacceptable Hold Time. |
| 3 | UPDATE Message Error | 1 | Malformed Attribute List. |
| 3 | UPDATE Message Error | 2 | Unrecognized Well-known Attribute. |
| 3 | UPDATE Message Error | 3 | Missing Well-known Attribute. |
| 3 | UPDATE Message Error | 4 | Attribute Flags Error. |
| 3 | UPDATE Message Error | 5 | Attribute Length Error. |
| 3 | UPDATE Message Error | 6 | Invalid ORIGIN Attribute |
| 3 | UPDATE Message Error | 7 | AS Routing Loop. |
| 3 | UPDATE Message Error | 8 | Invalid NEXT_HOP Attribute. |
| 3 | UPDATE Message Error | 9 | Optional Attribute Error. |
| 3 | UPDATE Message Error | 10 | Invalid Network Field. |
| 3 | UPDATE Message Error | 11 | Malformed AS_PATH. |
| 4 | Hold Timer Expired | Hold Timer Expired | Hold Timer Expired |
| 5 | Finite State Machine Error | Finite State Machine Error | Finite State Machine Error |
| 6 | Cease | Cease | Cease |
Example of NOTIFICATION Message

### KeepAlive

KeepAlive messages are sent periodically, to verify that remote peer is still alive. keepalives should be sent at intervals of one third the holdtime.
Example of KEEPALIVE Message

### Route-Refresh

Defined in RFC7313.
Allows for soft updating of Adj-RIB-in, without resetting connection.
Example of ROUTE-REFRESH Message

## Internal scalability

BGP is "the most scalable of all routing protocols."
An autonomous system with internal BGP (iBGP) must have all of its iBGP peers connect to each other in a full mesh (where everyone speaks to everyone directly). This full-mesh configuration requires that each router maintain a session with every other router. In large networks, this number of sessions may degrade the performance of routers, due to either a lack of memory, or high CPU process requirements.

### Route reflectors

Route reflectors (RRs) reduce the number of connections required in an AS. A single router (or two for redundancy) can be made an RR: other routers in the AS need only be configured as peers to them. An RR offers an alternative to the logical full-mesh requirement of iBGP. The purpose of the RR is concentration. Multiple BGP routers can peer with a central point, the RR – acting as an RR server – rather than peer with every other router in a full mesh. All the other iBGP routers become RR clients.
This approach, similar to OSPF's DR/BDR feature, provides large networks with added iBGP scalability. In a fully meshed iBGP network of 10 routers, 90 individual CLI statements (spread throughout all routers in the topology) are needed just to define the remote-AS of each peer: this quickly becomes a headache to manage. An RR topology can cut these 90 statements down to 18, offering a viable solution for the larger networks administered by ISPs.
An RR is a single point of failure, therefore at least a second RR may be configured in order to provide redundancy. As it is an additional peer for the other 10 routers, it approximately doubles the number of CLI statements, requiring an additional 11 × 2 − 2 = 20 statements in this case. In a BGP multipath environment the additional RR also can benefit the network by adding local routing throughput if the RRs are acting as traditional routers instead of just a dedicated RR server role.
RRs and confederations both reduce the number of iBGP peers to each router and thus reduce processing overhead. RRs are a pure performance-enhancing technique, while confederations also can be used to implement more fine-grained policy.

#### Rules

RR servers propagate routes inside the AS based on the following rules:
* Routes are always reflected to eBGP peers.
* Routes are never reflected to the originator of the route.
* If a route is received from a non-client peer, reflect to client peers.
* If a route is received from a client peer, reflect to client and non-client peers.

#### Cluster

An RR and its clients form a cluster. The cluster ID is then attached to every route advertised by the RR to its client or nonclient peers. A cluster ID is a cumulative, non-transitive BGP attribute, and every RR must prepend the local cluster ID to the cluster list to avoid routing loops.

### Confederation

Confederations are sets of autonomous systems. In common practice, only one of the confederation AS numbers is seen by the Internet as a whole. Confederations are used in very large networks where a large AS can be configured to encompass smaller more manageable internal ASs.
The confederated AS is composed of multiple ASs. Each confederated AS alone has iBGP fully meshed and has connections to other ASs inside the confederation. Even though these ASs have eBGP peers to ASs within the confederation, the ASs exchange routing as if they used iBGP. In this way, the confederation preserves next hop, metric, and local preference information. To the outside world, the confederation appears to be a single AS. With this solution, iBGP transit AS problems can be resolved as iBGP requires a full mesh between all BGP routers: large number of TCP sessions and unnecessary duplication of routing traffic.
Confederations can be used in conjunction with route reflectors. Both confederations and route reflectors can be subject to persistent oscillation unless specific design rules, affecting both BGP and the interior routing protocol, are followed.
These alternatives can introduce problems of their own, including the following:
* route oscillation
* sub-optimal routing
* increase of BGP convergence time
Additionally, route reflectors and BGP confederations were not designed to ease BGP router configuration. Nevertheless, these are common tools for experienced BGP network architects. These tools may be combined, for example, as a hierarchy of route reflectors.

## Stability

The routing tables managed by a BGP implementation are adjusted continually to reflect actual changes in the network, such as links or routers going down and coming back up. In the network as a whole, it is normal for these changes to happen almost continuously, but for any particular router or link, changes are expected to be relatively infrequent. If a router is misconfigured or mismanaged then it may get into a rapid cycle between down and up states. This pattern of repeated withdrawal and re-announcement known as route flapping can cause excessive activity in all the other routers that know about the cycling entity, as the same route is continually injected and withdrawn from the routing tables. The BGP design is such that delivery of traffic may not function while routes are being updated. On the Internet, a BGP routing change may cause outages for several minutes.
A feature known as route flap damping (RFC 2439) is built into many BGP implementations in an attempt to mitigate the effects of route flapping. Without damping, the excessive activity can cause a heavy processing load on routers, which may in turn delay updates on other routes, and so affect overall routing stability. With damping, a route's flapping is exponentially decayed. At the first instance when a route becomes unavailable and quickly reappears, damping does not take effect, so as to maintain the normal fail-over times of BGP. At the second occurrence, BGP shuns that prefix for a certain length of time; subsequent occurrences are ignored exponentially longer. After the abnormalities have ceased and a suitable length of time has passed for the offending route, prefixes can be reinstated with a clean slate. Damping can also mitigate denial-of-service attacks.
It is also suggested in RFC 2439$^{:Section4}$ that route flap damping is a feature more desirable if implemented to Exterior Border Gateway Protocol Sessions (eBGP sessions or simply called exterior peers) and not on Interior Border Gateway Protocol Sessions (iBGP sessions or simply called internal peers). With this approach when a route flaps inside an autonomous system, it is not propagated to the external ASs – flapping a route to an eBGP will cause a chain of flapping for the particular route throughout the backbone. This method also successfully avoids the overhead of route flap damping for iBGP sessions.
Subsequent research has shown that flap damping can actually lengthen convergence times in some cases, and can cause interruptions in connectivity even when links are not flapping. Moreover, as backbone links and router processors have become faster, some network architects have suggested that flap damping may not be as important as it used to be, since changes to the routing table can be handled much faster by routers. This has led the RIPE Routing Working Group to write, "With the current implementations of BGP flap damping, the application of flap damping in ISP networks is NOT recommended. ... If flap damping is implemented, the ISP operating that network will cause side-effects to their customers and the Internet users of their customers' content and services ... . These side-effects would quite likely be worse than the impact caused by simply not running flap damping at all." Improving stability without the problems of flap damping is the subject of current research.

## Routing table growth

One of the largest problems faced by BGP, and indeed the Internet infrastructure as a whole, is the growth of the Internet routing table. If the global routing table grows to the point where some older, less capable routers cannot cope with the memory requirements or the CPU load of maintaining the table, these routers will cease to be effective gateways between the parts of the Internet they connect. In addition, and perhaps even more importantly, larger routing tables take longer to stabilize after a major connectivity change, leaving network service unreliable, or even unavailable, in the interim.
Until late 2001, the global routing table was growing exponentially, threatening an eventual widespread breakdown of connectivity. In an attempt to prevent this, ISPs cooperated in keeping the global routing table as small as possible, by using Classless Inter-Domain Routing (CIDR) and route aggregation. While this slowed the growth of the routing table to a linear process for several years, with the expanded demand for multihoming by end-user networks the growth was once again superlinear by the middle of 2004.

### 512k day

A Y2K-like overflow triggered in 2014 for those models that were not appropriately updated.
While a full IPv4 BGP table as of August 2014 (512k day) was in excess of 512,000 prefixes, many older routers had a limit of 512k (512,000–524,288) routing table entries. On August 12, 2014, outages resulting from full tables hit eBay, LastPass and Microsoft Azure among others. A number of Cisco routers commonly in use had TCAM, a form of high-speed content-addressable memory, for storing BGP advertised routes. On impacted routers, the TCAM was by default allocated as 512k IPv4 routes and 256k IPv6 routes. While the reported number of IPv6 advertised routes was only about 20k, the number of advertised IPv4 routes reached the default limit, causing a spillover effect as routers attempted to compensate for the issue by using slow software routing (as opposed to fast hardware routing via TCAM). The main method for dealing with this issue involves operators changing the TCAM allocation to allow more IPv4 entries, by reallocating some of the TCAM reserved for IPv6 routes, which requires a reboot on most routers. The 512k problem was predicted by a number of IT professionals.
The actual allocations which pushed the number of routes above 512k was the announcement of about 15,000 new routes in short order, starting at 07:48 UTC. Almost all of these routes were to Verizon Autonomous Systems 701 and 705, created as a result of deaggregation of larger blocks, introducing thousands of new /24 routes, and making the routing table reach 515,000 entries. The new routes appear to have been reaggregated within 5 minutes, but instability across the Internet apparently continued for a number of hours. Even if Verizon had not caused the routing table to exceed 512k entries in the short spike, it would have soon happened through natural growth.
Route summarization is often used to improve aggregation of the BGP global routing table, thereby reducing the necessary table size in routers of an AS. Consider AS1 has been allocated the big address space of 172.16.0.0/16, this would be counted as one route in the table, but due to customer requirements or traffic engineering purposes, AS1 wants to announce smaller, more specific routes of 172.16.0.0/18, 172.16.64.0/18, and 172.16.128.0/18. The prefix 172.16.192.0/18 does not have any hosts so AS1 does not announce a specific route 172.16.192.0/18. This all counts as AS1 announcing four routes.
AS2 will see the four routes from AS1 (172.16.0.0/16, 172.16.0.0/18, 172.16.64.0/18, and 172.16.128.0/18) and it is up to the routing policy of AS2 to decide whether or not to take a copy of the four routes or, as 172.16.0.0/16 overlaps all the other specific routes, to just store the summary, 172.16.0.0/16.
If AS2 wants to send data to prefix 172.16.192.0/18, it will be sent to the routers of AS1 on route 172.16.0.0/16. At AS1, it will either be dropped or a destination unreachable ICMP message will be sent back, depending on the configuration of AS1's routers.
If AS1 later decides to drop the route 172.16.0.0/16, leaving 172.16.0.0/18, 172.16.64.0/18, and 172.16.128.0/18, the number of routes AS1 announces drops to three. Depending on the routing policy of AS2, it will store a copy of the three routes, or aggregate 172.16.0.0/18 and 172.16.64.0/18 to 172.16.0.0/17, thereby reducing the number of routes AS2 stores to two (172.16.0.0/17 and 172.16.128.0/18).
If AS2 now wants to send data to prefix 172.16.192.0/18, it will be dropped or a destination unreachable ICMP message will be sent back at the routers of AS2 (not AS1 as before), because 172.16.192.0/18 is not in the routing table.

### AS number depletion and 32-bit ASNs

The RFC 1771 BGP-4 specification coded AS numbers on 16 bits, for 64,510 possible public AS numbers. In 2011, only 15,000 AS numbers were still available, and projections were envisioning a complete depletion of available AS numbers in September 2013.
RFC 6793 extends AS coding from 16 to 32 bits, which now allows up to 4 billion available AS. An additional private AS range is also defined in RFC 6996. To allow the traversal of router groups not able to manage those new ASNs, the new attribute AS4_PATH (optional transitive) and the special 16-bit ASN AS_TRANS (AS23456) is used. 32-bit ASN assignments started in 2007.

### Load balancing

Another factor contributing to the growth of the routing table is the need for load balancing of multi-homed networks. It is not a trivial task to balance the inbound traffic to a multi-homed network across its multiple inbound paths, due to limitation of the BGP route selection process. For a multi-homed network, if it announces the same network blocks across all of its BGP peers, the result may be that one or several of its inbound links become congested while the other links remain under-utilized, because external networks all picked that set of congested paths as optimal. Like most other routing protocols, BGP does not detect congestion.
To work around this problem, BGP administrators of that multihomed network may divide a large contiguous IP address block into smaller blocks and tweak the route announcement to make different blocks look optimal on different paths, so that external networks will choose a different path to reach different blocks of that multi-homed network. Such cases will increase the number of routes as seen on the global BGP table.
One method to address the routing table issue associated with load balancing is to deploy Locator/Identifier Separation Protocol (BGP/LISP) gateways within an Internet exchange point to allow ingress traffic engineering across multiple links. This technique does not increase the number of routes seen on the global BGP table.

## Security

By design, routers running BGP accept advertised routes from other BGP routers by default. This allows for automatic and decentralized routing of traffic across the Internet, but it also leaves the Internet potentially vulnerable to accidental or malicious disruption, known as BGP hijacking. Due to the extent to which BGP is embedded in the core systems of the Internet, and the number of different networks operated by many different organizations which collectively make up the Internet, correcting this vulnerability (such as by introducing the use of cryptographic keys to verify the identity of BGP routers) is a technically and economically challenging problem.

## Extensions

Multiprotocol Extensions for BGP (MBGP), sometimes referred to as Multiprotocol BGP or Multicast BGP and defined in RFC 4760, is an extension to BGP that allows different types of addresses (known as address families) to be distributed in parallel. Whereas standard BGP supports only IPv4 unicast addresses, Multiprotocol BGP supports IPv4 and IPv6 addresses and it supports unicast and multicast variants of each. Multiprotocol BGP allows information about the topology of IP multicast-capable routers to be exchanged separately from the topology of normal IPv4 unicast routers. Thus, it allows a multicast routing topology different from the unicast routing topology. Although MBGP enables the exchange of inter-domain multicast routing information, other protocols such as the Protocol Independent Multicast family are needed to build trees and forward multicast traffic.
Multiprotocol BGP is also widely deployed in case of MPLS L3 VPN, to exchange VPN labels learned for the routes from the customer sites over the MPLS network, in order to distinguish between different customer sites when the traffic from the other customer sites comes to the provider edge router for routing.
Another extension to BGP is multipath routing. This typically requires identical MED, weight, origin, and AS-path although some implementations provide the ability to relax the AS-path checking to only expect an equal path length rather than the actual AS numbers in the path being expected to match too. This can then be extended further with features like Cisco's dmzlink-bw which enables a ratio of traffic sharing based on bandwidth values configured on individual links.

## Uses

BGP4 is standard for Internet routing and required of most Internet service providers (ISPs) to establish routing between one another. Very large private IP networks use BGP internally. An example use case is the joining of a number of large Open Shortest Path First (OSPF) networks when OSPF by itself does not scale to the size required. Another reason to use BGP is multihoming a network for better redundancy, either to multiple access points to a single ISP or to multiple ISPs.

## Implementations

Routers, especially small ones intended for small office/home office (SOHO) use, may not include BGP capability. Other commercial routers may need a specific software executable image that supports BGP, or a license that enables it. Devices marketed as layer-3 switches are less likely to support BGP than devices marketed as routers, but many high-end layer-3 switches can run BGP.
Products marketed as switches may have a size limitation on BGP tables that is far smaller than a full Internet table plus internal routes. These devices may be perfectly reasonable and useful when used for BGP routing of some smaller part of the network, such as a confederation-AS representing one of several smaller enterprises that are linked, by a BGP backbone of backbones, or a small enterprise that announces routes to an ISP but only accepts a default route and perhaps a small number of aggregated routes.
A BGP router used only for a network with a single point of entry to the Internet may have a much smaller routing table size (and hence RAM and CPU requirement) than a multihomed network. Even simple multihoming can have modest routing table size. The actual amount of memory required in a BGP router depends on the amount of BGP information exchanged with other BGP speakers and the way in which the particular router stores BGP information. The router may have to keep more than one copy of a route, so it can manage different policies for route advertising and acceptance to a specific neighboring AS. The term view is often used for these different policy relationships on a running router.
If one router implementation takes more memory per route than another implementation, this may be a legitimate design choice, trading processing speed against memory. A full IPv4 BGP table as of August 2015 is in excess of 590,000 prefixes. Large ISPs may add another 50% for internal and customer routes. Again depending on implementation, separate tables may be kept for each view of a different peer AS.
Notable free and open-source implementations of BGP include:
* BIRD, a GPL routing package for Unix-like systems.
* FRRouting, a fork of Quagga for Unix-like systems; and its ancestors:
** Quagga, a fork of GNU Zebra for Unix-like systems (no longer developed).
** GNU Zebra, a GPL routing suite supporting BGP4 (decommissioned).
* OpenBGPD, a BSD-licensed implementation by the OpenBSD team.
* XORP, the eXtensible Open Router Platform, a BSD-licensed suite of routing protocols.
Systems for testing BGP conformance, load or stress performance come from vendors such as:
* Agilent Technologies
* GNS3 open source network simulator
* Ixia
* Spirent