Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: Destination Address Range Link Interface 11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 11111111 0 11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1 11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2 Otherwise 3 1) Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. (6 points) Prefix Match Link Interface
时间: 2023-06-25 07:04:04 浏览: 336
Reading-and-comprehense-linux-Kernel-network-protocol-stack-master.7z
Prefix Match Link Interface
11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 11111111 0
11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1
11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2
Default (otherwise) 3
阅读全文