EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem R9RQ
Program Plan Intro
Destination-based forwarding:
Destination based forwarding is a packet forwarding technique which is based on the destination address. Every data packet used in the transmission has the information of the address of the required destination.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps.
What is the queuing delay for the packet?
More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
Suppose that an arriving packet matches two or more entries in a router's forwarding table. With traditional
destination-based forwarding, what rule does a router apply to determine which of these rules should be
applied to determine the output port to which the arriving packet should be switched?
Suppose an arrival packet suits two or more entries in the forwarding table of a router. For conventional destination-based transmission, what law does a router have to apply to decide the output port to which the packet is to be switched?'
Chapter 4 Solutions
EBK COMPUTER NETWORKING
Ch. 4 - Lets review some of the terminology used in this...Ch. 4 - Prob. R2RQCh. 4 - Prob. R3RQCh. 4 - Prob. R4RQCh. 4 - Prob. R5RQCh. 4 - Prob. R6RQCh. 4 - Prob. R7RQCh. 4 - Prob. R8RQCh. 4 - Prob. R9RQCh. 4 - Prob. R10RQ
Ch. 4 - Prob. R11RQCh. 4 - Prob. R12RQCh. 4 - Prob. R13RQCh. 4 - Prob. R14RQCh. 4 - Prob. R15RQCh. 4 - Prob. R16RQCh. 4 - Prob. R17RQCh. 4 - Prob. R18RQCh. 4 - Prob. R19RQCh. 4 - Prob. R20RQCh. 4 - Prob. R21RQCh. 4 - Prob. R22RQCh. 4 - Prob. R23RQCh. 4 - Prob. R24RQCh. 4 - Prob. R25RQCh. 4 - Prob. R26RQCh. 4 - Prob. R27RQCh. 4 - Prob. R28RQCh. 4 - Prob. R29RQCh. 4 - Prob. R30RQCh. 4 - Prob. R31RQCh. 4 - Prob. R32RQCh. 4 - Prob. R33RQCh. 4 - Prob. R34RQCh. 4 - Prob. R35RQCh. 4 - Prob. P1PCh. 4 - Prob. P2PCh. 4 - Prob. P3PCh. 4 - Consider a datagram network using 32-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Prob. P8PCh. 4 - Prob. P9PCh. 4 - Prob. P10PCh. 4 - Prob. P11PCh. 4 - Prob. P12PCh. 4 - Consider sending a 2400-byte datagram into a link...Ch. 4 - Prob. P15PCh. 4 - Prob. P16PCh. 4 - Prob. P17PCh. 4 - Prob. P18PCh. 4 - Prob. P19PCh. 4 - Prob. P20PCh. 4 - Prob. P21PCh. 4 - Prob. P22P
Knowledge Booster
Similar questions
- Host A and B are communicating over a TCP connection, and Host B has already received all bytes up through byte 100 (including Byte 100) from A. Suppose Host A then sends two packets to Host B back-to-back. The first and second packets contain 40 and 80 bytes of data, respectively. Host B sends an acknowledgment whenever it receives a packet from Host A. a. What is the sequence number of the first packet sent from Host A to Host B? What is the sequence number of the second packet sent from Host A to Host B? b. If the second packet arrives before the first packet, in the acknowledgment of the first arriving packet, what is the acknowledgment number? .arrow_forwardSuppose 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.arrow_forwardQuestion:Now suppose that the message is segmented into 20 packets, with each packet being 1,000,000 bits long. How long does it take to move the first packet from source host to the first switch?When the first packet is being sent from the first switch to the second switch, the second packet is being sent from the source host to the first switch. At what time will the second packet be fully received at the first switch?arrow_forward
- 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?arrow_forward22. 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?arrow_forwardSuppose one packet is transmitted from a source to a destination via a path of N links each with a rate of R. Then, the end to end transmission delay is NL/R. What is the transmission delay time for P packets if the source and destination are connected via M routers?arrow_forward
- Question 8 Suppose that a TCP sender is sending segments with 100 bytes of payload. It sends five segments with sequence numbers 100, 200, 300, 400, and 500. Suppose that the segment with sequence number 300 is lost. What are the ACK values that the receiver returns to the sender after each of the four received segments are received. After receiving segment 100, the receiver responds with an ACK with value: After receiving segment 200, the receiver responds with an ACK with value: After receiving segment 400, the receiver responds with an ACK with value: After receiving segment 500, the receiver responds with an ACK with value: After receiving the retransmitted segment, the receiver responds with an ACK with value:arrow_forwardSuppose that between a sending host and a receiving host there is exactly one packet switch. The transmission rates between the sending host and the switch and between the switch and the receiving host are R 1 and R2, respectively. Assuming that the router uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length L. (Ignore queuing and propagation delay.)arrow_forwardDijkstra's algorithm is executed at node x, this will generate the forwarding table that router x will use to forward the received packets to any destination in the topology. 5. ... 3. 2 1 2 1 1. What represent the different numbers associated to the links? 2. Complete the following resulting forwarding table at node x. Destination Outgoing link (x.v) ... W LOarrow_forward
- A 3200 bit long TCP message is transmitted to the IP layer and becomes a datagram after adding a 160 bit header. The following Internet is connected by two LANs through routers. But the data part of the longest data frame that the second LAN can transmit is only 1200 bits. Therefore, datagrams must be segmented in the router. How many bits of data does the second LAN transmit to its upper layer?arrow_forwardDijkstra's algorithm is executed at node x, this will generate the forwarding table that router x will use to forward the received packets to any destination in the topology. 2 1 1. What represent the different numbers associated to the links? 2. Complete the following resulting forwarding table at node x. Outgoing link (X,v) Destination Varrow_forward1 Suppose we need to design a stop-and-wait, reliable data transfer protocol between a sender A and a receiver B, over a direct link with the following characteristics. • The channel from A to B is unreliable and can lose packets. • The channel from B to A is reliable. • Neither channel will corrupt a packet (if a packet is received, it must be correct). • Neither channel will reorder packets. The maximum RTT between A and B is known and is guaranteed to be D. For each of the following techniques for building reliable data transfer protocol, please match on whether or not, it is needed in the design of the protocol. . Acknowledgement Negative Acknowledgement Sequence Number Timeout Choose... + Choose... + Choose... + Choose... +arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage Learning
A+ Guide to Hardware (Standalone Book) (MindTap C...Computer ScienceISBN:9781305266452Author:Jean AndrewsPublisher:Cengage Learning
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher:Cengage Learning
A+ Guide to Hardware (Standalone Book) (MindTap C...
Computer Science
ISBN:9781305266452
Author:Jean Andrews
Publisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning