D-Link DES-3326SRM Product Manual - Page 173

Building Adjacency, Adjacencies on Point-to-Point Interfaces, OSPF Packet Formats

Page 173 highlights

D-Link DES-3326S Layer 3 Switch Building Adjacency Two routers undergo a multi-step process in building the adjacency relationship. The following is a simplified description of the steps required: • Down − No information has been received from any router on the segment. • Attempt − On non-broadcast multi-access networks (such as Frame Relay or X.25), this state indicates that no recent information has been received from the neighbor. An effort should be made to contact the neighbor by sending Hello packets at the reduced rate set by the Poll Interval. • Init − The interface has detected a Hello packet coming from a neighbor but bi-directional communication has not yet been established. • Two-way − Bi-directional communication with a neighbor has been established. The router has seen its address in the Hello packets coming from a neighbor. At the end of this stage the DR and BDR election would have been done. At the end of the Two-way stage, routers will decide whether to proceed in building an adjacency or not. The decision is based on whether one of the routers is a DR or a BDR or the link is a point-to-point or virtual link. • Exstart − (Exchange Start) Routers establish the initial sequence number that is going to be used in the information exchange packets. The sequence number insures that routers always get the most recent information. One router will become the primary and the other will become secondary. The primary router will poll the secondary for information. • Exchange − Routers will describe their entire link-state database by sending database description packets. • Loading − The routers are finalizing the information exchange. Routers have link-state request list and a link-state retransmission list. Any information that looks incomplete or outdated will be put on the request list. Any update that is sent will be put on the retransmission list until it gets acknowledged. • Full − The adjacency is now complete. The neighboring routers are fully adjacent. Adjacent routers will have the same link-state database. Adjacencies on Point-to-Point Interfaces OSPF Routers that are linked using point-to-point interfaces (such as serial links) will always form adjacencies. The concepts of DR and BDR are unnecessary. OSPF Packet Formats All OSPF packet types begin with a standard 24 byte header and there are five packet types. The header is described first, and each packet type is described in a subsequent section. All OSPF packets (except for Hello packets) forward link-state advertisements. Link-State Update packets, for example, flood advertisements throughout the OSPF routing domain. • OSPF packet header • Hello packet • Database Description packet • Link-State Request packet • The Link-State Update packet • Link-State Acknowledgment packet The OSPF Packet Header Every OSPF packet is preceded by a common 24 byte header. This header contains the information necessary for a receiving router to determine if the packet should be accepted for further processing. The format of the OSPP packet header is shown below: 163

  • 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

D-Link DES-3326S Layer 3 Switch
Building Adjacency
Two routers undergo a multi-step process in building the adjacency relationship.
The following is a simplified description of
the steps required:
Down
No information has been received from any router on the segment.
Attempt
On non-broadcast multi-access networks (such as Frame Relay or X.25), this state indicates that no recent
information has been received from the neighbor.
An effort should be made to contact the neighbor by sending Hello
packets at the reduced rate set by the Poll Interval.
Init
The interface has detected a Hello packet coming from a neighbor but bi-directional communication has not yet
been established.
Two-way
Bi-directional communication with a neighbor has been established.
The router has seen its address in the
Hello packets coming from a neighbor. At the end of this stage the DR and BDR election would have been done.
At
the end of the Two-way stage, routers will decide whether to proceed in building an adjacency or not.
The decision is
based on whether one of the routers is a DR or a BDR or the link is a point-to-point or virtual link.
Exstart
(Exchange Start) Routers establish the initial sequence number that is going to be used in the information
exchange packets.
The sequence number insures that routers always get the most recent information.
One router will
become the primary and the other will become secondary.
The primary router will poll the secondary for information.
Exchange
Routers will describe their entire link-state database by sending database description packets.
Loading
The routers are finalizing the information exchange.
Routers have link-state request list and a link-state
retransmission list.
Any information that looks incomplete or outdated will be put on the request list.
Any update that
is sent will be put on the retransmission list until it gets acknowledged.
Full
The adjacency is now complete.
The neighboring routers are fully adjacent.
Adjacent routers will have the
same link-state database.
Adjacencies on Point-to-Point Interfaces
OSPF Routers that are linked using point-to-point interfaces (such as serial links) will always form adjacencies.
The concepts
of DR and BDR are unnecessary.
OSPF Packet Formats
All OSPF packet types begin with a standard 24 byte header and there are five packet types.
The header is described first, and
each packet type is described in a subsequent section.
All OSPF packets (except for Hello packets) forward link-state advertisements.
Link-State Update packets, for example, flood
advertisements throughout the OSPF routing domain.
OSPF packet header
Hello packet
Database Description packet
Link-State Request packet
The Link-State Update packet
Link-State Acknowledgment packet
The OSPF Packet Header
Every OSPF packet is preceded by a common 24 byte header.
This header contains the information necessary for a receiving
router to determine if the packet should be accepted for further processing.
The format of the OSPP packet header is shown below:
163