version 2, including all changes.
.
| Rev |
Author |
# |
Line |
| 1 |
LindsayDruett |
1 |
!!!OSPF vs IS-IS |
| |
|
2 |
|
| |
|
3 |
OSPF and IS-IS are both link-state protocols and are based on the Dijkstra algorithm of the Shortest Path First (SPF). In addition, they both have a two-level hierarchy. |
| |
|
4 |
|
| |
|
5 |
OSPF tends to be deployed mostly as an enterprise solution, whereas Integrated IS-IS is used for IP routing in some ISP networks. |
| |
|
6 |
|
| |
|
7 |
|__IS-IS Terminology__|__OSPF Terminology__ |
| |
|
8 |
|Area|Stub area |
| |
|
9 |
|Area ID|Area ID |
| |
|
10 |
|Backbone Area|Backbone Area |
| |
|
11 |
|DIS (Designated Intermediate System)|Designated Router |
| |
|
12 |
|Domain|Network |
| |
|
13 |
|ES (End System)|Host |
| |
|
14 |
|ES-IS (The Address Resolution feature of ES-IS)|ARP (Address Resolution Protocol) |
| |
|
15 |
|IS (Intermediate System)|Router |
| |
|
16 |
|ISO Routing Domain|Autonomous System |
| |
|
17 |
|Level 1|Internal Nonbackbone Stub Area |
| |
|
18 |
|Level 1-2|Area Border Router |
| |
|
19 |
|Level 2|Backbone Router |
| |
|
20 |
|LSP (Link-state Packet)|LSA (Link-state Advertisement) |
| |
|
21 |
|CSNP and PSNP (Complete and Partial sequence number PDUs)|Link-state acknowledgement packet |
| |
|
22 |
|PDU (Protocol Data Unit)|Packet |
| |
|
23 |
|NET (Network Entity Title)|IP destination address (subnet and host), user in a similar way to Router ID |
| |
|
24 |
|NSAP (Network Service Access Point)|IP Destination Address + IP Protocol Number |
| 2 |
LindsayDruett |
25 |
|Subnet = data link|Subnet = IP network |
| |
|
26 |
|SNPA (Subnetwork point of attachment)|Layer 2 address; for example, the MAC address with ethernet or DLCI with Frame Relay |
| |
|
27 |
|System ID|Address of the host within the network, sometimes used as the router ID determining priorities |
| |
|
28 |
|Virtual link (defined but not supported|Virtual link |
| |
|
29 |
|
| |
|
30 |
!IS-IS |
| |
|
31 |
Routing technology = link state |
| |
|
32 |
* Classless routing protocol |
| |
|
33 |
* Address summarization between areas |
| |
|
34 |
* Uses a link-state database |
| |
|
35 |
* Acknowledges LSPs |
| |
|
36 |
* Shortest path is computed using Dijkstra's SPF algorithm |
| |
|
37 |
* Hellos create and maintain adjacencies |
| |
|
38 |
* Hellos and holdtime may be configured |
| |
|
39 |
|
| |
|
40 |
!OSPF |
| |
|
41 |
Routing technology = link state |
| |
|
42 |
* Classless routing protocol |
| |
|
43 |
* Address summarization between areas |
| |
|
44 |
* Uses a link-state database |
| |
|
45 |
* Acknowledges LSAs |
| |
|
46 |
* Shortest path is computed using Dijkstra's SPF algorithm |
| |
|
47 |
* Hellos create and maintain adjacencies |
| |
|
48 |
* Hellos and holdtime can be configured |
