@@QUES 020101 SXY Q,123,420,350,335
What do you think is meant by convergence?
|
Choose an option.
|
All routers moving towards having similar data delivery times
Where all routers use the same route
Where a particular router always takes the same route
The process of agreement of all routers on optimal routes
|

|
4
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The correct option is now highlighted.

@@QUES 020102 Y/N Q,130,392,329,259
Do you think that routing algorithm's slow convergence results in routing loops?
|
1
|

|
You're right.
|
In fact, they do.
|
The answer is Yes.

@@QUES 020103 MXY Q,166,423,279,350
What feature(s) do you think the delay metric depends on?
|
Choose each appropriate item.
|
The bandwidth of intermediate network links
Port queues at each router on the route
Network congestion on intermediate network links
The physical distance to be travelled
|

|
1,2,3,4
|
That's right.
|
Partly right. All the options are correct and are now highlighted.
|
You have not made any correct choices. All the options are correct and are now highlighted.
|
The correct options are highlighted.

@@QUES 020104 T/F Q,142,413,287,317
Do you think the following statement is true or false?

In practice, distance vector routing protocols are rarely used.
|
2
|

|
That's right.
|
Actually, they are widely used.
|
The statement is false.

@@QUES 020105 T/F Q,135,393,338,319
Do you think the following statement is true or false?

Distance vector routing algorithms pass periodic updates to all neighbor routers sequentially.
|
1
|

|
That's right.
|
Actually, they do.
|
The statement is true.

@@QUES 020106 T/F Q,129,364,335,308
Do you think the following statement is true or false?

Distance vector algorithms allow routers to know the exact topology of an internetwork.
|
2
|

|
That's right.
|
Actually, the statement is false.
|
The statement is false.

@@QUES 020107 DTF Q,113,420,364,328
Try to decide which option goes in which blank.

When the  _  in a distance vector protocol internetwork changes,  _ updates must occur.
|
Choose an option to fill the first blank.
|
Choose an option to fill the second blank.
|
%010routing table
%010topology
|
2
|
That's right.
|
In fact, it's the other way around.
|
Incorrect.
|
Incorrect.
|
The full statement is now shown.

@@QUES 020201 XYF Q,130,327,330,295
See if you can choose the correct option to fill in the blank.

This usually results in  _  convergence.
|
Choose an option to fill the blank.
|
%010fast
%010slow
|

|
2
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The full statement is now shown.

@@QUES 020202 SXY Q,153,364,250,309
What do you think the problem of endless looping is called?
|
Choose an option.
|
%010packet crossing
%010count to infinity
%010circular routing
%010exponential pathways
|

|
2
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The correct option is now highlighted.

@@QUES 020203 T/F Q,147,407,288,330
Do you think the following statement is true or false?

A maximum hop count of 15 for distance vector algorithms restricts their use in large internetworks.
|
1
|

|
That's right.
|
Actually, it does.
|
The statement is true.

@@QUES 020204 T/F Q,172,422,266,331
Do you think the following statement is true or false?

If the update has a poorer metric and the holddown-timer has not expired the update is ignored.
|
1
|

|
That's right.
|
In fact, the statement is true.
|
The statement is true.

@@QUES 020205 SXY Q,123,385,352,261
For which of the following do you think poison reverse is mostly used?
|
Choose an option.
|
Routing loops between adjacent routers
Large internetwork routing loops
|

|
2
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The correct option is now highlighted.

@@QUES 020206 Y/N Q,293,429,287,296
Once the route is poisoned, do you think that Router E is susceptible to incorrect updates about Network 1 from neighboring routers?
|
2
|

|
You're right.
|
In fact, it is no longer susceptible.
|
The answer is No.

@@QUES 020207 T/F Q,170,417,260,323
Do you think the following statement is true or false?

In the split horizon method route information is not sent back to the source from which it came.
|
1
|

|
That's right.
|
In fact, it is.
|
The statement is true.

@@QUES 020301 Y/N Q,219,431,287,291
Do you think that in link-state routing, routers send a portion of their routing tables to other routers?
|
1
|

|
You're right.
|
In fact, they do.
|
The answer is Yes.

