MESSAGE
| DATE | 2016-05-03 |
| FROM | Ruben Safir
|
| SUBJECT | Re: [Hangout-NYLXS] [ruben@mrbrklyn.com: Re: Are you busy today]
|
On 05/03/2016 06:42 PM, Kamran Mirzayev wrote:
>
> Hey Ruben! I think the answers (a) and (b) are correct. Routers use
> the� Longest prefix match algorithm
> [1]https://en.wikipedia.org/wiki/Longest_prefix_match. Hence, the
> answer (c) is incorrect because the 1st interface has the longest
> prefix match comparing to the 2nd interface. With the same logic,
> answer (d) is incorrect� because the 3rd interface has the longest
> prefix match comparing to the 2nd interface.
>
no, only 10100xxx
> On Tue, May 3, 2016 at 3:23 PM, Ruben Safir <[2]ruben-at-mrbrklyn.com>
> wrote:
>
> ----- Forwarded message from Ruben Safir <[3]ruben-at-mrbrklyn.com>
> -----
> Date: Tue, 3 May 2016 15:21:55 -0400
> From: Ruben Safir <[4]ruben-at-mrbrklyn.com>
> To: Kamran Mirzayev <[5]kamran.mirzayev-at-my.liu.edu>
> Cc: Ruben Safir <[6]ruben-at-mrbrklyn.com>
> Subject: Re: Are you busy today
> User-Agent: Mutt/1.5.21 (2010-09-15)
> how do you solve this?
> Suppose addresses are 8 bits. Given the following forwarding table:
> Prefix� Interface
> 1011� � 1
> 101� � � 2
> 10101� � 3
> 0� � � � 4
> 00� � � 5
> What range of addresses is forwarded to interface 2 ?
> � � � � a.� � � 10100xxx
> � � � � b.� � � 101000xx
> � � � � c.� � � 1011xxxx
> � � � � d.� � � 10101xxx
> --
>
_______________________________________________
hangout mailing list
hangout-at-nylxs.com
http://www.nylxs.com/
|
|
