D-Link DFL-2500 User Guide - Page 90

Routing Algorithms

Page 90 highlights

10.3. Routing Algorithms 71 world. Routers inside an AS run the same routing algorithm and they only need to know the topology of the area. There are special gateway routers in the ASs that are responsible for routing packets from internal area to various outside ASs. Gateway routers run inter-AS routing algorithm to determine the paths toward the destinations locating in other ASs. Intra-AS routers all maintain relationships with the gateway router to route packets out. The most prevalent intra-AS(interior gateway) routing algorithms are covered in the next section. 10.3 Routing Algorithms A routing algorithm is an operator of the routing table. In the internetworking environment, there are typically several paths between two communication entities. The task of the routing algorithm is that given a set of intermediate routing devices with different links connecting them, the algorithm calculates a "best" path for two ends to communicate and appends the path into the table. In case of a device failure (a down link) in a selected path or other problems that make the path unreachable, the algorithm selects the next best route and updates the routing table to maintain the content of the table correct. Many routing algorithms have been proposed and each features different design for different goals. The most widely implemented algorithms can be categorized into two classes: Static Routing & Dynamic Routing. 10.3.1 Static Routing Static routing is a term used to refer to the manually configuration of the routing table. The network administrators need to plan the routing table, and manually add every necessary route and related information into the table for successful packet forwarding. Any change on one path would require the administrator to update the information in every affected router. As a result, the administration work in a large scale network environment can be very cumbersome and error prone. In the case that a route is not properly configured into the routing table, the router looks up in the table to make path determination and no suitable route can be found, it will D-Link Firewalls User's Guide

  • 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

10.3. Routing Algorithms
71
world.
Routers inside an AS run the same routing algorithm and they only need to
know the topology of the area. There are special
gateway routers
in the
ASs that are responsible for routing packets from internal area to various
outside ASs. Gateway routers run
inter-AS routing
algorithm to determine
the paths toward the destinations locating in other ASs. Intra-AS routers
all maintain relationships with the gateway router to route packets out.
The most prevalent intra-AS(interior gateway) routing algorithms are
covered in the next section.
10.3
Routing Algorithms
A routing algorithm is an operator of the routing table. In the
internetworking environment, there are typically several paths between two
communication entities. The task of the routing algorithm is that given a
set of intermediate routing devices with different links connecting them, the
algorithm calculates a ”best” path for two ends to communicate and
appends the path into the table.
In case of a device failure (a down link) in a selected path or other problems
that make the path unreachable, the algorithm selects the next best route
and updates the routing table to maintain the content of the table correct.
Many routing algorithms have been proposed and each features different
design for different goals. The most widely implemented algorithms can be
categorized into two classes:
Static Routing & Dynamic Routing
.
10.3.1
Static Routing
Static routing
is a term used to refer to the manually configuration of the
routing table. The network administrators need to plan the routing table,
and manually add every necessary route and related information into the
table for successful packet forwarding. Any change on one path would
require the administrator to update the information in every affected
router.
As a result, the administration work in a large scale network environment
can be very cumbersome and error prone. In the case that a route is not
properly configured into the routing table, the router looks up in the table
to make path determination and no suitable route can be found, it will
D-Link Firewalls User’s Guide