Browse by author
Lookup NU author(s): Dr Georgios Pitsilis,
Dr Panos Periorellis,
Emeritus Professor Lindsay MarshallORCiD
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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. © Springer-Verlag Berlin Heidelberg 2005.
Author(s): Pitsilis G, Periorellis P, Marshall L
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Agents and Peer-to-Peer Computing
Year of Conference: 2005
Series Title: Lecture Notes in Computer Science