Vault sync: 2021-11-06 14:52:11
This commit is contained in:
parent
4604bbd9f4
commit
5c305ace2b
6
.obsidian/workspace
vendored
6
.obsidian/workspace
vendored
@ -9,7 +9,7 @@
|
||||
"state": {
|
||||
"type": "markdown",
|
||||
"state": {
|
||||
"file": "School/Analyse/Network Hardware.md",
|
||||
"file": "School/Analyse/Layers/3. Network Layer.md",
|
||||
"mode": "source"
|
||||
}
|
||||
}
|
||||
@ -68,7 +68,7 @@
|
||||
"state": {
|
||||
"type": "backlink",
|
||||
"state": {
|
||||
"file": "School/Analyse/Network Hardware.md",
|
||||
"file": "School/Analyse/Layers/3. Network Layer.md",
|
||||
"collapseAll": false,
|
||||
"extraContext": false,
|
||||
"sortOrder": "alphabetical",
|
||||
@ -87,9 +87,9 @@
|
||||
},
|
||||
"active": "bc6e8ad9aa0f44c3",
|
||||
"lastOpenFiles": [
|
||||
"School/Analyse/Layers/3. Network Layer.md",
|
||||
"School/Analyse/Network Hardware.md",
|
||||
"School/Analyse/Computer Networks.md",
|
||||
"School/Analyse/Layers/3. Network Layer.md",
|
||||
"School/Analyse/Layers/4. Transport Layer.md",
|
||||
"School/Analyse/Layers/2. Datalink Layer.md",
|
||||
"School/Analyse/Network Types.md",
|
||||
|
@ -50,3 +50,32 @@ Network ID is marked as bold.
|
||||
- Address:
|
||||
**195.210**.23.14
|
||||
|
||||
## Router
|
||||
Router is a member of multiple networks.
|
||||
|
||||
![[routers-example.png]]
|
||||
|
||||
For each connection to a network a routers uses a network interface card (NIC) and a IP address.
|
||||
|
||||
This way a router can have multiple IP addresses.
|
||||
|
||||
Each connection is identified by a interface, label or an address.
|
||||
|
||||
Example of a routing table:
|
||||
![[routing-table.png]]
|
||||
|
||||
### Updating router tables
|
||||
Routers are responsible for updating routing tables themselves.
|
||||
|
||||
When a router detects a change in connections, it immediately informs other routers about it.
|
||||
|
||||
Routers use optimum route finding algorithms to update their tables.
|
||||
|
||||
Exchanging routing information between routers is done periodically even when there is no change in the network.
|
||||
|
||||
The most commonly used routing algorithms are:
|
||||
- Distance vector routing (RIP)
|
||||
- Link-state Routing (OSPF, IS-IS)
|
||||
|
||||
## Addressing problem
|
||||
|
||||
|
@ -35,10 +35,20 @@ Example of a routing table:
|
||||
![[routing-table.png]]
|
||||
|
||||
### Updating router tables
|
||||
|
||||
Routers are responsible for updating routing tables themselves.
|
||||
|
||||
When a router detects a change in connections, it immedia
|
||||
When a router detects a change in connections, it immediately informs other routers about it.
|
||||
|
||||
Routers use optimum route finding algorithms to update their tables.
|
||||
|
||||
Exchanging routing information between routers is done periodically even when there is no change in the network.
|
||||
|
||||
The most commonly used routing algorithms are:
|
||||
- Distance vector routing (RIP)
|
||||
- Link-state Routing (OSPF, IS-IS)
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user