<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://onnocenter.or.id/wiki/index.php?action=history&amp;feed=atom&amp;title=IPV6%3A_BGP_Managing_Large_Scale_BGP_Peer</id>
	<title>IPV6: BGP Managing Large Scale BGP Peer - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://onnocenter.or.id/wiki/index.php?action=history&amp;feed=atom&amp;title=IPV6%3A_BGP_Managing_Large_Scale_BGP_Peer"/>
	<link rel="alternate" type="text/html" href="https://onnocenter.or.id/wiki/index.php?title=IPV6:_BGP_Managing_Large_Scale_BGP_Peer&amp;action=history"/>
	<updated>2026-04-12T15:57:47Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.35.4</generator>
	<entry>
		<id>https://onnocenter.or.id/wiki/index.php?title=IPV6:_BGP_Managing_Large_Scale_BGP_Peer&amp;diff=55875&amp;oldid=prev</id>
		<title>Onnowpurbo: Created page with &quot;Managing Large-Scale BGP Peering The preceding section pointed out that when an AS becomes large, attempting to create fully meshed IBGP peers can be daunting. This is just on...&quot;</title>
		<link rel="alternate" type="text/html" href="https://onnocenter.or.id/wiki/index.php?title=IPV6:_BGP_Managing_Large_Scale_BGP_Peer&amp;diff=55875&amp;oldid=prev"/>
		<updated>2019-03-18T04:38:44Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Managing Large-Scale BGP Peering The preceding section pointed out that when an AS becomes large, attempting to create fully meshed IBGP peers can be daunting. This is just on...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Managing Large-Scale BGP Peering&lt;br /&gt;
