This document discusses the need for performance engineered label switched paths (LSPs) in IP/MPLS networks to meet service requirements. It notes that not all services have the same routing constraints as the shortest path tree. The document proposes using segment routing to create data plane paths without mid-point state. It suggests reusing existing CSPF and PCE functions to calculate and signal paths according to constraints like affinity, diversity or latency requirements on a per-service basis.