4.2-4. Longest prefix matching. Consider the following forwarding table below. Indicate the output to link interface to which a datagram with the destination addresses below will be forwarded under longest prefix matching. (Note: The list of addresses is ordered below. If two addresses map to the same output link interface, map the first of these two addresses to the first instance of that link interface.) [Note: You can find more examples of problems similar to this here.] Destination Address Range Link interface 11001000 00010111 00010 *** ******** 11001000 00010111 00011000 1 ******** 11001000 00010111 00011*** 2 ******k** otherwise 3 11001000 00010111 00010010 10101101 A. This is the first destination address in the list that maps to output port 0. O 11001000 00010111 00011000 00001101 e 11001000 00010111 00011001 11001101 B. This is the first destination address in the list that maps to output port 1. 10001000 11100000 00011000 00001101 C. This is the first destination address in the list that maps to output port 11001000 00010111 00011000 11001111 2 e 11001000 00010111 00010001 01010101 D. This is the first destination address in the list that maps to output port 3. O 11001000 00010111 00011101 01101101 E. This is the second destination address in the list that maps to output port 3
4.2-4. Longest prefix matching. Consider the following forwarding table below. Indicate the output to link interface to which a datagram with the destination addresses below will be forwarded under longest prefix matching. (Note: The list of addresses is ordered below. If two addresses map to the same output link interface, map the first of these two addresses to the first instance of that link interface.) [Note: You can find more examples of problems similar to this here.] Destination Address Range Link interface 11001000 00010111 00010 *** ******** 11001000 00010111 00011000 1 ******** 11001000 00010111 00011*** 2 ******k** otherwise 3 11001000 00010111 00010010 10101101 A. This is the first destination address in the list that maps to output port 0. O 11001000 00010111 00011000 00001101 e 11001000 00010111 00011001 11001101 B. This is the first destination address in the list that maps to output port 1. 10001000 11100000 00011000 00001101 C. This is the first destination address in the list that maps to output port 11001000 00010111 00011000 11001111 2 e 11001000 00010111 00010001 01010101 D. This is the first destination address in the list that maps to output port 3. O 11001000 00010111 00011101 01101101 E. This is the second destination address in the list that maps to output port 3
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![4.2-4. Longest prefix matching. Consider the following forwarding table below. Indicate the output to link interface to which a datagram with the
destination addresses below will be forwarded under longest prefix matching. (Note: The list of addresses is ordered below. If two addresses map to
the same output link interface, map the first of these two addresses to the first instance of that link interface.) [Note: You can find more examples of problems
similar to this here.]
Destination Address Range
Link interface
11001000
00010111
00010***
****k***
11001000
00010111
00011000
********
11001000
00010111
00011***
2
********
otherwise
3
11001000 00010111 00010010 10101101
A. This is the first destination address in the list that maps to output port
0.
: 11001000 00010111 00011000 00001101
B. This is the first destination address in the list that maps to output port
: 11001000 00010111 00011001 11001101
1.
e 10001000 11100000 00011000 00001101
C. This is the first destination address in the list that maps to output port
a 11001000 00010111 00011000 11001111
2.
: 11001000 00010111 00010001 01010101
D. This is the first destination address in the list that maps to output port
3.
: 11001000 00010111 00011101 01101101
E. This is the second destination address in the list that maps to output
port 3.
F. This is the second destination address in the list that maps to output
port 1.
G. This is the second destination address in the list that maps to output
port 0.
H. This is the second destination address in the list that maps to output
port 2.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb5ac08f7-42c3-4170-80a5-c0dc5b612826%2F22df2d8e-d7f7-42d9-b40b-c0c307f871bb%2Fbwjtz4_processed.png&w=3840&q=75)
Transcribed Image Text:4.2-4. Longest prefix matching. Consider the following forwarding table below. Indicate the output to link interface to which a datagram with the
destination addresses below will be forwarded under longest prefix matching. (Note: The list of addresses is ordered below. If two addresses map to
the same output link interface, map the first of these two addresses to the first instance of that link interface.) [Note: You can find more examples of problems
similar to this here.]
Destination Address Range
Link interface
11001000
00010111
00010***
****k***
11001000
00010111
00011000
********
11001000
00010111
00011***
2
********
otherwise
3
11001000 00010111 00010010 10101101
A. This is the first destination address in the list that maps to output port
0.
: 11001000 00010111 00011000 00001101
B. This is the first destination address in the list that maps to output port
: 11001000 00010111 00011001 11001101
1.
e 10001000 11100000 00011000 00001101
C. This is the first destination address in the list that maps to output port
a 11001000 00010111 00011000 11001111
2.
: 11001000 00010111 00010001 01010101
D. This is the first destination address in the list that maps to output port
3.
: 11001000 00010111 00011101 01101101
E. This is the second destination address in the list that maps to output
port 3.
F. This is the second destination address in the list that maps to output
port 1.
G. This is the second destination address in the list that maps to output
port 0.
H. This is the second destination address in the list that maps to output
port 2.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education