HP 6125XLG R2306-HP 6125XLG Blade Switch Layer 3 - IP Routing Configuration Gu - Page 13

Dynamic routing protocols, Route preference

Page 13 highlights

• Pre-Preference of the route. Among routes to the same destination, the route with the highest preference is optimal. • Cost-If multiple routes to a destination have the same preference, the one with the smallest cost is the optimal route. • NextHop-Next hop. • Interface-Output interface. Dynamic routing protocols Static routes work well in small, stable networks. They are easy to configure and require fewer system resources. However, in networks where topology changes occur frequently, a typical practice is to configure a dynamic routing protocol. Compared with static routing, a dynamic routing protocol is complicated to configure, requires more routers resources, and consumes more network resources. Dynamic routing protocols dynamically collect and report reachability information to adapt to topology changes. They are suitable for large networks. Dynamic routing protocols can be classified by different criteria, as shown in Table 2. Table 2 Categories of dynamic routing protocols Criterion Operation scope Routing algorithm Destination address type IP version Categories • IGPs-Work within an AS. Examples include RIP, OSPF, and IS-IS. • EGPs-Work between ASs. The most popular EGP is BGP. • Distance-vector protocols-Examples include RIP and BGP. BGP is also considered a path-vector protocol. • Link-state protocols-Examples include OSPF and IS-IS. • Unicast routing protocols-Examples include RIP, OSPF, BGP, and IS-IS. • Multicast routing protocols-Examples include PIM-SM and PIM-DM. • IPv4 routing protocols-Examples include RIP, OSPF, BGP, and IS-IS. • IPv6 routing protocols-Examples include RIPng, OSPFv3, IPv6 BGP, and IPv6 IS-IS. An AS refers to a group of routers that use the same routing policy and work under the same administration. Route preference Routing protocols, including static and direct routing, each by default have a preference. If they find multiple routes to the same destination, the router selects the route with the highest preference as the optimal route. The preference of a direct route is always 0 and cannot be changed. You can configure a preference for each static route and each dynamic routing protocol. The following table lists the route types and default preferences. The smaller the value, the higher the preference. Table 3 Route types and default route preferences Route type Direct route Preference 0 2

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30
  • 31
  • 32
  • 33
  • 34
  • 35
  • 36
  • 37
  • 38
  • 39
  • 40
  • 41
  • 42
  • 43
  • 44
  • 45
  • 46
  • 47
  • 48
  • 49
  • 50
  • 51
  • 52
  • 53
  • 54
  • 55
  • 56
  • 57
  • 58
  • 59
  • 60
  • 61
  • 62
  • 63
  • 64
  • 65
  • 66
  • 67
  • 68
  • 69
  • 70
  • 71
  • 72
  • 73
  • 74
  • 75
  • 76
  • 77
  • 78
  • 79
  • 80
  • 81
  • 82
  • 83
  • 84
  • 85
  • 86
  • 87
  • 88
  • 89
  • 90
  • 91
  • 92
  • 93
  • 94
  • 95
  • 96
  • 97
  • 98
  • 99
  • 100
  • 101
  • 102
  • 103
  • 104
  • 105
  • 106
  • 107
  • 108
  • 109
  • 110
  • 111
  • 112
  • 113
  • 114
  • 115
  • 116
  • 117
  • 118
  • 119
  • 120
  • 121
  • 122
  • 123
  • 124
  • 125
  • 126
  • 127
  • 128
  • 129
  • 130
  • 131
  • 132
  • 133
  • 134
  • 135
  • 136
  • 137
  • 138
  • 139
  • 140
  • 141
  • 142
  • 143
  • 144
  • 145
  • 146
  • 147
  • 148
  • 149
  • 150
  • 151
  • 152
  • 153
  • 154
  • 155
  • 156
  • 157
  • 158
  • 159
  • 160
  • 161
  • 162
  • 163
  • 164
  • 165
  • 166
  • 167
  • 168
  • 169
  • 170
  • 171
  • 172
  • 173
  • 174
  • 175
  • 176
  • 177
  • 178
  • 179
  • 180
  • 181
  • 182
  • 183
  • 184
  • 185
  • 186
  • 187
  • 188
  • 189
  • 190
  • 191
  • 192
  • 193
  • 194
  • 195
  • 196
  • 197
  • 198
  • 199
  • 200
  • 201
  • 202
  • 203
  • 204
  • 205
  • 206
  • 207
  • 208
  • 209
  • 210
  • 211
  • 212
  • 213
  • 214
  • 215
  • 216
  • 217
  • 218
  • 219
  • 220
  • 221
  • 222
  • 223
  • 224
  • 225
  • 226
  • 227
  • 228
  • 229
  • 230
  • 231
  • 232
  • 233
  • 234
  • 235
  • 236
  • 237
  • 238
  • 239
  • 240
  • 241
  • 242
  • 243
  • 244
  • 245
  • 246
  • 247
  • 248
  • 249
  • 250
  • 251
  • 252
  • 253
  • 254
  • 255
  • 256
  • 257
  • 258
  • 259
  • 260
  • 261
  • 262
  • 263
  • 264
  • 265
  • 266
  • 267
  • 268
  • 269
  • 270
  • 271
  • 272
  • 273
  • 274
  • 275
  • 276
  • 277
  • 278
  • 279
  • 280
  • 281
  • 282
  • 283
  • 284
  • 285
  • 286
  • 287
  • 288
  • 289
  • 290
  • 291
  • 292
  • 293
  • 294
  • 295
  • 296
  • 297
  • 298
  • 299
  • 300
  • 301
  • 302
  • 303
  • 304
  • 305
  • 306
  • 307
  • 308
  • 309
  • 310
  • 311
  • 312
  • 313
  • 314
  • 315
  • 316
  • 317
  • 318
  • 319
  • 320
  • 321
  • 322
  • 323
  • 324
  • 325
  • 326
  • 327
  • 328
  • 329
  • 330
  • 331
  • 332
  • 333
  • 334
  • 335
  • 336
  • 337
  • 338
  • 339
  • 340
  • 341
  • 342
  • 343
  • 344
  • 345
  • 346
  • 347
  • 348
  • 349
  • 350
  • 351
  • 352
  • 353
  • 354
  • 355
  • 356
  • 357
  • 358
  • 359
  • 360
  • 361
  • 362
  • 363
  • 364
  • 365
  • 366
  • 367
  • 368
  • 369
  • 370
  • 371
  • 372
  • 373
  • 374
  • 375
  • 376
  • 377
  • 378
  • 379
  • 380
  • 381
  • 382
  • 383
  • 384
  • 385
  • 386
  • 387
  • 388
  • 389
  • 390
  • 391
  • 392
  • 393
  • 394
  • 395
  • 396
  • 397
  • 398
  • 399
  • 400
  • 401
  • 402
  • 403
  • 404
  • 405
  • 406
  • 407
  • 408
  • 409
  • 410
  • 411
  • 412
  • 413
  • 414

