Ex3 Chapter 1 - LAN Design
Hierarchical network design (Cisco) model involves dividing the network into discrete layers. Each layer provides specific functions that define its role within the overall network.
The typical hierarchical design model is broken up in to three layers:
- access,
- distribution,
- core.
The typical hierarchical design model is broken up in to three layers:
- access,
- distribution,
- core.
Ex2 after practice exam
Thing to repeat and remeber:
- poison reverse (default)
- split horizon http://www.ietf.org/rfc/rfc1058.txt
- eigrp discovery proccess
- rip updates (version in updates)
- routing protocols on which layer works
- BD/BDR election, election after fail
- classless/classfull packet flow in routing decision
- summarization
- discontiguos networks
Habits of Highly Effective Students
"What is the best way to study for a Certification Exam?"
This is probably the most common question I get asked by Network Academy students and peers chasing Cisco Certifications. While there is no concrete answer that works for everyone, there are some really great pieces of advice that I have heard throughout the years, and implemented in my daily study routine.
Ex2 Chapter 12 – BGP basics
The Border Gateway Protocol (BGP) is the core routing protocol of the Internet. It maintains a table of IP networks or 'prefixes' which designate network reachability among autonomous systems (AS). It is described as a path vector protocol. BGP does not use traditional Interior Gateway Protocol (IGP) metrics, but makes routing decisions based on path, network policies and/or rulesets.
Routers use “routing protocols” to exchange routing information with each other.
Routers use “routing protocols” to exchange routing information with each other.
Ex2 Chapter 10 – Link-State Routing Protocols
Distance vector routing protocols are like road signs because routers must make preferred path decisions based on a distance or metric to a network.
Link-state routing protocols take a different approach. Link-state routing protocols are more like a road map because they create a topological map of the network and each router uses this map to determine the shortest path to each network.
Link-state routing protocols take a different approach. Link-state routing protocols are more like a road map because they create a topological map of the network and each router uses this map to determine the shortest path to each network.
Ex2 Chapter 7 – RIP version 2
The routing algorithm used in RIP, the Bellman-Ford algorithm, was first deployed in a computer network in 1967, as the initial routing algorithm of the ARPANET.Due to the deficiencies of the original RIP specification, RIP version 2 (RIPv2) was developed in 1993 and last standardized in 1998 It included the ability to carry subnet information, thus supporting Classless Inter-Domain Routing (CIDR). To maintain backward compatibility, the hop count limit of 15 remained. RIPv2 has facilities to fully interoperate with the earlier specification if all Must Be Zero protocol fields in the RIPv1 messages are properly specified. In addition, a compatibility switch feature allows fine-grained interoperability adjustments.
Ex2 Chapter 5 – RIP version 1
RIP – Routing Information Protocol
RIP is the oldest routing protocol still in use today. It is available on many platforms and is not a protocol that will be deprecated anytime soon. It is a useful protocol for networks that are large enough for a routing protocol but not large enough for some of the more powerful and expensive protocols available. RIP even has a new RIPng version to handle IPv6 networks.
RIP is the oldest routing protocol still in use today. It is available on many platforms and is not a protocol that will be deprecated anytime soon. It is a useful protocol for networks that are large enough for a routing protocol but not large enough for some of the more powerful and expensive protocols available. RIP even has a new RIPng version to handle IPv6 networks.
Ex2 Chapter 2 - Static Routing, CDP
Role of Router
1. Determine best path to send packets.
2. Forward packets toward their destinations.
1. Determine best path to send packets.
2. Forward packets toward their destinations.
Ex2 Chapter 1 - Introduction to Routing and Packet Forwarding
Static and Dynamic Routing
Routers know of networks that are only directly connected to them. Obviously, routers need some method of learning about distant networks they need to access. There are two methods of learning about these distant networks, static and dynamic route learning. Static routes are when an administrator adds specific network routes to a router or multiple routers.
Routers know of networks that are only directly connected to them. Obviously, routers need some method of learning about distant networks they need to access. There are two methods of learning about these distant networks, static and dynamic route learning. Static routes are when an administrator adds specific network routes to a router or multiple routers.
Subscribe to:
Posts
(
Atom
)