hw5-sols

hw5-sols - CS 118 Spring 2008 : Homework 5 Problem 1 Dst...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 118 Spring 2008 : Homework 5 Problem 1 Dst Range Link 11100000 00000000 00000000 00000000 through 11100000 11111111 11111111 11111111 11100001 00000000 00000000 00000000 through 1 11100001 00000000 11111111 11111111 11100001 00000001 00000000 00000000 through 2 11100001 11111111 11111111 11111111 otherwise 3 Table 1: Forwarding table. Prefix Match Link Interface 11100000 11100001 00000000 1 11100001 2 otherwise 3 Table 2: Routing Problem 1 Suppose you have a datagram network that uses 32-bit host addresses. If a router has four links (0-3) and packets are to be forwarded to these links according to Table 1. a Provide a forwarding table that has 4 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: 11001000 10010001 01010001 01010101 11100001 00000000 11000011 00111100 11100001 10000000 00010001 01110111 See Table 2....
View Full Document

This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.

Page1 / 3

hw5-sols - CS 118 Spring 2008 : Homework 5 Problem 1 Dst...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online