OID reference

bgpRmAfiSafiAddPathBestN

1.2.826.42.1.1578918.5.65.1.2.2.1.28

Description

The number of best paths to calculate as candidate BGP additional paths. DC-BGP calculates the N best paths for each destination as candidates for advertisement to BGP peers as additional paths. The candidate paths are the N best paths avoiding duplicate BGP next hops. They include the best path, and alternative lower…

Full description and source information

Identification

Identifier and names

Parent
1.2.826.42.1.1578918.5.65.1.2.2.1 (bgpRmAfiSafiEntry)
Node code
28
Node name
bgpRmAfiSafiAddPathBestN
Category
SNMP management object
Numeric OID
1.2.826.42.1.1578918.5.65.1.2.2.1.28
URN notation
urn:oid:1.2.826.42.1.1578918.5.65.1.2.2.1.28
ASN.1, OID-IRI and named path variants
ASN.1 notation

{1 2 826 42 1 1578918 5 65 1 2 2 1 28}

  • {iso(1) member-body(2) gb(826) 42 1 1578918 5 65 bgpMib(1) bgpRm(2) bgpRmAfiSafiTable(2) bgpRmAfiSafiEntry(1) bgpRmAfiSafiAddPathBestN(28)}
  • {iso(1) memberBody(2) gb(826) 42 1 1578918 5 65 bgpMib(1) bgpRm(2) bgpRmAfiSafiTable(2) bgpRmAfiSafiEntry(1) bgpRmAfiSafiAddPathBestN(28)}
OID-IRI notation
  • /1/2/826/42/1/1578918/5/65/1/2/2/1/28
  • /ISO/Member-Body/GB/42/1/1578918/5/65/1/2/2/1/28
  • /ISO/Member-Body/826/42/1/1578918/5/65/1/2/2/1/28
  • /ISO/2/826/42/1/1578918/5/65/1/2/2/1/28
Named path variants
  • /iso/member-body/gb/42/1/1578918/5/65/bgpMib/bgpRm/bgpRmAfiSafiTable/bgpRmAfiSafiEntry/bgpRmAfiSafiAddPathBestN
  • /iso/memberBody/gb/42/1/1578918/5/65/bgpMib/bgpRm/bgpRmAfiSafiTable/bgpRmAfiSafiEntry/bgpRmAfiSafiAddPathBestN

SNMP properties

Value type
Unsigned32
Maximum access defined by MIB
read-create
Status in MIB
current
Default value
1
Allowed ranges
1–255

Using this OID with SNMP

At least one MIB declaration places this object in a table row. A value belongs to a row instance; its suffix depends on the row's INDEX or AUGMENTS definition. The index encoding is not inferred here.

Published row index: bgpRmEntIndex, bgpRmAfiSafiAfi, bgpRmAfiSafiSafi.

snmpwalk [connection options] DEVICE .1.2.826.42.1.1578918.5.65.1.2.2.1.28

Replace the placeholders with your connection and authentication options. Available permissions and device support can differ from the MIB.

Properties come from available MIB definitions. Actual device support and access can differ. See source records below for original files and qualifications.

The displayed source records contain one distinct definition. Compare its source records.

bgpRmAfiSafiAddPathBestN OBJECT-TYPE
    SYNTAX      Unsigned32 (1..255)
    MAX-ACCESS  read-create
    STATUS      current
    DESCRIPTION "The number of best paths to calculate as candidate BGP
                 additional paths.

                 DC-BGP calculates the N best paths for each destination as
                 candidates for advertisement to BGP peers as additional
                 paths.

                 The candidate paths are the N best paths avoiding duplicate
                 BGP next hops.  They include the best path, and alternative
                 lower preference / higher cost paths.

                 For the default value of 1 the only candidate path is the
                 best path for each destination.

                 A value of 2 is sufficient to calculate the best path and
                 a backup path (if available) for each destination.

                 For small values of N the benefit of fast convergence after
                 N-1 failures can outweigh the cost of calculating and
                 advertising the best N routes, but for larger values of N
                 the benefit does not justify the cost.  Therefore this field
                 should only be set to a small value.

                 The number of paths advertised to each BGP peer can be
                 restricted at the BGP peer or peer group level
                 (bgpPeerAfiSafiAddPathBestN or
                 bgpPeergrAfiSafiAddPathBestN), but it is not possible to
                 advertise more paths than are specified here as candidates.

                 This field can only be modified while RM is admin down."
    DEFVAL { 1 }
    ::= { bgpRmAfiSafiEntry 28 }

Meaning

Descriptions

1 unique

Identical descriptions are grouped. Different wording and device-specific notes are retained.

