Match the meaning of the items 1. Loop-back address in IPV6 2. Loop-back address in IPV4 3. Routing 4. Unicast routing 5. Connection-oriented packet switching 6. Criteria at which network layer is measured 7. This host address in IPV4 8. Distance vector routing 9. Link state routing 10. Packet switching 11. IPV6 12. Subnetting 13. Dijkstra algorithm 14. Address Space 15. Connectionless oriented packet switching 16. Network layer 17. Bellman-Ford algorithm 18. Distance vector routing 19. IPV4 20. Global unicast address in IPV6 https://www.dropbox.com/s/lmv2bjbd92m2eyz/Screenshot%202022-11-03%20201119.jpg?dl=0  

Transcribed Image Text:

Provide services to the transport layer and receives services from the link layer. Concerned with packetizing, routing, and forwarding of packets. A mode of data transmission in which a message is broken into a number of parts which are sent independently, over whatever route is optimum for each packet, and reassembled at the destination. Delay throughput and packet loss ang que hat is based on a later An internet addressing technique that uses 32 bits An internet addressing technique that uses 128 bits to solve issues in the limited number of addresses in 32 bil-addressing scheme. A routing algorithm that determines the best or least-cost routes by creating least-cost tree with the information a node has about its immediate neighbors. The incomplete-trees are exchanged between immediate neighbors to make the trees more and more complete and to represent the whole internet. The total number of addresses used by the protocol The practice of dividing a network into two or more networks 0.0.0.0/32 0000:1/128 127.0.0.0/8 2000/3 This routing algorithm associates cost with an edge to define the state of a link. Links with lower costs are preferred to links with higher costs. To compute the best route a node has a collection of states for all links that represents a complete map of the network Link state routing depends on this algorithm to compute the best route. Distance vector routing depends on this algorithm to compute the best route a packet forwarding technique that is based on the destination address. To direct and deliver a datagram from its source to its destination or destinations One-to-one delivery, a datagram is directed and delivered to only one destination Provide services to the transport layer and receives services from the link layer. Concerned with packetizing, routing, and forwarding of packets. A mode of data transmission in which a message is broken into a number of parts which are sent independently, over whatever route is optimum for each packet, and reassembled at the destination. Delay throughput and packet loss ang que hat is based on a later An internet addressing technique that uses 32 bits An internet addressing technique that uses 128 bits to solve issues in the limited number of addresses in 32 bil-addressing scheme. A routing algorithm that determines the best or least-cost routes by creating least-cost tree with the information a node has about its immediate neighbors. The incomplete-trees are exchanged between immediate neighbors to make the trees more and more complete and to represent the whole internet. The total number of addresses used by the protocol The practice of dividing a network into two or more networks 0.0.0.0/32 0000:1/128 127.0.0.0/8 2000/3 This routing algorithm associates cost with an edge to define the state of a link. Links with lower costs are preferred to links with higher costs. To compute the best route a node has a collection of states for all links that represents a complete map of the network Link state routing depends on this algorithm to compute the best route. Distance vector routing depends on this algorithm to compute the best route a packet forwarding technique that is based on the destination address. To direct and deliver a datagram from its source to its destination or destinations One-to-one delivery, a datagram is directed and delivered to only one destination