Routing Basics
Routing tables that are manually set and do not change are called this
Static routing
This protocol uses hop count to determine best path
RIP
This multiplexing gives each user a time slot
TDM
This network covers a single building
LAN
This is a common audio compression format
MP3
This type of routing automatically updates when the network changes
Dynamic routing
This protocol has a maximum of 15 hops
RIP
This device separates combined signals at the receiving end
Demultiplexor
This network covers a city
MAN
This is commonly used for video compression
MPEG
This type of routing is set once and never updated
Static routing
This protocol calculates more efficient paths than RIP
OSPF
This multiplexing assigns different frequencies to users
FDM
This network can span the entire Earth
WAN
This type of compression does NOT lose data
Lossless compression
This routing method can increase network traffic due to updates
Dynamic routing
This protocol is used across the Internet between autonomous systems
BGP
This multiplexing uses different wavelengths of light
WDM
This network design is commonly used in WANs
Mesh
This compression replaces repeated data with a count
Run-length encoding
This algorithm finds the least-cost path through a network
Dijkstra’s least-cost algorithm
This type of protocol monitors links and hop counts to destinations
Distance-vector protocol
This multiplexing is best for devices that do not transmit continuously
Statistical TDM
WANs are made up of these and communication links
Nodes
This compression method is lossless and used in many tools
Lempel-Ziv