Data Centers have been steadily growing to commonly host tens of thousands of end points, or more, in a single network. Because of their topologies (traditional and emerging), traffic patterns, need for fast restoration, and for low human intervention, data center networks have a unique set of requirements that is resulting in the design of routing solutions specific to them. The Link-State Vector Routing (LSVR) Working Group is chartered to develop and document a hybrid routing protocol utilizing a combination of link-state and path-vector routing mechanisms. The LSVR WG will utilize existing IPv4/IPv6 transport, packet formats and error handling of BGP-4 (RFC4271) in addition to utilizing BGP-LS NLRI encoding mechanisms defined in RFC7752 to facilitate Link-State Vector (LSV) routing information distribution. An LSV is intended to be specified as a data structure comprised of a link identification, link attributes, neighbor information, cost toward neighbors, and other attributes that are defined for control plane function and policy-based routing decisions. The LSVR specification is initially focused on operation within a single datacenter (DC) as a single distribution domain. Routing protocol functionality defined by LSVR would be typically routing within a datacenter’s underlay routing plane. The work will include coexistence with basic IPv4/IPv6 unicast address families installing and advertising routes into the same RIB. In order to achieve the noted objective, the working group will focus on standardization of protocol functionality, defining Link-State Vectors (LSVs) and defining standard path-vector route selection utilizing the Dijkstra SPF based algorithm, BGP-4 protocol mechanics and BGP-LS NRLI encoding. For the purposes of the initial work within the LSVR WG, and until further specified by the WG, the following definitions apply to this charter. Link-State Vector - An LSV is intended to represent a data structure (data set) comprised of link identification, link attributes, neighbor information, cost towards neighbors, and other potential attributes that can be utilized to make routing decisions. LSVR Distribution Domain - Initially scoped as a set of participating LSVR nodes in a single administrative domain. The LSVR WG is chartered to deliver the following documents: - Specification document describing LSV with standard Dijkstra SPF route/path selection (calculation) utilizing existing BGP protocol baseline functionality and BGP-LS packet encoding formats - Specification documenting protocol extensions required to efficiently reuse BGP to distribute LSVs within an IPv4/IPv6 DC with scope to include privacy and security considerations - Applicability Statement for the use of LSVR in the Datacenter - YANG model specification for LSVR The WG will closely collaborate with the idr WG. Any modifications or extension to BGP that will not be specifically constrained to be used by LSVR must be carried out in the idr WG, but may be done in this WG after agreement with all the relevant chairs and teh responsible Area Directors. LSVR Millestones: March 2019: LSVR with standard Dijkstra path selection March 2019: LSV distribution using BGP transport March 2019: Applicability statement for LSVR in DCs July 2019: YANG specification for LSRV