Technology and engineering · 1986

RFC 981: Experimental multiple-path routing algorithm

by D.L. Mills

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.

Anyone can see what's on the shelves. Open a book with a free account, and stay in touch with its book club.

First published
1986
Status
Unknown
Pages
22
Copyright
✓ Free to read · Copied in full, as published

Where it comes from

RFC Editor · IETF Datatracker · IETF Trust Legal Provisions

Copied in full and unchanged from the RFC Editor, with the RFC's own notices. © IETF Trust and the persons identified as the document authors. The IETF Trust allows copying and distributing an RFC in full and without modification, so Micwyn shows it exactly as published and makes no study guide, audio or other version of it.

Discuss a passage

Select any passage in the reader and press Discuss to talk about it in public.

Join free to discuss a passage

Ask Micwyn about this book

Join (free) to ask about a PDF
Try asking

If you like this one