Professional Documents
Culture Documents
Networks - Chapter 5
Networks - Chapter 5
Class A Address
Class B Address
Class C Address
IP Address Range
Network Address
Broadcast Address
10
Network Address
11
Unicast Transmission
12
Broadcast Address
13
Broadcast Transmission
14
15
Private IP Addresses
16
17
18
19
20
21
22
23
24
Subnetting
25
Subnetting Chart
26
Subnetting Scheme
27
Subnetting Chart
28
29
30
Subnetting
31
Data Encapsulation
32
Routing
33
34
35
36
37
38
39
40
41
42
Routed Protocol
43
Routing Protocol
44
Path Determination
45
46
Routing Tables
47
48
Autonomous Systems
49
50
Routing Protocols
51
52
53
54
Each node (router or host) exchange information with neighboring nodes. Neighbors are both directly connected to same network Node maintains vector of link costs for each directly attached network and distance and next-hop vectors for each destination Used by Routing Information Protocol (RIP) Requires transmission of lots of information by each router
Distance vector to all neighbors Contains estimated path cost to all networks in configuration Changes take long time to propagate
55
56
57
58
59
60
61
All nodes of the graph represent Routers. In this example, router A receives the routing tables of its neighboring routers: A,I,H,K Router A computes its routing table based on the tables of its neighbors plus the delays it has with each of the four routers( JA: 8, JI: 10, JH: 12, JK: 6)
2004, Cisco Systems, Inc. All rights reserved.
62
Link-State Concepts
63
64
65
Link-State Concerns
66
Replace Routing Information Protocol (RIP) Uses link state routing strategy
Each router keeps list of state of local links to network Transmits update state information to all other routers Little traffic as messages are small and not sent often
67
68
69
70
71
72
73
74
Dijkistra Algorithm ((
1. Start with the local node (router): the root of the tree. 2. Assign a cost of 0 to this node and make it the first permanent node. 3. Examine each neighbor node of the node that was the last permanent node. 4. Assign a cumulative cost to each node and make it tentative. 5. Among the list of tentative nodes 5.1. Find the node with the smallest cumulative cost and make it permanent. 5.2. If a node can be reached from more than one direction 5.2.1. Select the direction with the shortest cumulative cost. 6. Repeat steps 3 to 5 until every node becomes permanent.
75
76
Summary
77