2
Pre
—Preference of the route. Among routes to the same destination, the route with the highest
preference is optimal.
Cost
—If multiple routes to a destination have the same preference, the one with the smallest cost is
the optimal route.
NextHop
—Next hop.
Interface
—Output interface.
Dynamic routing protocols
Static routes work well in small, stable networks. They are easy to configure and require fewer system
resources. However, in networks where topology changes occur frequently, a typical practice is to
configure a dynamic routing protocol. Compared with static routing, a dynamic routing protocol is
complicated to configure, requires more routers resources, and consumes more network resources.
Dynamic routing protocols dynamically collect and report reachability information to adapt to topology
changes. They are suitable for large networks.
Dynamic routing protocols can be classified by different criteria, as shown in
Table 2
.
Table 2
Categories of dynamic routing protocols
Criterion
Categories
Operation scope
IGPs
—Work within an AS. Examples include RIP, OSPF, and IS-IS.
EGPs
—Work between ASs. The most popular EGP is BGP.
Routing algorithm
Distance-vector protocols
—Examples include RIP and BGP. BGP is also considered
a path-vector protocol.
Link-state protocols
—Examples include OSPF and IS-IS.
Destination address
type
Unicast routing protocols
—Examples include RIP, OSPF, BGP, and IS-IS.
Multicast routing protocols
—Examples include PIM-SM and PIM-DM.
IP version
IPv4 routing protocols
—Examples include RIP, OSPF, BGP, and IS-IS.
IPv6 routing protocols
—Examples include RIPng, OSPFv3, IPv6 BGP, and IPv6 IS-IS.
An AS refers to a group of routers that use the same routing policy and work under the same
administration.
Route preference
Routing protocols, including static and direct routing, each by default have a preference. If they find
multiple routes to the same destination, the router selects the route with the highest preference as the
optimal route.
The preference of a direct route is always 0 and cannot be changed. You can configure a preference for
each static route and each dynamic routing protocol. The following table lists the route types and default
preferences. The smaller the value, the higher the preference.
Table 3
Route types and default route preferences
Route type
Preference
Direct route
0