[j-nsp] routing optimal path or suboptimal path

[Andrew Jimmy]

It would be nice if you can explain the following questions..

-----Original Message-----
From: Mark Tinka [mailto:mtinka at globaltransit.net] 
Sent: Saturday, October 25, 2008 7:13 PM
To: juniper-nsp at puck.nether.net
Cc: Andrew Jimmy
Subject: Re: [j-nsp] routing optimal path or suboptimal path

On Saturday 25 October 2008 21:53:55 Andrew Jimmy wrote:

> How do you guys practically define/consider that this is optimal path 
> and this is suboptimal path.

This may differ from network to network.

In our case: 

For the IGP; the optimal path is the shortest one to the Loopback address of
the end router. Default routing is sub-optimal and unsupported.

How do you guys practically configure this. What do you mean by this that
default routing is sub-optimal and unsupported? So what you have to do make
it optimal.

For BGP; the optimal path is generally the one with the shortest vector to
the end AS. The routing/forwarding table would typically be default-free.
However, other factors may cause this strategy to evolve, e.g.,
$ettlement-$tatu$ of circuits, circuit congestion, management decisions,
e.t.c.

It would be nice if you can further explain this.

How this is actually technically implemented is in the details. What the
above tries to show, for us, is a high-level strategy on how we consider
path optimity.

Cheers,

Mark.