@techreport{mannie-stc-ion-msp-00,
    number =    {draft-mannie-stc-ion-msp-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-mannie-stc-ion-msp/00/},
    author =    {Eric Mannie and Marc De Preter},
    title =     {{Multicast Synchronization Protocol (MSP)}},
    pagetotal = 13,
    year =      1996,
    month =     oct,
    day =       18,
    abstract =  {This document defines a Multicast Synchronization Protocol (MSP) designed to avoid traditional problems related to the use of unicast (pt-to-pt) synchronization protocols (such as those encountered with OSPF, P-NNI, SCSP, epidemic protocols,...). These protocols imply the establishment and maintenance of a topology of servers (tree, star, line, mesh,...). It is not obvious to find neither the best topology for a given synchronization protocol nor the best algorithm which allows to create this topology. An attempt to study the influence of the spatial distribution (topology) has been made, for instance, in Epidemic algorithms by Xerox Parc, which showed interesting results. Moreover, traditional synchronization protocols notably imply a convergence time and traffic which is proportional to the size of the topology. We believe that reducing the topology to a set of members of a single multicast group could reduce both convergence time and traffic. Note that in that case, no configuration algorithm is required.},
}