There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Link-State-Routing-Algorithm A link-state routing system is able to build a topological picture of large networks. It gathers data from all connected routers that provide an identical picture of the ...

An efficient K-shortest paths routing algorithm for computer networks is presented. The Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF, which is only ...

A Routing Protocol Simulator in Python that allows users to simulate and compare two major routing algorithms: Link-State Routing (Dijkstra’s Algorithm) for efficient shortest path computation using a ...

A Two-Layered Shared Tree Multicast (TSTM) routing algorithm is proposed to achieve efficient dynamic multicast group management, address the trade-off between bandwidth consumption and rerouting ...