28 Questions
What does the path-vector routing algorithm advertise to neighboring speaker nodes?
The path of the nodes in its autonomous system or other autonomous systems
What is carried in a special path attribute in path-vector routing?
The sequence of routing domains through which the reachability information has passed
What does path selection involve in routing algorithms?
Applying a routing metric to multiple routes to select the best route
What does prefix length refer to in routing algorithms?
A matching route table entry with a longer subnet mask is always preferred as it specifies the destination more exactly
What do routing algorithms use to compute the metric?
Bandwidth, network delay, hop count, path cost, load, maximum transmission unit, reliability, and communication cost
What is the main difference between distance vector routing and path-vector routing?
Distance vector routing advertises networks in terms of a destination and the distance to that destination, while path-vector routing advertises destination addresses and path descriptions
What does the routing table store in most routing algorithms?
Only the best possible routes
What enables the use of multiple alternative paths in routing?
Multipath routing and specifically equal-cost multi-path routing techniques
Which form of addressing is more effective in large networks?
Structured addressing (routing)
What is the dominant form of addressing on the Internet?
Routing
Which type of message delivery includes one-to-many communication?
Multicast
What does the article primarily focus on in terms of routing algorithms?
Unicast routing algorithms
Which type of routing automatically constructs routing tables based on routing protocols?
Dynamic routing
Which of the following are examples of dynamic-routing protocols and algorithms?
RIP, OSPF, and EIGRP
Which algorithm uses the Bellman-Ford algorithm and assigns a cost number to each link between nodes?
Distance vector algorithm
How do nodes determine the lowest total cost path to each destination in distance vector algorithms?
By sending information to each other
Which type of algorithm independently determines the least-cost path to every other node using a graphical map of the network?
Link-state algorithm
Which routing algorithm is optimized for mobile ad hoc networks?
Optimized Link State Routing Protocol (OLSR)
Which type of routing is used for inter-domain routing?
Path-vector routing
What is a drawback of distance vector routing?
Instability with more hops
What is the process of selecting a path for traffic in a network or between multiple networks?
Routing
What directs network packets from their source toward their destination through intermediate network nodes?
Packet forwarding
What maintains a record of the routes to various network destinations?
Routing tables
In a narrower sense, what does IP routing often refer to and contrast with?
Bridging
What is the process of selecting a path for traffic in a network or between multiple networks?
Routing
In packet switching networks, what is the higher-level decision making that directs network packets from their source toward their destination through intermediate network nodes by specific packet forwarding mechanisms?
Routing
What do routing tables maintain a record of?
Routes to various network destinations
In a narrower sense, what does IP routing often refer to and contrast with?
Bridging
Study Notes
Routing and Addressing in Computer Networks
- Structured addressing (routing) is more effective than unstructured addressing (bridging) in large networks
- Routing is the dominant form of addressing on the Internet, while bridging is widely used in local area networks
- Delivery schemes in routing include unicast (one-to-one), broadcast (one-to-all), multicast (one-to-many), and anycast (one-to-one-of-many)
- Unicast is the dominant form of message delivery on the Internet, and the article focuses on unicast routing algorithms
- Dynamic routing automatically constructs routing tables based on routing protocols and dominates the Internet
- Examples of dynamic-routing protocols and algorithms include RIP, OSPF, and EIGRP
- Distance vector algorithms use the Bellman-Ford algorithm and assign a cost number to each link between nodes
- Nodes send information to each other to determine the lowest total cost path to each destination
- Link-state algorithms use a graphical map of the network and independently determine the least-cost path to every other node
- The Optimized Link State Routing Protocol (OLSR) is a proactive link-state routing algorithm optimized for mobile ad hoc networks
- Distance vector and link-state routing are intra-domain routing protocols, while path-vector routing is used for inter-domain routing
- Distance vector routing is subject to instability with more hops, while link-state routing requires significant resources and creates heavy traffic due to flooding
Test your knowledge of routing and addressing in computer networks with this quiz. Explore the differences between structured and unstructured addressing, delivery schemes, dynamic routing protocols, and the characteristics of distance vector and link-state algorithms. Dive into the world of network routing and enhance your understanding of this fundamental aspect of computer networking.
Make Your Own Quizzes and Flashcards
Convert your notes into interactive study material.
Get started for free
