Suppose a router has built up the routing table shown in Table 3.19. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4. Assume the router does the longest prefix match. Describe what the router does with a packet addressed to each of the following destinations: (a) 128.96.171.92 (b) 128.96.167.151 (c) 128.96.163.151 (d) 128 96 160 192

Suppose a router has built up the routing table shown in Table 3.19. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4. Assume the router does the longest prefix match. Describe what the router does with a packet addressed to each of the following destinations: (a) 128.96.171.92 (b) 128.96.167.151 (c) 128.96.163.151 (d) 128 96 160 192

Principles of Information Security (MindTap Course List)

6th Edition

ISBN:9781337102063

Author:Michael E. Whitman, Herbert J. Mattord

Publisher:Michael E. Whitman, Herbert J. Mattord

Chapter6: Security Technology: Access Controls, Firewalls, And Vpns

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

Using packet tracer, implement a network that has the following components: 1- At least five routers 2- At least 7 subnets 3- At least 12 PCs 4- At least 4 switches 5- Use RIP routing protocol To assign IP addresses of the routers and PCs, use the IP address from your ID as follows Assume your id is 118zyxw, Consider the numbers z, y, x and w as deciemal You have the subnet 118.0.0.0/24 If your ID is 1181234 then the IP is 118.0.0.0/24 Use this subnet to get at least 7 subnets.
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? c. (c) hops required per received packet?
Consider the following diagram: A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies theentire rest of the internet. All 4 subnets each contain the same number of hosts.Consider the following routing table at R3: CIDR Mask Link 0.0.0.0/0 L4 128.4.6.0/24 L3 128.4.8.0/24 L5 1. If 128.4.6.0 is in A, what is the routing table at R1? 2. The ISP that owns all these networks is short on IP addresses, so theyuse a NAT router for R2. How many public IP addresses will C andD use together assuming they use as many private 10.X IP addresses asthey can? How many total public IP addresses will be used by the entirenetwork? Why doesn’t the ISP care about how many private IP addressesare used? 3. Fix R3’s routing table now that we are using NAT: 4. A node in C is given the IP address 10.0.0.1 and only sends and receivespackets on port 1234. A packet destined for this node reaches R2 witha source of (IP=128.4.6.6, Port=3000) and destination of (IP=128.4.8.0,Port=10000).…
Consider a router that interconnects three subnets: A, B, and C. Supposeall of the interfaces in each of these subnets are required to have the prefix212.1.104.0/21. Suppose subnet A is required to support 1000 interfaces, andsubnets B and C are each required to support 500 interfaces. Provide networkaddresses for A,B and C (in the form a.b.c.d/x) that satisfy these constraints.
A router running Classless Interdomain Routing (CIDR) has the following entries in its routing table: Address/mask Next hop 135.46.56.0/22 Interface 0 135.46.60.0/22 Interface 1 192.53.40.0/23 Router 2 Default Router 3 How does a CIDR router work to route the packets it received? For each of the following IP addresses, what will the router do if a packet with that address arrives? (a) 135.46.63.10 (b) 135.46.58.16 (c) 135.46.52.2 (d) 192.53.40.7 (e) 192.53.56.7
P5. 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: (refer to first image) a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: (refer to second image)
Suppose you have the following network requirements, for Given an IP address and mask of 9.0.0.0/8, design an IP addressing scheme using VLSM? How is the efficiency of this method achieved? Use the topology in Figure to answer the questions. a. Network 1 needs to support 330 host addresses. b. Network 2 needs to support 62 host addresses. c. Network 3 needs to support 2 host addresses. d. Network 4 needs to support 520 host addresses. e. Network 5 needs to support 230 host addresses. f. Network 6 needs to support 62 host addresses. g. Network 7 needs to support 2 host addresses. h. Network 8 needs to support 2 host addresses.
Consider a datagram network using 32-bit host addresses, i.e., IP addresses range from 0 to 255. Suppose a router uses longest prefix matching and has the following forwarding table: For each of the four interfaces, please give the associated range of destination host address and the number of addresses in the range.
Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…
P1. Consider the network below. a. Show the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3. b. Can you write down a forwarding table in router A, such that all traffic from H1 destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4? (Hint: This is a trick question.)
Consider a scenario in which Host A and Host B want to send messages to Host C. Hosts A and C are connected by a channel that can lose and corrupt (but not reorder) messages. Hosts B and C are connected by another channel (independent of the channel connecting A and C) with the same properties. The transport layer at Host C should alternate in delivering messages from A and B to the layer above (that is, it should first deliver the data from a packet from A, then the data from a packet from B, and so on). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A and B to C, with alternating delivery at C as described above. Give FSM descriptions of A and C.