1 / 5

Synchronized Path Computation for Diverse Paths with SVEC List

This document presents the usage of SVEC list for synchronized dependent path computations in the context of diverse paths. It addresses the challenge of concurrently computing multiple diverse paths to optimize network resources efficiently and meet global objectives. The draft outlines the solution for synchronized requests for diverse paths using SVEC, without requiring updates to PCEP messages/objects. It supports concurrent path computation without compromising network resource utilization or disjoint constraints. The proposed approach enables synchronized requests for diverse paths, improving overall network optimization.

roth-golden
Télécharger la présentation

Synchronized Path Computation for Diverse Paths with SVEC List

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The use of SVEC list for Synchronized dependent path computations draft-nishioka-pce-svec-list-01.txt Itaru Nishioka, i-nishioka@cb.jp.nec.com, NEC Daniel King, daniel.king@aria-networks.com Aria Networks 70th IETF

  2. Motivation • [GCO-01] specifies concurrent path computation for Network resource optimization. • What is a GCO? An application of path computation in which we compute a large number of TE-paths concurrently to meet a global objective by looking at the entire set of network resources and topology. • Sequential path computation may result in sub-optimal use of network resources, or a failure to meet disjoint constraints, in some applications. Sequential path computation Concurrent path computation A A Cost=5 Cost=5 1st diverse path Cost=5 a Cost=5 a Cost=5 Cost=5 Cost=10 Cost=10 z z Cost=5 Cost=5 Cost=5 Cost=5 Cost=5 Cost=5 Cost=5 Cost=5 Z Z Cost=10 2nd diverse path Cost=10 70th IETF

  3. Problem Statement • [PCEP-08] already supports synchronized requests for concurrent path computations, but this is only for • Synchronized path requests without NLS flags, or • Single diverse path request with NLS flags • How do we synchronize multiple diverse path requests? 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Reserved | Flags |S|N|L| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Request-ID-number #1 | | // // | Request-ID-number #M | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 70th IETF

  4. Solution for synchronized requests for diverse paths • Use of other SVEC to indicate association among SVECs. • This solution does not require any updates for PCEP messages/Objects. • Example below: Associating SVECs Associated SVECs by 1st SVEC 70th IETF

  5. Summary & Next Step Summary • This I-D supports synchronized requests for concurrent path computation for diverse paths, without any update of the PCEP Messages/Objects. Next Steps • Solicit WG feedback. Any questions? 70th IETF

More Related