@@QUES 020302 T/F Q,188,409,247,307
Do you think the following statement is true or false?

Link-state protocols work on event-triggered updates.
|
1
|

|
That's right.
|
In fact, they do.
|
The statement is true.

@@QUES 020303 SXY Q,164,367,272,321
What is its first course of action?
|
Choose an option.
|
It advertises the change to all other routers
It makes an entry in its routing table
It runs its SPF algorithm
It updates its own topological database
|

|
1
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The correct option is now highlighted.

@@QUES 020304 SXY Q,136,402,324,297
What do you think this process is called?
|
Choose an option.
|
Parcelling
Dispersing
Notifying
Flooding
|

|
4
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The correct option is now highlighted.

@@QUES 020305 Y/N Q,144,367,299,260
Do you think that using link-state protocols allows for fast convergence?
|
1
|

|
You're right.
|
In fact, they do.
|
The answer is Yes.

@@QUES 020401 Y/N Q,13,349,279,269
Do you think that packet flooding reduces bandwidth only briefly?
|
1
|

|
You're right.
|
In fact, it does.
|
The answer is Yes.

@@QUES 020402 T/F Q,58,338,242,287
Do you think the following statement is true or false?

The interval between updates will now be extended.
|
1
|

|
That's right.
|
In fact, the statement is true.
|
The statement is true.

@@QUES 020403 T/F Q,171,395,264,334
Do you think the following statement is true or false?

Dampening the update frequency interferes with LSP updates triggered by topology changes.
|
2
|

|
That's right.
|
Actually, the statement is false.
|
The statement is false.

@@QUES 020404 XYF Q,350,454,258,368
See if you can choose the correct option to fill in the blank.

Both routers construct  _  to reflect this unreachable status.
|
Choose an option to fill the blank.
|
%010a routing table
%010an SPF tree
%010an LSP
%010a Database
|

|
3
|
That's right.
|
That's not it. The correct option is now highlighted.
|
The full statement is now shown.

@@QUES 020405 Y/N Q,59,355,306,281
Do you think that the problem of faulty LSP distribution is intensified when scaling up to very large internetworks?
|
1
|

|
You're right.
|
In fact, it is.
|
The answer is Yes.

@@QUES 020406 Y/N Q,155,368,279,264
Do you think that partitioning can be managed by an area hierarchy?
|
1
|

|
You're right.
|
In fact, it can.
|
The answer is Yes.

@@QUES 020407 Y/N Q,148,391,303,297
Do you think that both distance vector and link-state routing protocols can perform  well in most situations?
|
1
|

|
You're right.
|
In fact, the answer is Yes.
|
The answer is Yes.

@@QUES 020101t MXY Q,0,0,350,350
Why is fast convergence a desirable feature on internetworks?
|
Choose each appropriate item.
|
Because it reduces the frequency of distance vector routing table updates
Because the problem of routing loops is avoided
Because the timespan where routers have outdated knowledge is reduced
Because it reduces the distances between routers
|
2,3
|
28
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.
|

@@QUES 020102t MXY Q,0,0,354,318
Which of the following  components do routing algorithms use to find the optimal route?
|
Choose each appropriate item.
|
Metrics
Routing tables
Metric weightings
Topology databases
|
1,3
|
28
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.


@@QUES 020103t SXY Q,0,0,332,367
How do distance vector routing algorithms manage their router updates?
|
Choose an option.
|
By sending small event triggered updates to all routers
By sending infrequent periodic updates to all routers
By sending infrequent periodic updates from router to router
By sending frequent periodic updates to neighboring routers
|
4
|
20
|
Correct.
|
Incorrect. The correct option is now highlighted.
|
3 
|
Actually router to router updates are frequent.
|

|

@@QUES 020104t MXY Q,0,0,298,317
Which information may the distance vector routing table contain?
|
Choose each appropriate item.
|
Path cost
Neighbor's address
Internetwork topology states
Destination network address
|
1,2,4
|
28
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.


