Jump to content

Augmented tree-based routing

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Headbomb (talk | contribs) at 14:44, 8 August 2019 (Alter: template type. Add: year, pages, title, chapter, author pars. 1-3. Formatted dashes. | You can use this tool yourself. Report bugs here.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Augmented tree-based routing (ATR) Communications protocol protocol, first proposed in 2007, is a multi-path Distributed hash table DHT-based routing protocol for scalable Computer network networks. ATR resorts to an augmented tree-based address space structure and a hierarchical multi-path routing protocol in order to gain scalability and good resilience against node (networking) node failure/mobility and link congestion/instability.

See also

References

  • Caleffi, Marcello; Ferraiuolo, Giancarlo; Paura, Luigi (2007). "Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks". 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems. pp. 1–6. arXiv:0711.3099. doi:10.1109/MOBHOC.2007.4428727. ISBN 978-1-4244-1454-3.
  • Caleffi, Marcello; Ferraiuolo, Giancarlo; Paura, Luigi (2008). "On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks". Proceedings of WRECOM '07: Wireless Rural and Emergency Communications Conference, Roma (Italy), October 2007. arXiv:0801.4082. Bibcode:2008arXiv0801.4082C.


Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Augmented_tree-based_routing&oldid=909926869"