% Datatracker information for RFCs on the Legacy Stream is unfortunately often
% incorrect. Please correct the bibtex below based on the information in the
% actual RFC at https://rfc-editor.org/rfc/rfc981.txt

@misc{rfc981,
    series =    {Request for Comments},
    number =    981,
    howpublished =  {RFC 981},
    publisher = {RFC Editor},
    doi =       {10.17487/RFC0981},
    url =       {https://www.rfc-editor.org/info/rfc981},
    author =    {},
    title =     {{Experimental multiple-path routing algorithm}},
    pagetotal = 22,
    year =      1986,
    month =     mar,
    abstract =  {This document introduces wiretap algorithms, a class of experimental, multiple routing algorithms that compute quasi-optimum routes for stations sharing a packet-radio broadcast channel. The primary route (a minimum-distance path), and additional paths ordered by distance, which serve as alternate routes should the primary route fail, are computed. This prototype is presented as an example of a class of routing algorithms and data-base management techniques that may find wider application in the Internet community. Discussions and suggestions for improvements are welcomed.},
}