IDPR architecture comments
Martha Steenstrup <msteenst@bbn.com> Mon, 18 May 1992 18:44 UTC
Received: from nri.nri.reston.va.us by ietf.NRI.Reston.VA.US id aa02873;
18 May 92 14:44 EDT
Received: from nri.reston.va.us by NRI.Reston.VA.US id aa17340;
18 May 92 14:50 EDT
Received: from PIZZA.BBN.COM by NRI.Reston.VA.US id aa17336;
18 May 92 14:50 EDT
Received: from pizza by PIZZA.BBN.COM id aa01746; 18 May 92 13:03 EDT
To: yakov@watson.ibm.com
cc: idpr-wg@bbn.com
Subject: IDPR architecture comments
Date: Mon, 18 May 92 14:01:03 -0400
From: Martha Steenstrup <msteenst@bbn.com>
Message-ID: <9205181450.aa17336@NRI.Reston.VA.US>
Hello Yakov, Thanks for your comments. I don't think that I ever said anything about BGP/IDRP and distance vector distribution graphs. My reference to BGP/IDRP in the latest set of comments on the architecture document was an acknowledgement of your comment that loop suppression was taken care of by information contained in the distance messages themselves. The "transient" loop problem revisited. admittedly, i expect this event to be rare. but unfortunately, jitter will not make the problem disappear. X and Y need not be synchronized for this event to happen. all that must happen is that each receives and selects a distance vector (to Z) not containing the other before receiving the distance vector from the other. if X and Y are closer to Z than they are to each other, then they are more likely to experience the problem. m
- IDPR architecture comments Martha Steenstrup