The number of best paths to calculate as candidate BGP additional paths. DC-BGP calculates the N best paths for each destination as candidates for advertisement to BGP peers as additional paths. The candidate paths are the N best paths avoiding duplicate BGP next hops. They include the best path, and alternative lower preference / higher cost paths. For the default value of 1 the only candidate path is the best path for each destination. A value of 2 is sufficient to calculate the best path and a backup path (if available) for each destination. For small values of N the benefit of fast convergence after N-1 failures can outweigh the cost of calculating and advertising the best N routes, but for larger values of N the benefit does not justify the cost. Therefore this field should only be set to a small value. The number of paths advertised to each BGP peer can be restricted at the BGP peer or peer group level (bgpPeerAfiSafiAddPathBestN or bgpPeergrAfiSafiAddPathBestN), but it is not possible to advertise more paths than are specified here as candidates. This field can only be modified while RM is admin down.

Sources for this description

Multiple manufacturers; see the original MIB MIB copies (LibreNMS/Observium Community)

See 1 matching source record

Evidence

Source records

1 records

Matching descriptions are grouped; open a group to compare definitions and supporting files.

Records for description 1Multiple manufacturers; see the original MIB MIB copies (LibreNMS/Observium Community)1 record · 1 source

Description 1

bgpRmAfiSafiAddPathBestN · currentMultiple manufacturers; see the original MIB MIB copies (LibreNMS/Observium Community)1 source

Status in source: current.

Names: bgpRmAfiSafiAddPathBestN

Technical details
{
  "smi_kind": "OBJECT-TYPE",
  "definition": [
    "bgpRmAfiSafiAddPathBestN",
    "OBJECT-TYPE",
    "SYNTAX",
    "Unsigned32",
    "(",
    "1",
    ".",
    ".",
    "255",
    ")",
    "MAX-ACCESS",
    "read-create",
    "STATUS",
    "current",
    "DESCRIPTION",
    "\"The number of best paths to calculate as candidate BGP additional paths. DC-BGP calculates the N best paths for each destination as candidates for advertisement to BGP peers as additional paths. The candidate paths are the N best paths avoiding duplicate BGP next hops. They include the best path, and alternative lower preference / higher cost paths. For the default value of 1 the only candidate path is the best path for each destination. A value of 2 is sufficient to calculate the best path and a backup path (if available) for each destination. For small values of N the benefit of fast convergence after N-1 failures can outweigh the cost of calculating and advertising the best N routes, but for larger values of N the benefit does not justify the cost. Therefore this field should only be set to a small value. The number of paths advertised to each BGP peer can be restricted at the BGP peer or peer group level (bgpPeerAfiSafiAddPathBestN or bgpPeergrAfiSafiAddPathBestN), but it is not possible to advertise more paths than are specified here as candidates. This field can only be modified while RM is admin down.\"",
    "DEFVAL",
    "{",
    "1",
    "}",
    "::=",
    "{",
    "bgpRmAfiSafiEntry",
    "28",
    "}"
  ],
  "syntax_tree": [
    [
      "ApplicationSyntax",
      "Unsigned32",
      [
        "integerSubType",
        [
          [
            1,
            255
          ]
        ]
      ]
    ],
    null,
    [
      "MaxAccessPart",
      "read-create"
    ],
    [
      "Status",
      "current"
    ],
    [
      "DESCRIPTION",
      "The number of best paths to calculate as candidate BGP additional paths. DC-BGP calculates the N best paths for each destination as candidates for advertisement to BGP peers as additional paths. The candidate paths are the N best paths avoiding duplicate BGP next hops. They include the best path, and alternative lower preference / higher cost paths. For the default value of 1 the only candidate path is the best path for each destination. A value of 2 is sufficient to calculate the best path and a backup path (if available) for each destination. For small values of N the benefit of fast convergence after N-1 failures can outweigh the cost of calculating and advertising the best N routes, but for larger values of N the benefit does not justify the cost. Therefore this field should only be set to a small value. The number of paths advertised to each BGP peer can be restricted at the BGP peer or peer group level (bgpPeerAfiSafiAddPathBestN or bgpPeergrAfiSafiAddPathBestN), but it is not possible to advertise more paths than are specified here as candidates. This field can only be modified while RM is admin down."
    ],
    null,
    null,
    null,
    [
      "DEFVAL",
      1
    ]
  ]
}

Registration

Registration authorities

First Registration Authority (inferred from ancestor 1.2.826)

The UK Name Registration Authority

Current Registration Authority (inferred from ancestor 1.2.826)

Mark Barratt or Vanessa Tatler

Siblings (41)

