%% You should probably cite rfc7311 instead of this I-D. @techreport{ietf-idr-aigp-18, number = {draft-ietf-idr-aigp-18}, type = {Internet-Draft}, institution = {Internet Engineering Task Force}, publisher = {Internet Engineering Task Force}, note = {Work in Progress}, url = {https://datatracker.ietf.org/doc/draft-ietf-idr-aigp/18/}, author = {Prodosh Mohapatra and Rex Fernando and Eric C. Rosen and Jim Uttaro}, title = {{The Accumulated IGP Metric Attribute for BGP}}, pagetotal = 15, year = 2014, month = apr, day = 28, abstract = {Routing protocols that have been designed to run within a single administrative domain (IGPs) generally do so by assigning a metric to each link and then choosing, as the installed path between two nodes, the path for which the total distance (sum of the metric of each link along the path) is minimized. BGP, designed to provide routing over a large number of independent administrative domains (autonomous systems), does not make its path-selection decisions through the use of a metric. It is generally recognized that any attempt to do so would incur significant scalability problems as well as inter-administration coordination problems. However, there are deployments in which a single administration runs several contiguous BGP networks. In such cases, it can be desirable, within that single administrative domain, for BGP to select paths based on a metric, just as an IGP would do. The purpose of this document is to provide a specification for doing so.}, }