@@QUES 020201t XYF Q,0,0,308,350
In solving the count to infinity problem, the hop count metric (for RIP) is set to a maximum allowed value of  _  .
|
Choose an option to fill the blank.
|
10
15
16
25
|
2
|
20
|
Correct.
|
Incorrect. The correct option is now highlighted.
|
The full statement is now shown.

@@QUES 020202t XYF Q,0,0,335,319
The hold down period is calculated to be  _  the time necessary to update an entire network with a routing change.
|
Choose an option to fill the blank.
|
%010the same as
%010greater than
%010less than
|
2
|
15
|
Correct.
|
Incorrect. The correct option is now highlighted.
|
The full statement is now shown.

@@QUES 020203t MXY Q,0,0,350,383
A router using an unexpired holddown timer is told of an inaccessible route by a neighbor.

When will the router both mark the route as accessible and remove the holddown-timer?
|
Choose each appropriate item.
|
When a new message from the same neighbor says the route is accessible
When another neighboring router with a better metric says it's accessible
When another neighboring router with a poorer metric says it's accessible
|
1,2
|
21
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.


@@QUES 020204t SXY Q,0,0,271,330
Which technique used to solve count to infinity assigns an infinite cost to an inaccessible route?
|
Choose an option.
|
Poison reverse
Split horizon
Holddowns
Hop count
|
1
|
20
|
Correct.
|
Incorrect. The correct option is now highlighted.
|

@@QUES 020301t DTF Q,0,0,332,317
The  _  protocol updates all routers simultaneously. 

The  _  protocol updates from router to router periodically.
|
Choose an option to fill the first blank.
|
Choose an option to fill the second blank.
|
%010link-state
%010distance vector
|
1
|
Correct.
|
10
|
Incorrect. It's the other way around.
|
0
|
Incorrect.
|
0
|
Incorrect.
|
0
|
The full statements are now shown.

@@QUES 020302t MXY Q,0,0,370,296
What information does an LSP contain?
|
Choose each appropriate item.
|
%010neighbor's router names
%010topological database
%010links to neighbors that have gone down
%010metrics
|
1, 3
|
28
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.


@@QUES 020303t SXY Q,0,0,404,350
When link-state information is sent to routers, what is the procedure for constructing topological databases?
|
Choose an option.
|
One router constructs a database and sends it to all the others
Routers wait for convergence before constructing databases
Each router in succession constructs a database
All routers construct databases simultaneously
|
4
|
20
|
Correct.
|
Incorrect. The correct option is now highlighted.
|

@@QUES 020304t SXY Q,0,0,469,295
Which of the following describes the process of flooding?
|
Choose an option.
|
Simultaneous updates of all routers on topology changes
Routers making database changes simultaneously
Fast convergence
Running the Shortest Path First algorithm
|
1
|
20
|
Correct.
|
Incorrect. The correct option is now highlighted.


@@QUES 020401t MXY Q,0,0,291,394
A network administrator  wants to scale up to a larger internetwork.

Which of the following features may interfere with the link-state routing protocols efficiency in this situation?
|
Choose each appropriate item.
|
Flooding
Looping
Partitioning
Slow convergence
|
2,4
|
28
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.
|

@@QUES 020402t MXY Q,0,0,379,316
When scaling up using link-state protocols, in what way(s) can resource concerns be addressed?
|
Choose each appropriate item.
|
By implementing holddowns
By assigning multicast groups
By setting up area hierarchies
By using split horizons
|
2,3
|
28
|
Correct.
|
7 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.
|

@@QUES 020403t SXY Q,0,0,320,332
What is the name of the procedure when administrators using link-state protocols reduce the periodic distribution of LSPs?
|
Choose an option.
|
Dampening
Flooding
Holddown
Segmenting
|
1
|
20
|
Correct.
|
Incorrect. The correct option is now highlighted.


@@QUES 020404t MXY Q,0,0,327,333
Which of the following procedures are used to solve problems of LSP coordination in link-state protocol routing?
|
Choose each appropriate item.
|
Sequence numbers
Time stamps
Holddowns
Aging schemes
|
1,2,4
|
20
|
Correct.
|
5 per correct decision
|
Partly right. The correct options are now highlighted.
|
You have not made any correct choices. The correct options are now highlighted.


