North American Network Operators Group
Date Prev  Date Next 
Date Index 
Thread Index 
Author Index 
Historical
RE: Get out your textbooks for this one!
 From: Martin, Christian
 Date: Wed Sep 23 12:59:57 1998
Problem 3, I haven't a clue, but problem 4 is the classical
Dijkstra/BellmanFord algorithm problem. To build the routing table for
each node stepbysptep would consume much paper!
Chris
> Original Message
> From: Lutz, Kyle [mailto:Kyle@birchtel.com]
> Sent: Wednesday, September 23, 1998 11:15 AM
> To: 'nanog@merit.edu'
> Subject: Get out your textbooks for this one!
>
>
> I have implemented hundreds of networks and designed them
> over the years
> but I have not a clue on these questions.
>
> I realize that this is much more towards hardware design, but I know
> that many of us have background there.
>
> Networking design 101
>
> > problem 3: clearly illustrate the design of a knockout
> > crossbar switch
> > that enables an output port to choose packets from 9 input ports
> > simultaneously in a 12x12 switch. your switch design must use
> > the FEWEST
> > number of 2x2 switching elements.
> >
> > problem 4: consider the network topology given in figure 2.
> > the label for
> > each of the links in the figure denotes the delay experience
> > by any packet
> > traversing the link (in either direction). each node is assumed to
> > initially know the delays of its outgoing links and all links
> > are assumed
> > to be bidirectional. clearly show the routing table of
> node A step by
> > step, from the initial state to the final state (when the
> > routing table
> > stabilizes), for the following two cases:
> >
> > o when the routing algorithm is the Distance Vector algorithm
> > o when the routing algorithm is the Link State algorithm
> >
> > __ 3 __B__ 4 __
> > / \
> > A 5 C\ H
> > \  \ /
> >  2  1 2
> > 1 \  \ /
> >  E 6 / D
> >   3
> > F 9 G/
> >
> >
>
>
