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 | 0 |
| 11100000 00111111 1111111 11111111 | |
| 11100000 01000000 00000000 00000000 | |
| through | 1 |
| 11100000 01000000 11111111 11111111 | |
| 11100000 01000001 00000000 00000000 | |
| through | 2 |
| 11100001 01111111 11111111 11111111 | |
| otherwise | 3 |
- 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:
Learn your wayIncludes step-by-step video
Chapter 4 Solutions
EBK COMPUTER NETWORKING
Additional Engineering Textbook Solutions
Prelude to Programming
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Java: An Introduction to Problem Solving and Programming (8th Edition)
Mechanics of Materials
Database Concepts (8th Edition)
Starting Out With Visual Basic (7th Edition)
- An Internet Protocol (IP) address is a unique identifier for a computer on the Internet. How does a mnemonic address work? What is the greatest number of unique domains that the 32 bit representation can accommodate? And how many machines may be included in a domain?arrow_forwardComputer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?arrow_forwardComputer Science A source computer is connected to a destination computer through one router (R1). The throughput of the first hop is 1000Mbps and the throughput of the second hop is 10000 Mbps. What is the end-to-end throughput?arrow_forward
- What exactly is an Internet Protocol (IP) address and how does it function?So, what are mnemonic addresses precisely, and how do they work?The number of distinct domains that a 32-bit representation can represent is unknown. Is there a limit to the number of machines that can be included in a domain?arrow_forwardWhen designing Elementary data connection protocols, what kind of assumptions were made?arrow_forwardWhile developing a reliable transport protocol, early versions of the protocol discussed in class used a NAK message, sent by the receiver to the sender to indicate a packet was not correctly received. This kind of message, however, is not found in further protocols, like GBN, SR or even TCP. Why not? In other words, why don't these protocols provide a way to signal to the sender that the received message was received with an errorarrow_forward
- To begin, what is an Internet Protocol (IP) address and how does it differ from a domain name? What use do mnemonic addresses serve? Is there a restriction on the number of domains that a 32-bit representation can store? Is there a limit to the number of machines that a domain may contain?arrow_forwardNetwork Address Translation, or NAT, was used very often before IPv6 was fully implemented as a means to mask IPs, as well as to have many more IPs at one's disposal behind a router. Now that we are fully into using IPv6, is NAT needed anymore? What would some of the utility of NAT be?arrow_forwardComputer Science What is the total number of addresses in IPv6 address scheme (give your answer in comma separated actual numeric value)? Give examples of IPv6 address types: a unicast address, a multicast address, a loopback address, and an unspecified address (e.g., when host does not have an address assigned).arrow_forward
- In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…arrow_forwardConsider an Information system, of a frame size of (5 million) bits are being sent on a path with (10 routers) each having a queuing time of (2 µs) and a processing time of (1 µs). The length of the path is (2000 Km). Acknowledgement frame size is (10 bytes) and the speed of light inside the link is (2 *10^8 m/s). Every link on the path has a bandwidth of (5 Mbps), then the total delay (latency) for this frame is........... O 0.000016 sec. O 0.000020 sec. O 0.000010 sec. O 1.020046 sec. O 0.01 sec.arrow_forwardA technique for identifying and correcting errors in received data at different layers of a protocol stack is described below.arrow_forward
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning