217 Midterm Prep Flashcards
Describe OSPF
Lecture 2
OSPF (Open Shortest Path First) is a link-state routing protocol that was devleoped as an alternative for RIP.
OSPF uses areas to define its routing protocol. A network can be divided into distinct areas to control routing update traffic.
Why is OSPF used over other routing protocols?
Lecture 2
OSPF offers Faster convergence and is more scalable which makes it ideal to be used in larger networks.
What are the 5 exchange packets used by OSPF?
Lecture 2
- Hello PAcket
- Database description packet
- Link-state request packet
- Link-state Update Packet
- Link-state acknowledgment packet
What are the 3 OSPF databases?
Lecture 2
- Adjacency Database - unique ists of all neighboring routers directly connected to the OSPF router (neighbor table)
- Link-State Database - Lists information about all other routers in a network. Should match on all connected routers. (topology table)
- Forwarding Database - list of routes generated by a link-state algorithm (routing table)
What is the name of the algorithm that helps build the OSPF topology table?
Lecture 2
Dijkstra Shortest-Path First (SPF) Algorithm.
How does the SPF Algorithm build a topology table?
Lecture 2
The SPF algorithm creates an SPF tree by placing each router at the root of the tree, and then calculating the shortest path to each node. This is how the best routes are determined by the router.
Once the best paths are determined, they are stored in a forwarding database and then used to create the routing table.
Describe the 5 steps of link-state routing.
Lecture 2
- Neghibor Adjacencies are Established
- Link-State Advertisements are echanged
- The link-state database is built
- The SPF algorithm begins determining the best paths for routing
- Once the best route is chosen, routing begins.
Define Single and Multarea OSPF
Lecture 2
- Single-Area OSPF is OSPF routing where all routers are in a single area.
- Multiarea OSPF is OSPF routing where the routing domain is divided up into segmented zones.
Define Single and Multarea OSPF
Lecture 2
- Single-Area OSPF is OSPF routing where all routers are in a single area.
- Multiarea OSPF is OSPF routing where the routing domain is divided up into segmented zones.
What are some of the advantages of Multiarea OSPF?
Lecture 2
- Smaller routing tables are kept because less routes are used. Network addresses are allowed to be summarized by the area they are in
- Reduced Linke-State Update Overhead. OSPF with smaller areas ends up using less processing power and memory
- Reduced Frequency of SPF Calculations. Impacts of topology changes are localized within a single area.
What is OSPF v3
Lecture 2
OSPFv3 is the IPv6 verision of OSPFv2.
While it is possible to do IPv6 rouing using OSPFv2, the routing is done in seperate instances. OSPFv3 allows you to similtaniously configure both IPv4 and IPv6 . `
List and describe the 5 different OSPF link state packets.
Lecture 2
- Hello - Used for neighbor discovery and the creation of adjacencies
- Database Description (DBD) - Checks for database synchonization between devices
- Link-State Request (LSR) - REquest specific link-state records from router to router
- LInk-State Update - Sends specifically requested link-state records
- Link-State Acknowledgment - Acknowledges other packet types.
Name some functions of the OSPF Type 1 Hello Packet
Lecture 1
Hello Packets:
* Discover OSPF neighbors and establish neighbor adjacencies
* Advertise parameters on which two routers must agree to become neighbors
* Elect the DR (Designated Router) and the BDR (Backup Designated Router) on multiaccess networks.
Name the operational states of OSPF
Lecture 2
- Down State - No hello packets received
- Init State - Hello packets received
- Two-Way State - Bidirectional state where communication has been established
- ExStart State - the Database Description packet exchange sequence begins
- Exchange State - DBD Packets are exchanged
- Loading State - LSRs and LSUs give specific routing information between routers. The SPF algorithm is used to find the best routes
- Full-State - Routers are both Synchronized
Dedscribe the 3 step process of the Database Desynchronization state
Lecture 2
- The router with the highest ID sends its DBD flag first putting it into the ExStart state
- The router then exchanges its database description(s) with other routers to compare known adjacencies
- A Link-State request is sent out, comparing DBD information with local DB information. If another router has new information, the receiving router chagnes to a loading state.
When are Link-State Requests sent to routers?
Lecture 2
Whever a change is perceived in a routers database
OR
Every 30 Minutes
What are the 2 multiaccess network problems that designating a DR helps solve?
Lecture 2
- Multiple adjacencies creation. DRs prevent an excessive number of LSAs being exchanged between routers on a network
- Extensive flooding of LSAs - Every time OSPF is utilized, LSAs are flooded. Too much flooding can bog down a network.
What is the purpose of assigning a router ID?
Lecture 3A
Router ID’s participate in the synchronization of OSPF databases. The router with the highest ID sends the DBD packets before anybody else does.
Router IDs are also used to elect
the DR.
How are router ID’s formatted?
Lecture 3A
Router IDs are a 32 bit value represented as an IPv4 address. A router requires an RID to participate in OSPF. If a router ID isn’t manually assigned, it is automatically determined based on the IP address of the router.
Describe the Router ID order of precedence.
Lecture 3A
- The router ID has been explicitly configured by an administrator
- The router chooses the highest IPv4 of any configured loopback address.
- The router chooses the highest active IPv4 address of any of its physical interfaces.
What is a Wildcard Mask?
Lecture 3
A wildcard mask is the inverse of a subnet mask configured on an interface.
An easy way to determine a wild card mask is to subtract your subnet mask from 255.255.255.255.
Example:
The Wildcard mask for a /24 address is 255.255.255.255 - 255.255.255.0 which would be 0.0.0.255
What is the purpose of using a Passive Interface when configuring OSPF?
Lecture 3A
If you do not configure a passive interface, OSPF will waste resources by sending messages into a lan where no routers need OSPF information. This can affect the network by:
Wasting bandwidth and resources
Harming security by sending unnessecary packets that can be picked up by packet sniffing software. (but they would have already infiltrated your lan so i don’t get how this is a security risk but whatever lol)
What do DRs, BDRs and DROTHERs do?
Lecture 3A
A DR is responsible for collecting and distributing LSAs.
A BDR is a backup incase something happens to the DR. Passively listens and maintains a relationship with all connected routers, and in the event that the DR fails, It is elected to the role of DR.
DROTHERs are all other routers on a network.
Describe the 5 DR/BDR neighbor states in multiaccess networks
Lecture 3A
- FULL/DROTHER The DR/BDR is fully adjacent with a DROTHER router.
- FULL/DR This router is fully adjacent with a DR neighbor.
- FULL/BDR This router is fully adjacent with a BDR neighbor
- 2-WAY/DROTHER A DROTHER has a neighbor relationship with another DROTHER, and they exchange hello packets between eachother.
The default normal state of an OSPF router is FULL. The only exception to this rule is the 2WAY state.
Describe the DR/BDR election process
Lecture 3A
- The router with the highest interface priority is elected as the DR.
- If the interface priority value is set to 0, that interface can not be the DR or the BDR
- The default priority is 1, and can be set to any number between 0-255
- If the interface priorities are equal, the router with the highest router ID becomes the DR, and the second highest becomes the BDR.
Define OSPF Cost Metrics.
Lecture 3A
The OSPF cost metric is how routers determine the best path across a network. The LOWER the cost the BETTER the path (like golf swings)
What is the formula used to calculate OSPF Cost Metrics?
Lecture 3A
Cost = Reference bandwidth / interface bandwidth
image for some examples
What are dead intervals?
Lecture 3A
Dead intervals are the period a router waits to receive a hello packet before declaring the neighbor down.
The default length of a dead interval is 4 times the Hello interval.
Why would you want to manually set the OSPF cost value?
Lecture 3A
- Administrators may want to manually influence path selection within OSPF
- Equipment connected to your router may use a different OSPF calculation formula, and you might need to make them match with eachother for conectivity.
Name and describe some basic OSPF verification commands.
Lecture 3A
- show ip interface brief - This verifies that the desired interfaces are active with correct IP addressing.
- show ip route- This verifies that the routing table contains all the expected routes.
- show ip ospf neighbor
- show ip protocols
- show ip ospf
- show ip ospf interface
Just copy/pasted these from the lecture slides.
Define Bandwidth, Congestion, Delay and Jitter and describe how the affect Network Transmission Quality
Lecture 4
- Bandwidth is the measured number of bits that can be transmitted in a single second (BPS)
- Congestion is when a delay is caused by a network having more traffic than it can handle at a given point in time.
- Delay or Latency refers to the time it takes for a packet to travel to its destination.
- Jitter is the variation of delay measured from received packets.
Name and describe different types of network delay.
Lecture 4
- Code Delay = The amount of time it takes to compress data at the source before transmission
- Packetization delay = The time it takes to encapsulate a packet with all necessary packet information
- Queing delay = The variable amount of time a frame or packet waits to be transmitted on the link
- Serialization Delay = The amount of time it takes to transmit a frame onto a wire
- Propogation Delay = The amount of time it takes for the frame to travel between source and destination
- De-Jitter Delay = The fixed amount of time it takes to buffer a flow of packets and then send them out in evenly spaced intervals.
What is the predominant type of IP traffic today?
Lecture 4
Video traffic takes up 82% of all network traffic as of 2022.
Previously the leading traffic was voice and data traffic, but with the rise of streaming the type of traffic has evolved.
Mobile video traffic will reach 60.9 exabytes per month by 2022
Name some characterists of Voice Traffic
Lecture 4
- Smooth
- Benign
- Drop Sensitive
- Delay Sensitive: Jitter needs to be less than or equal to 30ms. p=
- High priority traffic
- Requires at least 30kbps of bandwidth.
- Uses RTP Ports 16384-32767
Name some characteristics of Video Traffic
Lecture 4
- Transmits in bursts
- High volume
- Drop Sensitive / Delay Sensitive
- High Priority Traffice
- Used UDP o ports as well as Real-Time Streaming Protocols.
Name some characteristics of Data Trafic
Lecture 4
- Uses TCP to prevent loss of important data such as email or web pages
- Can be smooth or in bursts
- Insensitive to delay, the data arriving in its original format is more important than the data arriving quickly.
Define queuing
Lecture 4
Queuing is a method of managing congestion that can buffer, prioritize, and require packets before being transmitted.
Queuing algorithms include:
* First-In First-Out (FIFO)
* Weighted Fair Queuing (WFQ)
* Class-Based WFQ
* Low Latency Queuing (LLQ)
Describe FIFO Queuing
Lecture 4
FIFO buffers and forwards packets in order as they arive (Hence the name first in first out)
FIFO contains no concept of priority or classes, and makes no decisions based on packet priority. All packets are in a single queue and treated equally.
Describe Weighted Fair Queuing
Lecture 4
WFQ is an automated scheduling algorithm that allocates fair bandwidth to all network traffic.
WFQ applies priority to identified traffic, classes it into flows, and determins how much bandwidth should be used by each flow.
WFQ defines flows based on source and destination IP, MAC, port numbers, Protocols, and ToS values.