<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-pce-segment-routing" target="https://datatracker.ietf.org/doc/html/draft-ietf-pce-segment-routing-07">
   <front>
      <title>PCEP Extensions for Segment Routing</title>
      <author initials="S." surname="Sivabalan" fullname="Siva Sivabalan">
         </author>
      <author initials="J." surname="Medved" fullname="Jan Medved">
         </author>
      <author initials="C." surname="Filsfils" fullname="Clarence Filsfils">
         </author>
      <author initials="E." surname="Crabbe" fullname="Edward Crabbe">
         </author>
      <author initials="V." surname="Lopez" fullname="Victor Lopez">
         </author>
      <author initials="J." surname="Tantsura" fullname="Jeff Tantsura">
         </author>
      <author initials="W." surname="Henderickx" fullname="Wim Henderickx">
         </author>
      <author initials="J." surname="Hardwick" fullname="Jonathan Hardwick">
         </author>
      <date month="March" day="21" year="2016" />
      <abstract>
	 <t>   Segment Routing (SR) enables any head-end node to select any path
   without relying on a hop-by-hop signaling technique (e.g., LDP or
   RSVP-TE).  It depends only on &quot;segments&quot; that are advertised by Link-
   State Interior Gateway Protocols (IGPs).  A Segment Routed Path can
   be derived from a variety of mechanisms, including an IGP Shortest
   Path Tree (SPT), explicit configuration, or a Path Computation
   Element (PCE).  This document specifies extensions to the Path
   Computation Element Protocol (PCEP) that allow a stateful PCE to
   compute and initiate Traffic Engineering (TE) paths, as well as a PCC
   to request a path subject to certain constraint(s) and optimization
   criteria in SR networks.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-pce-segment-routing-07" />
   
</reference>
