D-Link DFL-2500 User Guide - Page 93

area ID, router ID, backbone area, Virtual Link VLink

Page 93 highlights

74 Chapter 10. Routing • Bandwidth - Bandwidth is the traffic capacity of a path, rated by "Mbps". • Load - Load refers to the usage of a router. The usage can be evaluated by CPU utilization and the throughput. • Delay - Delay is regarding to the time it takes to move a packet from the source to the destination. The time depends on many factors, such as the bandwidth, load, and the length of the path. Different routing protocols rely on one or several metrics to examine and evaluate the links in the network. Regarding the goals of the design, the algorithm uses its metrics to decide the optimal paths. 10.3.3 OSPF OSPF is the embedded dynamic routing algorithm in D-Link firewalls. From the previous section, we see the main characteristics of OSPF as a Link state routing algorithm. Now we look at the actual operation of this algorithm. Areas & Routers OSPF features hierarchical routing to give better support to complex network environment. Since today's network is getting more and more sophisticated, the size of the whole routing table, time required for routing computation, and the traffic for information exchange for a large network become excessive. OSPF enables the administrator to partition the AS(autonomous system) into several smaller areas, so that the burden for routing computation and routes maintenance on each router is reduced. An OSPF area is a group of computer hosts and routers within an AS, identified by a unique area ID, and every OSPF router has a unique router ID with the format of an IP address. On top of the OSPF hierarchy is a central area called backbone area to which all the other areas in the AS must connect. The backbone area is responsible for distributing routing information among all the connecting areas and has the area ID 0.0.0.0. In some cases where it is not possible to physically connect to the backbone area, a Virtual Link (VLink) can be 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

74
Chapter 10. Routing
Bandwidth
– Bandwidth is the traffic capacity of a path, rated by ”Mbps”.
Load
– Load refers to the usage of a router. The usage can be evaluated by
CPU utilization and the throughput.
Delay
– Delay is regarding to the time it takes to move a packet from the
source to the destination. The time depends on many factors, such as
the bandwidth, load, and the length of the path.
Different routing protocols rely on one or several metrics to examine and
evaluate the links in the network. Regarding the goals of the design, the
algorithm uses its metrics to decide the optimal paths.
10.3.3
OSPF
OSPF is the embedded dynamic routing algorithm in D-Link firewalls.
From the previous section, we see the main characteristics of OSPF as a
Link state routing algorithm. Now we look at the actual operation of this
algorithm.
Areas & Routers
OSPF features hierarchical routing to give better support to complex
network environment. Since today’s network is getting more and more
sophisticated, the size of the whole routing table, time required for routing
computation, and the traffic for information exchange for a large network
become excessive. OSPF enables the administrator to partition the
AS(autonomous system) into several smaller areas, so that the burden for
routing computation and routes maintenance on each router is reduced.
An OSPF area is a group of computer hosts and routers within an AS,
identified by a unique
area ID
, and every OSPF router has a unique
router ID
with the format of an IP address.
On top of the OSPF hierarchy is a central area called
backbone area
to
which all the other areas in the AS must connect. The backbone area is
responsible for distributing routing information among all the connecting
areas and has the area ID 0.0.0.0. In some cases where it is not possible to
physically connect to the backbone area, a
Virtual Link (VLink)
can be
D-Link Firewalls User’s Guide