Is there an analogue of the OSPF DR/BDR mechanism in EIGRP?

Question

Computer networks

Hello!
Tell!
OSPF has a DR/BDR mechanism for multi-access cases
. Is there something similar in EIGRP? Roughly speaking, the scheme looks like a couple of dozen routers plugged into one switch and located in the same vlan. How do they exchange routing information? Everyone sends to everyone? And then all these again to all? Or is there a mechanism that protects the network from this flood and you can leave everything as it is?
Thanks for the answer

Answer 1

OSPF is a link state protocol and every router in an area knows LSDB. And EIGRP is a Distance Vector protocol. And the router does not know which router is behind which network. He knows that one of the neighbors has the best route to this network.

Answer 2

As far as I remember, there is a Stub router mechanism, it seems to me that this is what we need.

Answer 3

For EIGRP, there is no need for DR/BDR, since each router knows the entire topology and all possible routes to the destination node, while choosing the best route (s) depending on distance, link load, delay, etc. For "dead end" routers, you can specify the STUB network in announcements, with all the consequences.
This allows you to organize traffic balancing between nodes by specifying the desired variacnce. For example, if there are 2 routes to the destination point, then when variance 2 is specified, 2 "best" routes will enter the routing table, between which traffic will be distributed approximately 50/50.