Computer Networking Lesson 3

When talking about how a packet is transferred from its sending host to its destination host, "forwarding" refers to ...

• transferring a packet from an incoming link to an outgoing link within a single router

• transferring a packet from one router to another

• how routers work together using routing protocols to determine good paths within the same administrative domain

• how routers work together using routing protocols to determine good paths across different administrative domains

When talking about how a packet is transferred from its sending host to its destination host, "intradomain routing" refers to ...

• transferring a packet from an incoming link to an outgoing link within a single router

• transferring a packet from one router to another

• how routers work together using routing protocols to determine good paths within the same administrative domain

• how routers work together using routing protocols to determine good paths across different administrative domains

When talking about how a packet is transferred from its sending host to its destination host, "interdomain routing" refers to ...

• transferring a packet from an incoming link to an outgoing link within a single router

• transferring a packet from one router to another

• how routers work together using routing protocols to determine good paths within the same administrative domain

• how routers work together using routing protocols to determine good paths across different administrative domains

Determine which action is network-wide (i.e. involves multiple routers). 

• routing

• forwarding

A packet is ​ (a)   when it is moved from a router’s input link to the appropriate link. 

• forwarded
• routed
• dropped
• acknowledged

In this lecture, we discuss intradomain routing, where all the nodes and subnets are owned and managed by the same organization. (In contrast, interdomain routing is about routing between different organizations – such as between two ISPs.) Before we begin talking about intradomain routing algorithms, what could the weights on the graph edges represent in these diagrams, when we are seeking the least-cost path between two nodes?

• Monetary cost

• Length of cable

• Current load on the link

• Business relationships

• Time delay to traverse the link

Select all that are true about routing:

• Intradomain routing must involve multiple administrative domains

• Interdomain routing must involves multiple administrative domains

• Intradomain routing must involve a single administrative domain

• Interdomain routing must involve a single administrative domain

Select all that are true about the Linkstate Routing Algorithm:

• Uses Dijkstra’s algorithm

•  the link costs and the network topology are known to ONLY neighboring nodes

• The link costs and the network topology are known to ALL nodes

• the goal of the algorithm is to compute the least cost paths from a source node to all other nodes

• it's an iterative, asynchronous and distributed algorithm

What is the computational complexity of the Linkstate Routing Algorithm where n represents the nodes in the topology?

Select all that are true about the Distance Vector Routing Algorithm:

• Based on the Bellman Ford Algorithm

• The stopping condition is when all nodes stop sending updates to their neighbors

• The stopping condition is when one node stops sending updates to their neighbors

• it's a centralized and synchronous algorithm

• it's an iterative, asynchronous and distributed algorithm