These guys did some research into that. Their paper is about the design of networks, but I think the metric also applies to pathfinding with existing networks as well. Designing Connection Oriented Networks for Multi-Domain Path Resilience (http://dx.doi.org/10.1007/s10922-009-9155-z) There probably is a lot more research into that. Not to sound like a broken record, but this research is just being published again shows that it is an open problem that is still being worked on. Jeroen. On 09/02/2010 16:20, John MacAuley wrote:
An additional interesting problem to investigate with the meshed mechanism is the ability to model diversity in the links. Whenever DRAC is asked to perform diverse routing for protected circuits it does both node diverse and SRLG diverse routing. The mesh model would hide this, but you might be able to come up with a ingenious way to handle it.
John.
On 10-02-09 7:11 PM, Jeroen van der Ham wrote:
On 09/02/2010 16:02, Evangelos Chaniotakis wrote:
Hey Jeroen,
Your algorithm does not calculate available capacity, then; it's just reachability. That's not too expensive, but it's also not as useful. :)
Again, if you have to do this in the complete graph, you're not going to win much by breaking this up in smaller problems.
Jeroen.