@techreport{brigm-deterministicrp-00,
    number =    {draft-brigm-deterministicrp-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-brigm-deterministicrp/00/},
    author =    {Michael Brig and Jeff Chaney and Charles Schlise and Thomas Tharp},
    title =     {{Deterministic RP (D-RP) Specification}},
    pagetotal = 10,
    year =      2011,
    month =     may,
    day =       20,
    abstract =  {This document specifies the Deterministic Rendezvous Point (D-RP) mechanism for Protocol Independent Multicast (PIM) Sparse Mode (SM) networks. It intends to provide a simple and robust RP service. The mechanism is deterministic since it elects the highest priority candidate to be the D-RP from those available for each IP address family. If a D-RP fails, the election process begins again using the remaining C-RPs for the IP address family. If no candidates are availabe, the network will transition to PIM Dense Mode (DM) routing for that IP address family. In the future if C-RPs emerge for the address family, the network will elect a new D-RP and return to operations with PIM SM routing.},
}