An efficient shortest path algorithm for content-based routing on 2-D mesh accelerator networks.
Jiayu LiuHuaxi GuWenting WeiZiqi ChenYawen ChenPublished in: Future Gener. Comput. Syst. (2021)
Keyphrases
- d mesh
- shortest path algorithm
- shortest path
- network topologies
- routing algorithm
- d objects
- three dimensional
- shape descriptors
- image retrieval
- minimum cost flow
- texture mapping
- skeleton extraction
- social networks
- network topology
- wireless ad hoc networks
- dynamic routing
- network structure
- routing problem
- triangular mesh
- network nodes
- network resources
- geometric properties
- parallel implementation
- switched networks
- ad hoc networks