[{"draft":"","doc_id":"RFC0981","title":" Experimental multiple-path routing algorithm ","authors":["D.L. Mills"],"format":["ASCII","HTML"],"page_count":"22","pub_status":"UNKNOWN","status":"UNKNOWN","source":"Legacy","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.  ","pub_date":"March 1986","keywords":["  "],"obsoletes":[""],"obsoleted_by":[""],"updates":[""],"updated_by":[""],"see_also":[""],"doi":"10.17487\/RFC0981","errata_url":null}]