The MPLS WG Archive

["Naidu, Venkata" <Venkata.Naidu@Marconi.com>]

Snigdho:

-> My question may have been a little confusing -
-> actually the algorithm should generate an explicit
-> path based on loose route constraint specification.

  One simple solution (though not efficient)

  Take pairs of adjacent EROs from source to destination.
  That is, if A,B,C,D are EROs then take (A,B) as the
  source and destination pair and recursively iterate 
  path computation engine for (B,C), (C,D) etc...

  Finally combine all EROs - what you get is (one of the)
  best matched between A(source) and D(destination).

  lemma: divide and conquer.
  note: take care of accumulative constraints.

--Venkata Naidu