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) hops required per received packet?

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

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?
Data Communication Suppose that Router A and Router B are connected via a 0.05 Mbps link (note, 1 Mbps = 106 bps) and that the link connecting the two routers has a length of 80 meters. Suppose that Router A is in the process oftransmitting a packet, and that there are 15 additional packets in the queue of the router, when a new packet arrives at Router A. Assume the followinga. Every packet consists of 15,000 bits.b. 5000 bits of the currently-being-transmitted packet has been transmitted by Router A when the new packet arrives at Router A. c. Propagation speed of a bit over the link connecting the two routersis 2 ? 103 meters/sec.d. Processing delay of a packet at a router takes 1 millisecond (i.e., 0.001 seconds).What is the total delay of the new packet in arriving at Router B, i.e., how long does it take the new packet to arrive at Router B from the time it arrived at Router A? In your solution, clearly identify all four delay components the new packet experiences.
A workstation uses the HTTP protocol to download a large file from a web server. No proxy server is used. One router's queue is full when one of the web server's packets arrives.Select the four best statements to describe this situationa. The router stores the packet until such time that it can be sent.b. Further packets sent by the server are transmitted at a higher rate to compensate for the lost packet.c. The router sends an ICMP link congested message to the server.d. The packet must be retransmitted.e. Router configuration and network behavior could be improved by configuring FQ or WFQ.f. Further packets sent by the server are transmitted at a lower rate to reduce the load on the congested link.g. Router configuration and network behavior could be improved by configuring RED or WRED.h. A tail drop will happen.
Suppose that Router A and Router B are connected via a 0.05 Mbps link (note, 1 Mbps = 106 bps) and that the link connecting the two routers has a length of 80 meters. Suppose that Router A is in the process oftransmitting a packet, and that there are 15 additional packets in the queue of the router, when a new packet arrives at Router A. Assume the followinga. Every packet consists of 15,000 bits.b. 5000 bits of the currently-being-transmitted packet has been transmitted by Router A when the new packet arrives at Router A. c. Propagation speed of a bit over the link connecting the two routersis 2 ? 103 meters/sec.d. Processing delay of a packet at a router takes 1 millisecond (i.e., 0.001 seconds).What is the total delay of the new packet in arriving at Router B, i.e., how long does it take the new packet to arrive at Router B from the time it arrived at Router A? In your solution, clearly identify all four delay components the new packet experiences.
A router interconnects a subnet, where all the interfaces of the subnets must have the prefix 164.132.62/24. suppose that the Subnet is required to support up to 60 interfaces, provide a network address that satisfies the above.
hdet b) Consider sending a packet contains 1100 bits from Host A to Host B in a store and forward nerwork. There are 10 links (and 9 routers) between A and B, and the links are congested (there Is a queuing delays). Assume propagation delay over the links are negligible. As a packet travels along the route, it encounters an average of 5 packets already waiting in the queue to be transmitted when it arrives at each router, How long does it take for the packet to get to the receiver if the nodes transmit on a "first come first served" basis (in ms)?
The routing technique FLOODING is used in certain contexts. It means that Group of answer options Incoming packets are sent out on all router interfaces except where they came from. Incoming packets are sent out on all router interfaces. Incoming packets are sent out on the fastest router interface. Incoming packets are sent out on the two fastest router interfaces.
Question 5: Suppose you attach a network monitor to observe the sequence of frames that travel over a link from sender A to receiver B. The problem is to deduce what protocols, if any, could have generated the observed sequence. The following diagrams depict a flow of frames, with their corresponding sequence numbers, from the sender (A). There may be traffic from B to A, which is not depicted in the diagram. A gap between adjacent frames implies passage of time with no transmission from the sender. Note that the x-axis is time, and not space. Justify your answer. A A A ● ● ● ● 1 5 ● 3 5 0 ● 0 0 1 1 1 ● Go-Back-N ● Selective Repeat 1 0 5 0 c) For Diagram 3, the protocol is not: Stop-and-Wait Time Diagram 1 2 Time a) For Diagram 1, the most likely protocol being used is: Stop-and-Wait ● Go-Back-N (if Go-Back-N, give the window size) Selective Repeat (if Selective Repeat, give the window size) Diagram 2 Time 3 Diagram 3 1 Time b) For Diagram 2, the most likely protocol being used is:…
Consider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases: The first packet in the sender window size is lost before reaching the destination. All transmitted packets reached the destination except the third one. Only the first and last packets in the sender window size reached the destination. Only the ACKs of the first and last packets, in the sender window size, reached the destination.
Consider a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?
5.03-5. Dijkstra's Algorithm (3, part 5). Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? OF (A) 3 2 4 B 8 D 10 4 E 4 2 F