Pederrs CCNP 1 - Revision history

Heth at 16:29, 26 March 2009

2009-03-26T16:29:18Z

2009-02-27T11:16:04Z

‎Teori

2009-02-27T10:13:56Z

‎Teori

2009-02-27T09:52:20Z

‎Forkortelser

2009-02-25T21:06:25Z

‎Teori

2009-02-25T19:44:47Z

‎Module 2: EIGRP

2009-02-25T19:37:53Z

‎Forkortelser:

2009-02-25T19:35:05Z

‎Forkortelser:

2009-02-25T16:11:42Z

‎Teori

2009-02-25T15:37:32Z

‎Teori

@@ Line 1: / Line 1: @@
 = Module 1: Scalable Network Design =
+[[Category:Cisco]]
 == Forkortelser: ==

@@ Line 1,049: / Line 1,049: @@
 == Teori ==
 [[Image:CCNP-105.png]]
@@ Line 1,055: / Line 1,057: @@
 <br><br>
-===  ===
+===  8.1.3  Large Address Space  ===
 [[Image:CCNP-106.png]]
@@ Line 1,062: / Line 1,064: @@
 <br><br>
-===  ===
+=== 8.2.1  IPv6 Addressing Architecture  ===
 [[Image:CCNP-107.png]]
@@ Line 1,069: / Line 1,071: @@
 <br><br>
-===  ===
+=== 8.2.2  Comparing IPv4 and IPv6 Headers  ===
 [[Image:CCNP-108.png]]
@@ Line 1,076: / Line 1,078: @@
 <br><br>
-===  ===
+===  8.2.3  IPv6 Extension Headers  ===
 [[Image:CCNP-109.png]]
@@ Line 1,083: / Line 1,085: @@
 <br><br>
-===  ===
+=== 8.2.4  Defining Address Representation  ===
 [[Image:CCNP-110.png]]
@@ Line 1,090: / Line 1,092: @@
 <br><br>
-===  ===
+===  8.2.5  IPv6 Address Types  ===
 [[Image:CCNP-111.png]]
 <br><br>
 [[Image:CCNP-112.png]]
 <br><br>
 [[Image:CCNP-113.png]]
@@ Line 1,111: / Line 1,107: @@
 <br><br>
-===  ===
+=== 8.2.6  IPv6 Global Unicast and Anycast Addresses  ===
 [[Image:CCNP-114.png]]
@@ Line 1,118: / Line 1,114: @@
 <br><br>
-===  ===
+=== 8.3.1  Defining Host Interface Addresses  ===
 [[Image:CCNP-115.png]]
@@ Line 1,125: / Line 1,121: @@
 <br><br>
-===  ===
+=== 8.3.2  Link Local Address ===
 [[Image:CCNP-116.png]]
@@ Line 1,132: / Line 1,128: @@
 <br><br>
-===  ===
+=== 8.3.3  Stateless Autoconfiguration 8.3.4  ===
 [[Image:CCNP-117.png]]
@@ Line 1,139: / Line 1,135: @@
 <br><br>
-===  ===
+=== EUI-64 to IPv6 Identifier ===
 [[Image:CCNP-118.png]]

@@ Line 1,012: / Line 1,012: @@
 == Forkortelser ==
 '''The IPv6 header contains these fields:'''
@@ Line 1,024: / Line 1,047: @@
 *'''Destination Address:''' This field has 16 octets or 128 bits. It identifies the destination of the packet.
 *'''Extension Headers:''' Follows the previous eight fields. The number of extension headers is not fixed, so the total length of the extension header chain is variable.
 == Teori ==

@@ Line 200: / Line 200: @@
 '''Types 9, 10, and 11'''
 The opaque LSAs, types 9, 10, and 11, are designated for future upgrades to OSPF for application-specific purposes. For example, Cisco Systems uses opaque LSAs for Multiprotocol Label Switching (MPLS) with OSPF. Opaque LSAs are distributed using standard LSDB flooding mechanisms. Each type has a different flooding scope.
 = Module 4: Integrated IS-IS =

← Older revision		Revision as of 19:44, 25 February 2009
Line 46:		Line 46:

	'''SPF''' = Shortest Path First (SPF)		'''SPF''' = Shortest Path First (SPF)
		+
		+
		+	== Teori ==
		+
		+
		+	Although the metric can be based on five criteria, EIGRP uses only two of these criteria by default:
		+
		+	*Bandwidth: Smallest bandwidth between source and destination.
		+	*Delay: Cumulative interface delay along the path.
		+
		+	Three other criteria can be used, but are not recommended, because they typically result in frequent recalculation of the topology table:
		+
		+	*Reliability: Worst reliability between source and destination, based on keepalives.
		+	*Loading: Worst load on a link between source and destination, based on the packet rate and the configured bandwidth of the interface.
		+	*MTU: Smallest MTU in the path. MTU is included in the EIGRP routing update, but is not actually used in the metric calculation.

	= Module 3: OSPF =		= Module 3: OSPF =

← Older revision		Revision as of 19:37, 25 February 2009
Line 17:		Line 17:

	'''AD''' = advertised distance (AD)		'''AD''' = advertised distance (AD)
		+
		+	'''FD''' = feasible distance (FD)
		+
		+	'''AD og FD forklaring:'''
		+	The lowest cost route is calculated by adding the cost between the next-hop router and the destination—referred to as the advertised distance (AD)—to the cost between the local router and the next-hop router. The sum of these costs is called the feasible distance (FD).

← Older revision		Revision as of 19:35, 25 February 2009
Line 15:		Line 15:

	== Forkortelser: ==		== Forkortelser: ==
		+
		+	'''AD''' = advertised distance (AD)
		+

	'''DUAL''' = Diffusing Update Algorithm (DUAL)		'''DUAL''' = Diffusing Update Algorithm (DUAL)