A routing mechanism for unstructured peer-to-peer systems based on hop-limited shortest-path trees.
Phouvieng HieungmanyShigeo ShiodaPublished in: AINTEC (2009)
Keyphrases
- shortest path
- unstructured peer to peer systems
- routing algorithm
- shortest path problem
- peer to peer
- peer to peer systems
- shortest path algorithm
- steiner tree
- routing problem
- path selection
- road network
- travel time
- dijkstra algorithm
- finding the shortest path
- search mechanism
- path length
- multicast tree
- flow graph
- path queries
- network routing
- shortest distance