Re: Yakov Rekhter's comment on IDPR architecture
Noel Chiappa <jnc@ginger.lcs.mit.edu> Fri, 15 May 1992 21:12 UTC
Received: from nri.nri.reston.va.us by ietf.NRI.Reston.VA.US id aa04286;
15 May 92 17:12 EDT
Received: from nri.reston.va.us by NRI.Reston.VA.US id aa13757;
15 May 92 17:18 EDT
Received: from PIZZA.BBN.COM by NRI.Reston.VA.US id aa13744;
15 May 92 17:18 EDT
Received: from pizza by PIZZA.BBN.COM id aa11164; 15 May 92 17:03 EDT
Received: from BBN.COM by PIZZA.BBN.COM id aa11158; 15 May 92 17:01 EDT
Received: from GINGER.LCS.MIT.EDU by BBN.COM id aa17430; 15 May 92 17:02 EDT
Received: by ginger.lcs.mit.edu
id AA29900; Fri, 15 May 92 17:01:58 -0400
Date: Fri, 15 May 92 17:01:58 -0400
From: Noel Chiappa <jnc@ginger.lcs.mit.edu>
Message-Id: <9205152101.AA29900@ginger.lcs.mit.edu>
To: B.Kumar@cs.ucl.ac.uk, msteenst@bbn.com
Subject: Re: Yakov Rekhter's comment on IDPR architecture
Cc: idpr-wg@bbn.com, jnc@ginger.lcs.mit.edu
You've got your own map (everyone has a map). You can use whatever algorithm you want to create the route (just like everyone driving cars gets to pick their own route to wherever they are going). If you want to try and find an optimal path, information is included in the map to allow you do that. However, if the map contains new markings which you don't understand because your software is old, you may not be able to find the best path, but you can probably find a good path (it's impossible to quantify this without a topology to ask the question about). Noel