Content Quiz 12-1: Computer Networks - Parts 12 + 13 (Network Layer Basics and Routing)

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/9

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

10 Terms

1
New cards

The primary goal of the network layer is to transfer packets between the _______ of the data and the ____ _______, possibly via multiple links.

origin, final destination, links

2
New cards

The network layer is responsible for routing (i.e., identifying the ____ that a packet must take to get from the source node to the destination node) and ______ received packets to the next node along the identified ______.

path, forwarding, path

3
New cards

Which of the following additional responsibilities does the network layer have?

a. flow control

b. congestion control

c. error control

d. internetworking

b. congestion control

d. internetworking

4
New cards

Every packet that the network layer of any node receives from the link layer is sent up to the transport layer of that node. True or false.

False

5
New cards

Which of the following is not the goal of a routing algorithm?

a. simplicity

b. stability

c. modularity

d. efficiency

e. robustness

c. modularity

6
New cards

When using shortest path routing, the shortest path is calculated and stored in a ______ ______

routing table

7
New cards

Dijkstra's algorithm finds the shortest path between ___________ (all/a given) source node(s) and __________ (a given/all) destination node(s) within that network.

a given, all

8
New cards

Elements written in blue font represent...

a. nodes that are yet to be explored

b. nodes that have been finalized

c. nodes to which the shortest distance from the source node has been found

c. nodes to which the shortest distance from the source node has been found

9
New cards

In any given iteration, nodes to which distances from the source node are as yet unknown are indicated using the value ________

infinity

10
New cards

In every iteration, the node with the _________ _______ _________ from the source node is chosen for exploration next.

shortest known distance