Augmented tree-based routing (ATR) protocol, first proposed in 2007, is a multi-path DHT-based routing protocol for scalable 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 failure/mobility and link congestion/instability.

See also

edit

References

edit
  • Caleffi, Marcello; Ferraiuolo, Giancarlo; Paura, Luigi (2007). "Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks". 2007 IEEE International 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. S2CID 11151206.
  • 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 adding missing information.

📚 Artikel Terkait di Wikipedia

Spanning tree

protocol, Augmented tree-based routing, etc.—require each router to remember a spanning tree. A special kind of spanning tree, the Xuong tree, is used

Ant colony optimization algorithms

optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing. As an example, ant colony optimization is a class of optimization

Minimum spanning tree

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all

IP multicast

scaling unicast routing. Also, there are core routers that carry routes in the hundreds of thousands because they contain the Internet routing table. Each

Kademlia

Kademlia implementation does not have a fixed-size routing table, but a dynamically sized one. Kademlia routing tables consist of a list for each bit of the

YANG

MPLS Base RFC 8819: YANG Module Tags RFC 9020: YANG Data Model for Segment Routing RFC 9061: A YANG Data Model for IPsec Flow Protection Based on Software-Defined

IEEE 802.1aq

of Ethernet networks while enabling multipath routing. SPB is designed to replace the older Spanning Tree Protocols: IEEE 802.1D STP, IEEE 802.1w RSTP

Contraction hierarchies

fastest travel routes using predicted traffic information and display alternative routes. Both can be done using CHs. The former is called routing with time-dependent