[45030] in North American Network Operators' Group
Re: Intelligent IGP Link Costing Algorithms?
daemon@ATHENA.MIT.EDU (Joel Krauska)
Fri Jan 11 01:24:04 2002
Message-ID: <003801c19a68$73f44870$6401a8c0@cool>
From: "Joel Krauska" <jkrauska@gte.net>
To: "Patrick Greenwell" <patrick@stealthgeeks.net>
Cc: <nanog@merit.edu>
Date: Thu, 10 Jan 2002 22:23:14 -0800
MIME-Version: 1.0
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
Errors-To: owner-nanog-outgoing@merit.edu
> > An added twist appears to be that a full demand matrix
> > is difficult to build without large systems of flow
> > collection. I'm curious if the problem can easily be
> > approached without full insight in to this data.
> > (per link usage yes, but without end-to-end flows)
>
> It's not merely flow data. You also have to include variables such as
cost of
> the circuit(s) at a given data rate.
True, but this even further complicates the optimization.
You could equally consider multiple upstream provider
transit costs. I was trying to keep it simple.
I was simplifying based on the fact that most large
providers own or lease their own backbones, and don't
directly pay per bit on their own network.
-Joel
