Re: a question on policy gateways

Danny Lee <> Wed, 13 October 1993 19:59 UTC

Received: from by IETF.CNRI.Reston.VA.US id aa15417; 13 Oct 93 15:59 EDT
Received: from CNRI.RESTON.VA.US by IETF.CNRI.Reston.VA.US id aa15413; 13 Oct 93 15:59 EDT
Received: from PIZZA.BBN.COM by CNRI.Reston.VA.US id aa28685; 13 Oct 93 15:59 EDT
Received: from pizza by PIZZA.BBN.COM id aa06715; 13 Oct 93 15:53 EDT
Received: from BBN.COM by PIZZA.BBN.COM id aa06711; 13 Oct 93 15:48 EDT
Received: from by BBN.COM id aa23599; 13 Oct 93 15:49 EDT
Received: by (5.65/2.7davy) id AA28104; Wed, 13 Oct 93 12:48:49 -0700
Message-Id: <>
Date: Wed, 13 Oct 93 12:48:49 -0700
Sender: ietf-archive-request@IETF.CNRI.Reston.VA.US
From: Danny Lee <>
Subject: Re: a question on policy gateways

The routing objectives that you mentioned in your email note are
supported in the present design of IDPR via source policy
specifications.  Source policies allow the originating domain to
specify which domains to { "exclude", "avoid", or "favor" } when
computing a route.  As indicated in the IDPR specification, the
{ exclude } attribute will yield routes that exclude the domain to
which the attribute is tagged.  The { avoid } route is interpreted
as a routing bias, with the possibility that a route may traverse
the indicated domain.

We have implemented routing by preference in our version of the IDPR
code for GATED in the following way.  The { avoid, favor } attributes
map into a routing metric that is used during graph search.  (Domains
that do no have the { avoid, favor } attributes map to a default value.)
The { exclude } attribute is used prune the graph that during graph
search.  To ensure that certain routing algorithms (e.g., Dijkstra's
SPF) do not cycle till negative infinity, the { avoid, default, favor }
attributes map into positive values.

> How about W1 and S3/S4?
> Should W1 be able to monitor the connectivity 
> between S1 and S3/S4?

One possible perspective is to view transit policies as a set of
intradomain virtual links that is available to carry interdomain
traffic.  Thus, receipt of a transit policies by W1 from S1 that
reference S3 and S4 in virtual gateways can be construed as the
existence of connectivity between the set of gateways { S1, S3, S4 }.
By intelligent updating and interpretations of transit policies,
remote domains can derive a fairly complete description the entry
and exit points (i.e., interexchange points) within the internetwork.