SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.

To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

The pleasure of all reading is doubled when one lives with another who shares the same. -Katherine Mansfield

 

#
Authors:
James F. Kurose, Keith W. Ross
Chapter:
The Network Layer
Exercise:
Problems
Question:15 | ISBN:9780132856201 | Edition: 6

Question

In Problem P10 you are asked to provide a forwarding table (using longest prefix matching). Rewrite this forwarding table using the a.b.c.d/x notation instead of the binary string notation.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

Take the forwarding table (using longest prefix matching) in problem 10.

Range of Destination address Link interface
11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 1111111 0
11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1
11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2
Otherwise 3

Now the following steps are used for the above forwarding table convert the a.b.c.d/x notation:

  • The number of significant bits used to identify a network.
  • Identify hosts are remaining 32-n bits
  • The network prefix defined is \x
Range of Destination address Link interface
224.0.0.0/10 0
224.64.0.0/16 1
224.65.0.0/7 2
Otherwise 3

 

0 0

Discussions

Post the discussion to improve the above solution.