PPT Slide

Self Organising Routing

• Application layer routing (SOAR)

• Nodes exchange graphs, infer costs for edges, define locality based on cost, prune graph

• At least one graph (a.k.a. route table) per metric

• If neighbour is in a different region define self as gateway

• Based on Nimrod (UCL)

• Needs addition of anycast and multicast (Lanc)

• Participants are BT, UCL, UTS, Lanc

Previous slide

Next slide

Back to first slide

View graphic version