P5. 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 11100000 00111111 1111 11111111 11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1 11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2 otherwise a. Provide a forwarding table that has five entries, uses longest prefix match- ing, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link inter- face for datagrams with destination addresses:

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Show me how to solve please
P5. 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
11100000 00111111 1111111111111111
11100000 01000000 00000000 00000000
through
11100000 01000000 11111111 11111111
11100000 01000001 00000000 00000000
through
11100001 01111111 11111
11111111
otherwise
a. Provide a forwarding table that has live entries, uses longest prefix match-
ing, and forwards packets to the correct link interfaces.
b. Describe how your forwarding table determmines the appropriate link inter-
face for datagrams with destination addresses:
11001000 10010001 01010001 01010101
11100001 O1I000000 11000011 00111100
11100001 10000000 00010001 01110111
P6. Consider a datagram network using 8-bit host addresses. Suppose a router
uses longest prefix matching and has the following forwarding table:
PI
Pielix Match
Interface
00
Transcribed Image Text:P5. 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 11100000 00111111 1111111111111111 11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 11100000 01000001 00000000 00000000 through 11100001 01111111 11111 11111111 otherwise a. Provide a forwarding table that has live entries, uses longest prefix match- ing, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determmines the appropriate link inter- face for datagrams with destination addresses: 11001000 10010001 01010001 01010101 11100001 O1I000000 11000011 00111100 11100001 10000000 00010001 01110111 P6. Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: PI Pielix Match Interface 00
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY