Term
| WHICH STATEMENT MOST ACCURATELY DESCRIBES STATIC AND DYNAMIC ROUTES? |
|
Definition
| STATIC ROUTES ARE MANUALLY CONFIGURED BY A NETWORK ADMINISTRATOR, WHEREAS DYNAMIC ROUTES ARE AUTOMATICALLY LEARNED AND ADJUSTED BY ROUTING PROTOCOL. |
|
|
Term
| WHICH OF THE FOLLOWING PROTOCOLS IS AN EXAMPLE OF AN EXTERIOR GATEWAY PROTOCOL? |
|
Definition
|
|
Term
| IN WHICH SITUATION IS AN ADMINISTRATIVE DISTANCE REQUIRED? |
|
Definition
| WHEN THE SAME ROUTE IS LEARNED VIA MULTIPLE ROUTING SOURCES |
|
|
Term
| HOW DOES A DISTANCE VECTOR ROUTER LEARN ABOUT PATHS FOR NETWORK THAT ARE NOT DIRECTLY CONNECTED? |
|
Definition
|
|
Term
| WHAT DOES A DISTANCE VECTOR ROUTER SEND TO NEIGHBORING ROUTERS AS PART OF A PERIODIC ROUTING-TABLE UPDATE? |
|
Definition
|
|
Term
| WITH DISTANCE VECTOR ROUTING, COUNT TO INFINITY CAN BE PREVENTED BY SETTING A MAXIMUM FOR WHAT VALUE? |
|
Definition
|
|
Term
| WHAT DOES SPLIT HORIZON SPECIFY? |
|
Definition
| THAT INFORMATION ABOUT A ROUTE SHOULD NOT BE SENT BACK IN THE DIRECTION FROM WHICH THE ORIGINAL INFORMATION CAME. |
|
|
Term
| WHEN A ROUTER SETS THE METRIC FOR A DOWN NETWORK TO THE MAXIMUM VALUE, WHAT IS IT DOING? |
|
Definition
|
|
Term
| IF A ROUTE FOR A NETWORK IS IN HOLDDOWN AND AN UPDATE ARRIVES FROM A NEIGHBORING ROUTER WITH A POORER METRIC THAN WAS ORIGINALLY RECORDED FOR THE NETWORK, WHAT DOES THE ROUTER DO? |
|
Definition
|
|
Term
| IF A ROUTER HAS A NETWORK PATH IN HOLDDOWN AND AN UPDATE ARRIVES FROM A NEIGHBORING ROUTER WITH A BETTER METRIC THAN ORIGINALLY RECORDED FOR THE NETWORK, WHAT TWO THINGS DOES IT DO? |
|
Definition
REMOVES THE HOLDDOWN
AND
MARKS THE ROUTE AS "ACCESSIBLE" |
|
|
Term
| HOW CAN LINK-STATE PROTOCOLS LIMIT THE SCOPE OF ROUTE CHANGES? |
|
Definition
| BY SEGMENTING THE NETWORK INTO AREA HIERARCHIES. |
|
|
Term
| WHAT IS THE PURPOSE OF LINK-STATE ADVERTISEMENTS (LSA)? |
|
Definition
| TO CONSTRUCT A TOPOLOGICAL DATABASE |
|
|
Term
| WHAT ARE TWO CHARACTERISTICS OF OSPF? (NEED TO KNOW ALL!) |
|
Definition
| HIERARCHICAL AND OPEN STANDARD |
|
|
Term
| OSPF ROUTES PACKETS WITHIN A SINGLE ______________. |
|
Definition
|
|
Term
| HOW MANY SUBNETS ARE GAINED BY SUBNETTING 172.17.32.0/20 IN MULTIPLES OF /28 SUBNETS? |
|
Definition
|
|
Term
| HOW MANY HOSTS CAN BE ADDRESSED ON A SUBNET THAT HAS SEVEN HOST BITS? |
|
Definition
|
|
Term
| HOW MANY HOST CAN BE ADDRESSED WITH A PREFIX OF /30? |
|
Definition
|
|
Term
| WHICH SUBNET MASK WOULD BE APPROPRIATE FOR A CLASS C ADDRESS USED FOR 9 LANs, EACH WITH 12 HOSTS? |
|
Definition
|
|
Term
| HOW CAN YOU MOST EFFECTIVELY SUMMARIZE THE IP RANGE OF ADDRESSES FROM 10.1.32.0 TO 10.1.35.255? |
|
Definition
|
|
Term
| WHICH OF THE FOLLOWING COMMANDS MAKES RIPv2 AND EIGRP IMPLEMENT CLASSLESS BEHAVIOR? |
|
Definition
|
|
Term
| HOW CAN YOU MOST EFFECTIVELY SUMMARIZE THE IP RANGE OF ADDRESSS FROM 172.168.12.0/24 TO 172.168.13.0/24? |
|
Definition
|
|
Term
| T/F: A DISTANCE VECTOR ROUTING ALGORITHM SENDS ITS ENTIRE ROUTING TABLE TO ITS NEIGHBORS. LINK-STATE ROUTING ALGORITHMS MAINTAIN A COMPLEX DATABASE OF TOPOLOGY INFORMATION, WHICH ROUTERS USE TO MAINTAIN FULL AWARENESS OF DISTANT ROUTERS. |
|
Definition
|
|
Term
|
Definition
| IT IS A CLASSLESS, LINK-STATE ROUTING PROTOCOL THAT IS WIDLEY DEPLOYED IN MANY NETWORKS. EIGRP IS A CLASSLESS ROUTING PROTOCOL THAT BEHAVES LIKE A CLASSFUL ROUTING PROTOCOL BY DEFAULT. |
|
|
Term
| WHAT IS VLSM (VARIABLE LENGTH SUBNET MASK)? |
|
Definition
| ALLOW MULTILPLE LEVELS OF SUBNETWORKED IP ADDRESSES WITHIN A SINGLE NETWORK AND PROVIDE EFFICIENT ALLOCATION OF IP ADDRESSES. |
|
|