OIDNameDirect childrenDescendantsDescription
1.2.826.42.1.1578918.5.65.1.2.2.1.2 bgpRmAfiSafiAfi00
1.2.826.42.1.1578918.5.65.1.2.2.1.3 bgpRmAfiSafiSafi00
1.2.826.42.1.1578918.5.65.1.2.2.1.4 bgpRmAfiSafiAdminStatus00
1.2.826.42.1.1578918.5.65.1.2.2.1.5 bgpRmAfiSafiStateKept00
1.2.826.42.1.1578918.5.65.1.2.2.1.6 bgpRmAfiSafiAfmRequired00
1.2.826.42.1.1578918.5.65.1.2.2.1.7 bgpRmAfiSafiLocRibBlocked00
1.2.826.42.1.1578918.5.65.1.2.2.1.8 bgpRmAfiSafiAdvertiseInactive00
1.2.826.42.1.1578918.5.65.1.2.2.1.9 bgpRmAfiSafiUserData00
1.2.826.42.1.1578918.5.65.1.2.2.1.10 bgpRmAfiSafiIbgpPrefixes00
1.2.826.42.1.1578918.5.65.1.2.2.1.11 bgpRmAfiSafiEbgpPrefixes00
1.2.826.42.1.1578918.5.65.1.2.2.1.12 bgpRmAfiSafiRedistPrefixes00
1.2.826.42.1.1578918.5.65.1.2.2.1.13 bgpRmAfiSafiInPrfxes00
1.2.826.42.1.1578918.5.65.1.2.2.1.14 bgpRmAfiSafiInPrfxesAccepted00
1.2.826.42.1.1578918.5.65.1.2.2.1.15 bgpRmAfiSafiInPrfxesRejected00
1.2.826.42.1.1578918.5.65.1.2.2.1.16 bgpRmAfiSafiOutPrfxes00
1.2.826.42.1.1578918.5.65.1.2.2.1.17 bgpRmAfiSafiOutPrfxesAdvertised00
1.2.826.42.1.1578918.5.65.1.2.2.1.18 bgpRmAfiSafiInPrfxesActive00
1.2.826.42.1.1578918.5.65.1.2.2.1.19 bgpRmAfiSafiInPrfxesFlapped00
1.2.826.42.1.1578918.5.65.1.2.2.1.20 bgpRmAfiSafiInPrfxesFlapSuppr00
1.2.826.42.1.1578918.5.65.1.2.2.1.21 bgpRmAfiSafiInPrfxesFlapHistory00
1.2.826.42.1.1578918.5.65.1.2.2.1.22 bgpRmAfiSafiDefaultImportRule00
1.2.826.42.1.1578918.5.65.1.2.2.1.23 bgpRmAfiSafiInPrfxesDeniedByPol00
1.2.826.42.1.1578918.5.65.1.2.2.1.24 bgpRmAfiSafiNumLocRibRoutes00
1.2.826.42.1.1578918.5.65.1.2.2.1.25 bgpRmAfiSafiNextHopSafi00
1.2.826.42.1.1578918.5.65.1.2.2.1.26 bgpRmAfiSafiNumLocRibBestRoutes00
1.2.826.42.1.1578918.5.65.1.2.2.1.27 bgpRmAfiSafiAddPathCapCfg00
1.2.826.42.1.1578918.5.65.1.2.2.1.29 bgpRmAfiSafiCheckMartians00
1.2.826.42.1.1578918.5.65.1.2.2.1.30 bgpRmAfiSafiDefaultMetric00
1.2.826.42.1.1578918.5.65.1.2.2.1.31 bgpRmAfiSafiFlapConfigIndex00
1.2.826.42.1.1578918.5.65.1.2.2.1.32 bgpRmAfiSafiFlapConfigMap00
1.2.826.42.1.1578918.5.65.1.2.2.1.33 bgpRmAfiSafiIGPMetricIgnore00
1.2.826.42.1.1578918.5.65.1.2.2.1.34 bgpRmAfiSafiNumLocRibNextHops00
1.2.826.42.1.1578918.5.65.1.2.2.1.35 bgpRmAfiSafiNumLocRibECMPRoutes00
1.2.826.42.1.1578918.5.65.1.2.2.1.36 bgpRmAfiSafiTotNumPrefixAllocs00
1.2.826.42.1.1578918.5.65.1.2.2.1.37 bgpRmAfiSafiTotNumRouteAllocs00
1.2.826.42.1.1578918.5.65.1.2.2.1.38 bgpRmAfiSafiTotNumPrefixFrees00
1.2.826.42.1.1578918.5.65.1.2.2.1.39 bgpRmAfiSafiTotNumRouteFrees00
1.2.826.42.1.1578918.5.65.1.2.2.1.40 bgpRmAfiSafiMaExtCommList00
1.2.826.42.1.1578918.5.65.1.2.2.1.41 bgpRmAfiSafiMaxIBgpEcmpRoutes00
1.2.826.42.1.1578918.5.65.1.2.2.1.42 bgpRmAfiSafiMaxEBgpEcmpRoutes00
1.2.826.42.1.1578918.5.65.1.2.2.1.43 bgpRmAfiSafiInstallBestNPaths00