A graph theoretical lower bound on maintenance overhead of structured P2P overlays.
Peter KerschRóbert SzabóPublished in: Prax. Inf.verarb. Kommun. (2008)
Keyphrases
- graph theoretical
- lower bound
- peer to peer
- graph theory
- upper bound
- maintenance cost
- branch and bound algorithm
- branch and bound
- overlay network
- objective function
- lower and upper bounds
- software maintenance
- np hard
- optimal solution
- worst case
- sufficiently accurate
- lower bounding
- neural network
- communication overhead
- competitive ratio
- low overhead
- scalable distributed
- learning algorithm
- network layer
- vc dimension