This paper addresses the interconnection of high-speed Local or Metropolitan Area Networks (LANs, MANs). A routing algorithm is presented that is well suited for such interconnected networks, from the points of view of speed and flexibility. Routing is independent from addressing, and does not require a particular network topology. The network supports a learning mechanism for mapping destination addresses into routes. The algorithms use no permanent global information: consequently, they are adaptive and robust and simplify network administration.
Explicit offset routing for interconnected high-speed networks
1987
Abstract
This paper addresses the interconnection of high-speed Local or Metropolitan Area Networks (LANs, MANs). A routing algorithm is presented that is well suited for such interconnected networks, from the points of view of speed and flexibility. Routing is independent from addressing, and does not require a particular network topology. The network supports a learning mechanism for mapping destination addresses into routes. The algorithms use no permanent global information: consequently, they are adaptive and robust and simplify network administration.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419687-doc_148421.pdf
solo utenti autorizzati
Descrizione: Explicit offset routing for interconnected high-speed networks
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.27 MB
Formato
Adobe PDF
|
1.27 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


