Timeline for answer to Basic question on 'network history based routing tables' by Ron Maupin
Current License: CC BY-SA 4.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 13, 2022 at 0:02 | vote | accept | knowledge_seeker | ||
| Jun 12, 2022 at 20:30 | comment | added | Ron Maupin♦ | Routers each make their own routing decisions independently. What gets advertised or not to neighbors depends on how the router is configured and which routing protocol is used. SDN is not often used in business networks. Routing protocols have different metrics and algorithms for propagating routes. For example. RIP uses the Bellman-Ford algorithm, while OSPF uses Dijkstra's algorithm. OSPF routers have a full understanding of all routes and routers in an area, while RIP routers only know their neighbors. | |
| Jun 12, 2022 at 20:01 | comment | added | knowledge_seeker | Also, I am assuming there is a centralized SDN controller than can tell the nodes such metric values of their corresponding links. I come from wired communications background so I may be wrong to say something like a centralized controller in wireless communications where it is 'hop & then decide the next hop node type transmission'. ... | |
| Jun 12, 2022 at 20:00 | comment | added | knowledge_seeker | Can you please elaborate on what you mean by, "That depends on..." for the second question? Path quality was just an example but consider any metric that is different at time t and t+1 due to dynamic network operation. Then say a router A having B,C,D as neighbors thinks like, "based on the metric value, transmitting to B doesn't seem good now & so let me update my table so that I avoid forwarding to this node in my next trasmission" Does this happen I mean? So I asked if it really that dynamic such that the table updates happen at every t+1,t+2.. or there is a gap? | |
| Jun 12, 2022 at 18:51 | history | answered | Ron Maupin♦ | CC BY-SA 4.0 |