The MPLS WG Archive

Cell Relay Retreat>MPLS WG Archive>month:2001-Jun> msg00249



[Date Prev][Date Next][Thread Prev][Thread Next]  
  [Date Index][Thread Index][Author Index][Subject Index]

constraint-based routing algorithms

  • From: "Frank Hujber" <fhujber@hotmail.com>
  • Date: Fri, 15 Jun 2001 16:47:10 -0400
  • X-OriginalArrivalTime: 15 Jun 2001 20:49:49.0031 (UTC) FILETIME=[B7B88F70:01C0F5DC]
  • X-Originating-IP: [12.34.209.74]

Can you give a clue as to any public domain documents for these protocols?

Frank Hujber
Alphion Corporation
fhujber@alphion.com
----- Original Message -----
From: Sudipta Sengupta <SSengupta@tellium.com>
To: 'Wayne W. Szeto' <wwszeto@math.uwaterloo.ca>; <mpls@UU.NET>
Sent: Friday, June 15, 2001 4:13 PM
Subject: RE: constraint-based routing algorithms


> OSPF TE extensions have been proposed to disseminate link bandwidth
> information for facilitating distributed traffic engineered route
> computation. one important metric for evaluating the efficiency of
> constraint-based routing algorithms is reduced path blocking. most of the
> algorithms mentioned below (mira, etc.) try to minimize path blocking in
an
> online routing model. vendors look upon the path computation module of
their
> MPLS software as proprietary and would not want to reveal the precise
> algorithms used. the interest of customers (carriers/ISPs) in such
> sophisticated algorithms is also not clear. a case needs to be made for
the
> direct or indirect translation of efficient routing into network
deployment
> and operational cost savings. to the best of my knowledge, MPLS
> implementations continue to use a simple shortest-hop or shortest-cost
(with
> user defined cost) based algorithms for path computation.
>
> --sudipta
>
> __________________________________
> Sudipta Sengupta
> Tellium Optical Networking Systems
> 2 Crescent Place PO box 901
> Oceanport, NJ 07757-0901.
> Email: sudipta@tellium.com
> Phone: +1-732-483-2837
>
>
> -----Original Message-----
> From: Wayne W. Szeto [mailto:wwszeto@math.uwaterloo.ca]
> Sent: Thursday, June 14, 2001 4:14 PM
> To: mpls@UU.NET
> Subject: constraint-based routing algorithms
>
>
>
> I have been looking at constraint-based routing algorithms for a while and
> the ones that I encountered are all based on minimum interference routing
> algorithm (mira), including s-mira, l-mira, lbu (link based utilization
> qos routing algorithm), and profile-based routing.  I would like to know
> the trend for routing algorithms in MPLS networks.  Are MPLS networks
> deployed today or in the near future going to use the simplest routing
> algorithm (i.e. minimum-hop)?  Is there any MPLS networks using mira?  or
> is there some other more popular algorithms that I'm missing?  Thanks for
> any help.
>