On the complexity of greedy routing in ring-based peer-to-peer networks.
George GiakkoupisVassos HadzilacosPublished in: PODC (2007)
Keyphrases
- peer to peer networks
- query routing
- peer to peer
- distributed environment
- greedy algorithm
- hierarchical peer to peer networks
- peer to peer systems
- resource selection
- dynamic programming
- worst case
- computational complexity
- partial match queries
- network topology
- routing problem
- active learning
- routing protocol
- information retrieval
- routing algorithm
- search algorithm
- file sharing
- cooperative
- keywords