The preceding section pointed out that when an AS becomes large, attempting to create fully meshed IBGP peers can be daunting.&lt;br /&gt;
This is just one of the problems that emerges when you attempt to work with BGP on a large scale. BGP features four tools that can&lt;br /&gt;
simplify the management of large numbers of BGP peers:&lt;br /&gt;
Peer groups&lt;br /&gt;
Communities&lt;br /&gt;
Route reflectors&lt;br /&gt;
Confederations&lt;br /&gt;
The first two tools help simplify the management of routing policies between multiple peers, either internal or external. The second two&lt;br /&gt;
tools simplify the management of IBGP among large numbers of peers.&lt;br /&gt;
Peer Groups&lt;br /&gt;
Often in large BGP internetworks, policies on a router apply to multiple peers. The same attributes might be set in the updates going&lt;br /&gt;
to several peers, for example, or the same filter might be used on routes coming from several peers. In such cases, you can simplify&lt;br /&gt;
configuration and management by adding peers that share common policies to a peer group.&lt;br /&gt;
A peer group is defined on a Cisco router with a name and a set of routing policies. Peers are then added to the peer group. Any&lt;br /&gt;
changes that must be made to the policies can then be made for the group rather than for each individual peer. Peer groups also&lt;br /&gt;
prove useful for improving performance on a router. Instead of repeatedly consulting the policy database for each update sent to each&lt;br /&gt;
peer, the router can consult the policy database once, create a single update, and then send copies of it to all the peers in the group.&lt;br /&gt;
At times, additional policies might apply to one or more members of a peer group. In such a case, you can apply the additional policies&lt;br /&gt;
to the appropriate neighbors in addition to the common policies of the group.&lt;br /&gt;
Communities&lt;br /&gt;
Whereas peer groups apply policies to a group of routers, communities apply policies to a group of routes. A router adds a route to a&lt;br /&gt;
preconfigured community by setting its COMMUNITY attribute to some value that identifies it as a member of the community.&lt;br /&gt;
Neighboring routers can then apply their policies, such as filtering or redistribution policies, to the routes based on the value of the&lt;br /&gt;
COMMUNITY attribute. The COMMUNITY attribute, which can be set to a well-known value or to some value defined by the network&lt;br /&gt;
administrator, is described more fully in the section &amp;quot;The COMMUNITY Attribute,&amp;quot; earlier in this chapter.&lt;br /&gt;
You can set more than one COMMUNITY attribute for a single route. A router receiving a route with multiple COMMUNITY attributes&lt;br /&gt;
has the option of setting policies based on all those attributes or on some subset of the attributes. When routes containing&lt;br /&gt;
COMMUNITY attributes are aggregated, the aggregate inherits all the COMMUNITY attributes of all the routes.&lt;br /&gt;
Route Reflectors&lt;br /&gt;
Route reflectors are useful when an AS contains a large number of IBGP peers. (For more information, see RFC 1966 at&lt;br /&gt;
www.isuedu/in-notes/rfc1771.txt.) Unless EBGP routes are redistributed into the autonomous system's IGP, all IBGP peers must be&lt;br /&gt;
fully meshed. For every n routers, there will be n(n ​ 1)/2 IBGP connections in the AS. For example, Figure 2-35 shows six fully&lt;br /&gt;
meshed IBGP routers, hardly a large number of routers; even here, however, 15 IBGP connections are needed.&lt;br /&gt;
Figure 2-35. Fully Meshed IBGP PeersRoute reflectors offer an alternative to fully meshed IBGP peers. A router is configured as a route reflector (RR), and other IBGP&lt;br /&gt;
routers, known as clients, peer with the RR only, rather than with every other IBGP router (see Figure 2-36). As a result, the number of&lt;br /&gt;
peering sessions is reduced from n(n ​ 1)/2 to n ​ 1. A router reflector and its clients are known collectively as a cluster.&lt;br /&gt;
Figure 2-36. IBGP Clients in a Route Reflection Cluster Peer Only with the Route Reflector, Reducing the&lt;br /&gt;
Number of Necessary IBGP Connections&lt;br /&gt;
Route reflectors work by relaxing the rule that IBGP peers cannot advertise routes learned from other IBGP peers. In the internetwork&lt;br /&gt;
of Figure 2-36, for example, the route reflector learns routes from each of its clients. Unlike other IBGP routers, the RR can advertise&lt;br /&gt;
these routes to its other clients and to nonclient peers. In other words, the routes from one IBGP client are reflected from the RR to the&lt;br /&gt;
other clients. To avoid possible routing loops or other routing errors, the route reflector cannot change the attributes of the routes it&lt;br /&gt;
receives from clients.&lt;br /&gt;
A client router in a route reflection cluster can peer with external neighbors, but the only internal neighbor it can peer with is a route&lt;br /&gt;
reflector in its cluster or other clients in the cluster. However, the RR itself can peer with both internal and external neighbors outside&lt;br /&gt;
of the cluster and can reflect their routes to its clients (see Figure 2-37).Figure 2-37. Route Reflection Cluster Peering Relationships&lt;br /&gt;
If an RR receives multiple routes to the same destination, it uses the normal BGP decision process to select the best path. RFC 1966&lt;br /&gt;
defines three rules that the RR uses to determine who the route is advertised to, depending on how the route was learned:&lt;br /&gt;
If the route was learned from a nonclient IBGP peer, it is reflected to clients only.&lt;br /&gt;
If the route was learned from a client, it is reflected to all nonclients and clients, except for the originating client.&lt;br /&gt;
If the route was learned from an EBGP peer, it is reflected to all clients and nonclients.&lt;br /&gt;
The route reflector functionality has to be supported only on the route reflector itself. From the clients' perspectives, they are merely&lt;br /&gt;
peering with an internal neighbor. This is an attractive feature of route reflectors, because routers with relatively basic BGP&lt;br /&gt;
implementations can still be clients in a route reflection cluster.&lt;br /&gt;
The concept of route reflectors is similar to that of route servers, discussed earlier in this chapter. The primary purpose of both devices&lt;br /&gt;
is to reduce the number of required peering sessions by providing a single peering point for multiple neighbors. The neighbors then&lt;br /&gt;
depend on the one device to learn their routes. The difference between route reflectors and route servers is that route reflectors are&lt;br /&gt;
also routers, whereas route servers are not.&lt;br /&gt;
A single RR, like a single route server, introduces a single point of failure into a system. If the RR fails, the clients lose their only&lt;br /&gt;
source of NLRI. Therefore, for redundancy, a cluster can have more than one RR (see Figure 2-38). The clients have physical&lt;br /&gt;
connections to each of the route reflectors, and they peer to each. If one of the RRs fails, the clients still have a connection to the&lt;br /&gt;
other RR and do not lose reachability information.&lt;br /&gt;
Figure 2-38. A Cluster Can Have Multiple Route Reflectors for RedundancyNOTE&lt;br /&gt;
Although it is possible for a client to have a physical link to only one RR and still peer to multiple RRs, this setup defeats the purpose&lt;br /&gt;
of having redundancy. The client is still vulnerable to the failure of the single RR to which it is physically connected.&lt;br /&gt;
An AS also can have multiple clusters. Figure 2-39 shows an AS with two clusters. Each cluster has redundant route reflectors, and&lt;br /&gt;
the clusters themselves are interconnected redundantly.&lt;br /&gt;
Figure 2-39. Multiple Route Reflection Clusters Can Be Created Within a Single Autonomous System&lt;br /&gt;
Because clients do not know they are clients, a route reflector can itself be a client of another route reflector. As a result, you can build&lt;br /&gt;
&amp;quot;nested&amp;quot; route reflection clusters (see Figure 2-40).&lt;br /&gt;
Figure 2-40. A Route Reflector Can Be the Client of Another Route ReflectorAlthough clients cannot peer with routers outside of their own cluster, they can peer with each other. As a result, a route reflection&lt;br /&gt;
cluster can be fully meshed (see Figure 2-41). When the clients are fully meshed, the route reflector is configured so that it does not&lt;br /&gt;
reflect routes from one client to another. Instead, it reflects only routes from clients to its nonclient peers, and routes from nonclient&lt;br /&gt;
peers to clients.&lt;br /&gt;
Figure 2-41. A Route Reflection Cluster Can Be Fully MeshedRecall from the discussion in the section &amp;quot;IBGP and IGP Synchronization&amp;quot; that BGP cannot forward a route learned from one internal&lt;br /&gt;
peer to another internal peer, because the AS_PATH attribute does not change within an AS, and routing loops could result. Note,&lt;br /&gt;
however, that a route reflector is a BGP router in which this rule has been relaxed. To prevent routing loops, route reflectors use two&lt;br /&gt;
BGP path attributes: ORIGINATOR_ID and CLUSTER_LIST.&lt;br /&gt;
ORIGINATOR_ID is an optional, nontransitive attribute that is created by the route reflector. The ORIGINATOR_ID is the router ID of&lt;br /&gt;
the originator of a route within the local AS. A route reflector does not advertise a route back to the originator of the route;&lt;br /&gt;
nonetheless, if the originator receives an update with its own RID, the update is ignored.&lt;br /&gt;
Each cluster within an AS must be identified with a unique 4-octet cluster ID. If the cluster contains a single route reflector, the cluster&lt;br /&gt;
ID is the router ID of the route reflector. If the cluster contains multiple route reflectors, each RR must be manually configured with a&lt;br /&gt;
cluster ID.&lt;br /&gt;
CLUSTER_LIST is an optional, nontransitive attribute that tracks cluster IDs the same way that the AS_PATH attribute tracks AS&lt;br /&gt;
numbers. When an RR reflects a route from a client to a nonclient, it appends its cluster ID to the CLUSTER_LIST. If the&lt;br /&gt;
CLUSTER_LIST is empty, the RR creates one. When an RR receives an update, it checks the CLUSTER_LIST. If it sees its own&lt;br /&gt;
cluster ID in the list, it knows that a routing loop has occurred and ignores the update.&lt;br /&gt;
Confederations&lt;br /&gt;
Confederations are another way to control large numbers of IBGP peers. A confederation is an AS that has been subdivided into a&lt;br /&gt;
group of subautonomous systems, known as member autonomous systems (see Figure 2-42). The BGP speakers within the&lt;br /&gt;
confederation speak IBGP to peers in the same member AS and EBGP to peers in other member autonomous systems. The&lt;br /&gt;
confederation is assigned a confederation ID, which is represented to peers outside of the confederation as the AS number of the&lt;br /&gt;
entire confederation. External peers do not see the internal structure of the confederation; rather, they see a single AS. In Figure 2-42,&lt;br /&gt;
AS 9184 is the confederation ID.&lt;br /&gt;
Figure 2-42. A Typical Confederation&lt;br /&gt;
You are very familiar with the concept of subdividing entities for better manageability. IP subnets are subdivisions of IP networks, and&lt;br /&gt;
VLSM subdivides subnets. Similarly, autonomous systems are subdivisions of large internetworks (such as the Internet).&lt;br /&gt;
Confederations are subdivisions of autonomous systems.&lt;br /&gt;
The section &amp;quot;AS_SET&amp;quot; described two types of AS_PATH attributes: AS_SEQUENCE and AS_SET. Confederations add two more&lt;br /&gt;
types to the AS_PATH:AS_CONFED_SEQUENCE​ This is an ordered list of AS numbers along a path to a destination. It is used in exactly the same&lt;br /&gt;
way as the AS_SEQUENCE, except that the AS numbers in the list belong to autonomous systems within the local&lt;br /&gt;
confederation.&lt;br /&gt;
AS_CONFED_SET​ This is an unordered list of AS numbers along a path to a destination. It is used in exactly the same way as&lt;br /&gt;
the AS_SET, except that the AS numbers in the list belong to autonomous systems within the local confederation.&lt;br /&gt;
Because the AS_PATH attribute is used in updates between the member autonomous systems, loop avoidance is preserved. From&lt;br /&gt;
the perspective of a BGP router within a member AS, all peers in other member autonomous systems are external neighbors.&lt;br /&gt;
When an update is sent to a peer external to the confederation, the AS_CONFED_SEQUENCE and AS_CONFED_SET information is&lt;br /&gt;
stripped from the AS_PATH attribute, and the confederation ID is prepended to the AS_PATH. Because of this, external peers see the&lt;br /&gt;
confederation as a single AS rather than as a collection of autonomous systems. As Figure 2-42 shows, it is common practice to use&lt;br /&gt;
AS numbers from the reserved range 64512 to 65535 to number the member autonomous systems within a confederation.&lt;br /&gt;
When choosing a route, the BGP decision process remains the same, with one addition: EBGP routes external to the confederation&lt;br /&gt;
are preferred over EBGP routes to member autonomous systems, which are preferred over IBGP routes. Another difference between&lt;br /&gt;
confederations and standard autonomous systems is the way in which some attributes are handled. Attributes such as NEXT_HOP&lt;br /&gt;
and MED can be advertised unchanged to EBGP peers in another member AS within the confederation, and the LOCAL_PREF&lt;br /&gt;
attribute also can be sent.&lt;br /&gt;
Unlike route reflector environments in which only the route reflector itself has to support route reflection, all routers within a&lt;br /&gt;
confederation must support the confederation functionality. This support is necessary because all routers must be able to recognize&lt;br /&gt;
the AS_CONFED_SEQUENCE and AS_CONFED_SET types in the AS_PATH attribute. Because these AS_PATH types are removed&lt;br /&gt;
from routes advertised out of the confederation, however, routers in other autonomous systems do not have to support&lt;br /&gt;
confederations.&lt;br /&gt;
In very large autonomous systems, you can use confederations and route reflectors together. You can configure one or more RR&lt;br /&gt;
clusters within one or more member autonomous systems for even more optimal control of IBGP peers.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Pranala Menarik==&lt;br /&gt;
&lt;br /&gt;
* [[IPv6: Advanced Routing]]&lt;/div&gt;</summary>
		<author><name>Onnowpurbo</name></author>
	</entry>
</feed>