𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A loop-free shortest-path routing algorithm for dynamic networks

✍ Scribed by DʼAngelo, Gianlorenzo; DʼEmidio, Mattia; Frigioni, Daniele


Book ID
122114052
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
598 KB
Volume
516
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A path-finding algorithm for loop-free r
✍ Garcia-Luna-Aceves, J.J.; Shree Murthy 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 404 KB

A loop-free path-finding algorithm (LPA) is presented; this is the first routing algorithm that eli minates the formation of temporary routing loops without the need for internodal synchronization spanning multiple hops or the specification of complete or variable-size path information. Like other p