ccamp-6----Page:3
1 2 3 4 5
|
Quick summary/overview The ID proposes a per-domain path computation method for computing both packet and non-packet inter-domain TE LSP path Where a domain is defined as a collection of network elements within a common sphere of address management or path computational responsibility such as IGP areas and Autonomous Systems (see also draft-ietf-ccamp-inter-domain-framework-01.txt) Does not require (summarized) TE-related flooding across domains, An optimization have been proposed which consists of flooding the inter-ASBR TE-related info (no IGP routing adjacency required): Reduce the call set up failure probability (? potentially reduce the set up time) Required number of ERO expansion, More optimal path selection |