A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

Researchers have combined the Dijkstra and Bellman-Ford algorithms to develop an even faster way to find the shortest paths ...
IEEE

A GEO-Management Based Degraded Satellite Avoidance Routing Algorithm for GEO-LEO Satellite Network

Routing for two-layer satellite network of geostationary (GEO) and low earth orbit (LEO) satellites has been a hot issue for long. Tasks of GEO and LEO satellites in routing decide algorithm ...