ログイン

(Finals) Network Technology Mocktest BSIT 402
37問 • 7ヶ月前
  • Xai Alexandrei Delos Reyes
  • 通報

    問題一覧

  • 1

    These routes are manually configured by network administrators, have low system requirements, and apply to simple, stable, and small networks.

    Static Routes

  • 2

    These are used only when packets to be forwarded do not match any routing entry in an IP routing table. routes are manually configured by network administrators, have low system requirements, and apply to simple, stable, and small networks.

    Default Routes

  • 3

    On the Internet, routers need to exchange routing information in the interconnection of networks called ______________ a collection of networks and subnetworks.

    Autonomous Systems

  • 4

    The autonomous systems are connected together in the form of a network called the __________.

    Core Network

  • 5

    Within AS, one network is connected to another network by an ___________.

    Interior Gateway

  • 6

    The gateways that connect all the autonomous systems to the core network are called ____________.

    Exterior gateways

  • 7

    It is meant to dynamically route data across a network that you fully control and maintain. Basically, it is meant to dynamically route data across a network that you fully control and maintain.

    Interior Gateway Protocol (IGP)

  • 8

    This routing protocols are used to exchange routes between distinctly separate networks that you have no administrative control over.

    Exterior Gateway Protocol (BGP)

  • 9

    determine good paths (routes) from senders to receivers through the network of routers.

    Routing algorithms

  • 10

    the path with the smallest number of links between the source and the destination.

    Shortest path

  • 11

    finds a path between the source and destination with the least cost.

    Least-cost path

  • 12

    In this type of routing, all the routers send their routing tables to only their neighboring routers.

    DISTANCE-VECTOR ROUTING PROTOCOL

  • 13

    In this type of routing, each of the routers sends the state of its own interfaces to all other routers only when there is a change to report.

    LINK-STATE ROUTING PROTOCOL

  • 14

    the description of the router interface.

    Link-State (LS)

  • 15

    the cost of sending data packets on the interface, expressed in the link state metric.

    Output cost

  • 16

    these are other routers that are attached through the link-state.

    List of neighboring routers

  • 17

    an OSPF data packet containing link-state and routing information that is shared with the other routers.

    Link-State Advertisement (LSA)

  • 18

    a unit of data describing the local state of router's interfaces and adjacencies. The collected LS advertisements of all routers and networks form the LSDB.

    Link-State PDU

  • 19

    a collection of all LS PDUs originated from the area's routers. Each router advertises directly-connected networks via LS PDU.

    Link-State Database (LSDB)

  • 20

    This is a link-state routing protocol developed by the IETF in 1988 that is capable of quickly detecting topological changes within the autonomous system and establishing loop-free routes in a short period of time, with minimum additional communication overhead for negotiating topology changes between peering routers.

    Open Shortest Path First (OSPF)

  • 21

    The OSPF area keyword identifies an OSPF area. This is considered a logical group, and each group is identified by an area ID.

    Area

  • 22

    is the ISO name for a router. It is the communication between intermediate systems or routers.

    IS (Intermediate System)

  • 23

    is a device on the network, such as a server or workstation. (Hosts)

    ES (End System)

  • 24

    is a network service in the OSI stack

    CLNS (Connection-Less Network Service)

  • 25

    is a Layer-3 address for CLNS packets. This is like an IP address in the TCP/IP stack. IS-IS uses NSAP addresses for communication, not IP addresses.

    NSAP (Network Service Access Point)

  • 26

    contains information, such as the destination IP address, cost, and next-hop IP address, which guides packet forwarding.

    OSPF routing table

  • 27

    This is a commonly used distance vector routing that uses its routing metric to determine the best route or shortest path a packet has to traverse from the source to a destination over a network. RIP is a distance-vector IGP and has a preference of 100.

    Routing Information Protocol (RIP)

  • 28

    RIP uses a _____ as the route cost.

    hop count

  • 29

    When a RIP routerstarts up, itsends a ________ to all of its neighbors to request routing information of the entire RIP network.

    RIP request

  • 30

    also allows IP multicast packets for its announcements

    RIPv2

  • 31

    uses IP broadcast packets for its announcements.

    RIPv1

  • 32

    Important concepts about the relationship between OSPF routers:

    neighbor relationship and adjacency

  • 33

    It is a special data packet (message) that is sent out periodically from a router to establish and confirm network adjacency relationships to other routers in the OSPF.

    HELLO Packet

  • 34

    Routers that run a link-state routing protocol establish a neighbor elationship and then exchange Link State Advertisements, which indicate the devices’ presence with every interface port of a router.

    Step 1. LSA Flooding

  • 35

    Each router generates LSAs and adds the received LSAs to its own link-state database (LSDB). Routers learn the whole network topology through the LSDB

    Step 2. LSDB Creation

  • 36

    Each router uses the Shortest Path First (SPF) algorithm and LSDB information to calculate routes. Each router calculates a loop-free tree with itself as the root and the shortest path. L With this tree, a router determines the optimal path to each corner of a network.

    Step 3. SPF Calculation

  • 37

    The router installs routes for the calculated preferred paths into its routing table.

    Step 4. Routing Table Generation

  • The Contemporary World Mock test (Prelims)

    The Contemporary World Mock test (Prelims)

    Xai Alexandrei Delos Reyes · 58問 · 2年前

    The Contemporary World Mock test (Prelims)

    The Contemporary World Mock test (Prelims)

    58問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock test (Prelims)

    Computing Mock test (Prelims)

    Xai Alexandrei Delos Reyes · 67問 · 2年前

    Computing Mock test (Prelims)

    Computing Mock test (Prelims)

    67問 • 2年前
    Xai Alexandrei Delos Reyes

    Programming Mock Test (Prelims)

    Programming Mock Test (Prelims)

    Xai Alexandrei Delos Reyes · 64問 · 2年前

    Programming Mock Test (Prelims)

    Programming Mock Test (Prelims)

    64問 • 2年前
    Xai Alexandrei Delos Reyes

    Entrepreneurship Mock Test (Prelims)

    Entrepreneurship Mock Test (Prelims)

    Xai Alexandrei Delos Reyes · 23問 · 2年前

    Entrepreneurship Mock Test (Prelims)

    Entrepreneurship Mock Test (Prelims)

    23問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock Test (Midterms) BSIT 107

    Computing Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 76問 · 2年前

    Computing Mock Test (Midterms) BSIT 107

    Computing Mock Test (Midterms) BSIT 107

    76問 • 2年前
    Xai Alexandrei Delos Reyes

    Math Mock Test (Prelims)

    Math Mock Test (Prelims)

    Xai Alexandrei Delos Reyes · 48問 · 2年前

    Math Mock Test (Prelims)

    Math Mock Test (Prelims)

    48問 • 2年前
    Xai Alexandrei Delos Reyes

    Programming Mock Test (Midterms) BSIT 107

    Programming Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 52問 · 2年前

    Programming Mock Test (Midterms) BSIT 107

    Programming Mock Test (Midterms) BSIT 107

    52問 • 2年前
    Xai Alexandrei Delos Reyes

    UTS Mock Test (Midterms) BSIT107

    UTS Mock Test (Midterms) BSIT107

    Xai Alexandrei Delos Reyes · 40問 · 2年前

    UTS Mock Test (Midterms) BSIT107

    UTS Mock Test (Midterms) BSIT107

    40問 • 2年前
    Xai Alexandrei Delos Reyes

    Entrepreneurship Mock Test (Midterms) BSIT 107

    Entrepreneurship Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 38問 · 2年前

    Entrepreneurship Mock Test (Midterms) BSIT 107

    Entrepreneurship Mock Test (Midterms) BSIT 107

    38問 • 2年前
    Xai Alexandrei Delos Reyes

    Contemporary World Mock Test (Midterms) BSIT 107

    Contemporary World Mock Test (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 28問 · 2年前

    Contemporary World Mock Test (Midterms) BSIT 107

    Contemporary World Mock Test (Midterms) BSIT 107

    28問 • 2年前
    Xai Alexandrei Delos Reyes

    Math Mocktest (Midterms) BSIT 107

    Math Mocktest (Midterms) BSIT 107

    Xai Alexandrei Delos Reyes · 24問 · 2年前

    Math Mocktest (Midterms) BSIT 107

    Math Mocktest (Midterms) BSIT 107

    24問 • 2年前
    Xai Alexandrei Delos Reyes

    Computer Programming Mocktest (Pre-finals)

    Computer Programming Mocktest (Pre-finals)

    Xai Alexandrei Delos Reyes · 26問 · 2年前

    Computer Programming Mocktest (Pre-finals)

    Computer Programming Mocktest (Pre-finals)

    26問 • 2年前
    Xai Alexandrei Delos Reyes

    Math Mocktest (Pre-Finals)

    Math Mocktest (Pre-Finals)

    Xai Alexandrei Delos Reyes · 19問 · 2年前

    Math Mocktest (Pre-Finals)

    Math Mocktest (Pre-Finals)

    19問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock Test (Pre-finals)

    Computing Mock Test (Pre-finals)

    Xai Alexandrei Delos Reyes · 36問 · 2年前

    Computing Mock Test (Pre-finals)

    Computing Mock Test (Pre-finals)

    36問 • 2年前
    Xai Alexandrei Delos Reyes

    Computing Mock Test Finals

    Computing Mock Test Finals

    Xai Alexandrei Delos Reyes · 26問 · 2年前

    Computing Mock Test Finals

    Computing Mock Test Finals

    26問 • 2年前
    Xai Alexandrei Delos Reyes

    Comprog 2nd sem (prelims) BSIT 205

    Comprog 2nd sem (prelims) BSIT 205

    Xai Alexandrei Delos Reyes · 63問 · 1年前

    Comprog 2nd sem (prelims) BSIT 205

    Comprog 2nd sem (prelims) BSIT 205

    63問 • 1年前
    Xai Alexandrei Delos Reyes

    Discrete Math 2nd sem (prelims) BSIT 205

    Discrete Math 2nd sem (prelims) BSIT 205

    Xai Alexandrei Delos Reyes · 36問 · 1年前

    Discrete Math 2nd sem (prelims) BSIT 205

    Discrete Math 2nd sem (prelims) BSIT 205

    36問 • 1年前
    Xai Alexandrei Delos Reyes

    Art Appreciation (Prelim) BSIT 205

    Art Appreciation (Prelim) BSIT 205

    Xai Alexandrei Delos Reyes · 56問 · 1年前

    Art Appreciation (Prelim) BSIT 205

    Art Appreciation (Prelim) BSIT 205

    56問 • 1年前
    Xai Alexandrei Delos Reyes

    Ethics 2nd sem (Prelims) BSIT 205

    Ethics 2nd sem (Prelims) BSIT 205

    Xai Alexandrei Delos Reyes · 45問 · 1年前

    Ethics 2nd sem (Prelims) BSIT 205

    Ethics 2nd sem (Prelims) BSIT 205

    45問 • 1年前
    Xai Alexandrei Delos Reyes

    STS 2nd Sem (Prelim) BSIT 205

    STS 2nd Sem (Prelim) BSIT 205

    Xai Alexandrei Delos Reyes · 40問 · 1年前

    STS 2nd Sem (Prelim) BSIT 205

    STS 2nd Sem (Prelim) BSIT 205

    40問 • 1年前
    Xai Alexandrei Delos Reyes

    問題一覧

  • 1

    These routes are manually configured by network administrators, have low system requirements, and apply to simple, stable, and small networks.

    Static Routes

  • 2

    These are used only when packets to be forwarded do not match any routing entry in an IP routing table. routes are manually configured by network administrators, have low system requirements, and apply to simple, stable, and small networks.

    Default Routes

  • 3

    On the Internet, routers need to exchange routing information in the interconnection of networks called ______________ a collection of networks and subnetworks.

    Autonomous Systems

  • 4

    The autonomous systems are connected together in the form of a network called the __________.

    Core Network

  • 5

    Within AS, one network is connected to another network by an ___________.

    Interior Gateway

  • 6

    The gateways that connect all the autonomous systems to the core network are called ____________.

    Exterior gateways

  • 7

    It is meant to dynamically route data across a network that you fully control and maintain. Basically, it is meant to dynamically route data across a network that you fully control and maintain.

    Interior Gateway Protocol (IGP)

  • 8

    This routing protocols are used to exchange routes between distinctly separate networks that you have no administrative control over.

    Exterior Gateway Protocol (BGP)

  • 9

    determine good paths (routes) from senders to receivers through the network of routers.

    Routing algorithms

  • 10

    the path with the smallest number of links between the source and the destination.

    Shortest path

  • 11

    finds a path between the source and destination with the least cost.

    Least-cost path

  • 12

    In this type of routing, all the routers send their routing tables to only their neighboring routers.

    DISTANCE-VECTOR ROUTING PROTOCOL

  • 13

    In this type of routing, each of the routers sends the state of its own interfaces to all other routers only when there is a change to report.

    LINK-STATE ROUTING PROTOCOL

  • 14

    the description of the router interface.

    Link-State (LS)

  • 15

    the cost of sending data packets on the interface, expressed in the link state metric.

    Output cost

  • 16

    these are other routers that are attached through the link-state.

    List of neighboring routers

  • 17

    an OSPF data packet containing link-state and routing information that is shared with the other routers.

    Link-State Advertisement (LSA)

  • 18

    a unit of data describing the local state of router's interfaces and adjacencies. The collected LS advertisements of all routers and networks form the LSDB.

    Link-State PDU

  • 19

    a collection of all LS PDUs originated from the area's routers. Each router advertises directly-connected networks via LS PDU.

    Link-State Database (LSDB)

  • 20

    This is a link-state routing protocol developed by the IETF in 1988 that is capable of quickly detecting topological changes within the autonomous system and establishing loop-free routes in a short period of time, with minimum additional communication overhead for negotiating topology changes between peering routers.

    Open Shortest Path First (OSPF)

  • 21

    The OSPF area keyword identifies an OSPF area. This is considered a logical group, and each group is identified by an area ID.

    Area

  • 22

    is the ISO name for a router. It is the communication between intermediate systems or routers.

    IS (Intermediate System)

  • 23

    is a device on the network, such as a server or workstation. (Hosts)

    ES (End System)

  • 24

    is a network service in the OSI stack

    CLNS (Connection-Less Network Service)

  • 25

    is a Layer-3 address for CLNS packets. This is like an IP address in the TCP/IP stack. IS-IS uses NSAP addresses for communication, not IP addresses.

    NSAP (Network Service Access Point)

  • 26

    contains information, such as the destination IP address, cost, and next-hop IP address, which guides packet forwarding.

    OSPF routing table

  • 27

    This is a commonly used distance vector routing that uses its routing metric to determine the best route or shortest path a packet has to traverse from the source to a destination over a network. RIP is a distance-vector IGP and has a preference of 100.

    Routing Information Protocol (RIP)

  • 28

    RIP uses a _____ as the route cost.

    hop count

  • 29

    When a RIP routerstarts up, itsends a ________ to all of its neighbors to request routing information of the entire RIP network.

    RIP request

  • 30

    also allows IP multicast packets for its announcements

    RIPv2

  • 31

    uses IP broadcast packets for its announcements.

    RIPv1

  • 32

    Important concepts about the relationship between OSPF routers:

    neighbor relationship and adjacency

  • 33

    It is a special data packet (message) that is sent out periodically from a router to establish and confirm network adjacency relationships to other routers in the OSPF.

    HELLO Packet

  • 34

    Routers that run a link-state routing protocol establish a neighbor elationship and then exchange Link State Advertisements, which indicate the devices’ presence with every interface port of a router.

    Step 1. LSA Flooding

  • 35

    Each router generates LSAs and adds the received LSAs to its own link-state database (LSDB). Routers learn the whole network topology through the LSDB

    Step 2. LSDB Creation

  • 36

    Each router uses the Shortest Path First (SPF) algorithm and LSDB information to calculate routes. Each router calculates a loop-free tree with itself as the root and the shortest path. L With this tree, a router determines the optimal path to each corner of a network.

    Step 3. SPF Calculation

  • 37

    The router installs routes for the calculated preferred paths into its routing table.

    Step 4. Routing Table Generation