Re: [Cse461] Re: hw2 q1

From: Janet Davis (jlnd_at_cs.washington.edu)
Date: Tue Feb 10 2004 - 13:03:35 PST

  • Next message: Janet Davis: "Re: [Cse461] Re: Question 5"

    If you're not finding the "hint" below helpful, please don't worry. I
    thought I had a way for packets to loop based on this hint, but as I
    thought about it longer, I realized it didn't quite work.

    Cheers,
    Janet

    On Mon, 9 Feb 2004, Janet Davis wrote:

    > On Sun, 8 Feb 2004, Tsz (Oscar) Ng wrote:
    >
    > > For 1a, do we assume that the network topology doesn't change while the
    > > packet is transmitting (i.e. a node is added or removed)?
    >
    > Yes, please assume that the topology doesn't change for part (a).
    >
    > However, you may assume that if two paths have the same propagation delay
    > to a particular node, two copies of the packet delivered along both paths
    > will arrive in random order. For instance, consider this topology with
    > all propagation delays equal:
    >
    > B
    > / \
    > A D
    > \ /
    > C
    >
    > If A floods a packet to the broadcast address, it's random whether the
    > first copy to arrive at D will come from B or C.
    >
    > Cheers,
    > Janet
    >
    > --
    > Janet Davis
    > jlnd_at_cs.washington.edu
    > http://www.cs.washington.edu/homes/jlnd/
    >
    > _______________________________________________
    > Cse461 mailing list
    > Cse461_at_cs.washington.edu
    > http://mailman.cs.washington.edu/mailman/listinfo/cse461
    > 

    -- 
Janet Davis
jlnd_at_cs.washington.edu
http://www.cs.washington.edu/homes/jlnd/
_______________________________________________
Cse461 mailing list
Cse461_at_cs.washington.edu
http://mailman.cs.washington.edu/mailman/listinfo/cse461
  • Next message: Janet Davis: "Re: [Cse461] Re: Question 5"

    This archive was generated by hypermail 2.1.6 : Tue Feb 10 2004 - 13:03:41 PST