The MPLS-OPS Archive

Cell Relay Retreat>MPLS-OPS Archive>month:2003-Nov> msg00101



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

RE: CR algorithm

  • From: Sebastien.Spas@alcatel.be
  • Date: Fri, 28 Nov 2003 13:45:15 +0100
  • Importance: Normal
  • Resent-Date: Fri, 28 Nov 2003 08:24:25 -0500
  • To: "Abidin Kahraman" <abidin.kahraman@sabancitelekom.com>, <bhavesh_modi@da-iict.org>, "MPLS group" <mpls-ops@mplsrc.com>
  • X-MIME-Autoconverted: from base64 to 8bit by host.secure4-hosting.net id hASCjmit019171
  • X-MIMETrack: Itemize by SMTP Server on BEMAIL06/BE/ALCATEL(Release 5.0.11 |July 24, 2002) at11/28/2003 13:45:16,Serialize by Router on BEMAIL06/BE/ALCATEL(Release 5.0.11 |July 24, 2002) at11/28/2003 13:45:18
  • X-Virus-Scanned: by amavisd-new

Hi Bhavesh,

some clues :

1. In theory you can use any constraint. There is commercial & public
algorithms available in network management, or research studies using more
constraints than bandwidth : Delay, max hop count, disjoint parallel paths,
backup disjoint, max cost (based on link metrics), available left bandwidth,
...
You can imagine lot of extra constraints, especially if you also bring
DiffServ in the picture.

For what is available today in commercial MPLS routers, most of CSPF
implementations only consider bandwidth as a constraint (I don't know any
product offering more, but hope it'll come in future releases, or is even
already there).


2. The most used algorithm is Dijkstra. You can find thousands papers on the
web, and even implementations in major programming languages, pseudo-code or
even as Excel macros. Many research & development work were done to extend
Dijkstra capabilities to improve perfs and include extra constraints.


If you wish to look into commercial products, plz contact me off-line.
Alcatel is having very advanced algorithms in that area used to deliver
traffic engineering.


kr,
seb.

-----Original Message-----
From: Abidin Kahraman [mailto:abidin.kahraman@sabancitelekom.com]
Sent: vendredi 28 novembre 2003 13:25
To: bhavesh_modi@da-iict.org; MPLS group
Subject: RE: [MPLS-OPS]: CR algorithm


Hi Bhavesh,

Check out RFC 3212 and RFC 2702, I think you can find some details related
to your questions.

Regards,

Abidin.

-----Original Message-----
From: Bhavesh Modi [mailto:bhavesh_modi@da-iict.org]
Sent: 28 Kasım 2003 Cuma 08:46
To: MPLS group
Subject: [MPLS-OPS]: CR algorithm


Hi group

I have 2 questions:

1. Which are the constraints that are specified ( other than bandwidth
) generally to determine a constrait based route?

2. Which are the algoriths generally used for determinig a constraint
based route?

Regards,

-Bhavesh Modi
MTech-ICT
DA-IICT.
(www.da-iict.org)

-------
The MPLS-OPS Mailing List
Subscribe/Unsubscribe:  http://www.mplsrc.com/mplsops.shtml
Archive: http://www.mplsrc.com/mpls-ops_archive.shtml

-------
The MPLS-OPS Mailing List
Subscribe/Unsubscribe:  http://www.mplsrc.com/mplsops.shtml
Archive: http://www.mplsrc.com/mpls-ops_archive.shtml


-------
The MPLS-OPS Mailing List
Subscribe/Unsubscribe:  http://www.mplsrc.com/mplsops.shtml
Archive: http://www.mplsrc.com/mpls-ops_archive.shtml

  • References: