Design and Implementation of a Distributed Crawler and Filtering Processor
NGITS '02 Proceedings of the 5th International Workshop on Next Generation Information Technologies and Systems
Why Peer-to-Peer (P2P) Does Scale: An Analysis of P2P Traffic Patterns
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Statistical mechanics of complex networks
Statistical mechanics of complex networks
Dealing with Complex Networks of Process Interactions: A Security Measure
ICECCS '04 Proceedings of the Ninth IEEE International Conference on Engineering Complex Computer Systems Navigating Complexity in the e-Engineering Age
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
| Hi-index | 0.01 |
Unstructured P2P networks, despite having good characteristics such as the nonexistence of a single point of failure, the high levels of anonymity in the search operations and the exemplary dependability, have been found to be much less scalable than first expected. The flooding protocol, which is used for the discovery of peers and for the main operation of searching, seems to be responsible for this weakness. The adoption of some major improvements, such as the distinction between Leaf-nodes and Ultra-Peers, has partially overcome the scalability problems, but there is still a need for further optimization. Our proposed idea, aims to improve the effectiveness of the hierarchical scheme by applying some new criteria in the selection of potentially promotable nodes.