Implementation of an OSPF-style link-state routing algorithm, wherein each node in a network has knowledge of the latency and endpoints of all reachable links, and uses Dijkstra's algorithm to figure ...

Embedded Engineer Interview prep. Contribute to ksarsh/theEmbeddedInterviewPrep development by creating an account on GitHub.

Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm, which is based on a tree routing protocol ... tolerant since it works in the case ...

In this paper, a resilient routing algorithm called “Greedy Algorithm Based Directional Routing (GBDR)” is proposed. GDBR utilizes inport-aware forwarding to handle any k-link/node failure in LEO (low ...