Browse by author
Lookup NU author(s): Dr Georgios Pitsilis,
Dr Panos Periorellis,
Professor Lindsay Marshall
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 Super-nodes, 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.
Author(s): Pitsilis G, Periorellis P, Marshall L
Editor(s): Moro, G., Bergamaschi, S., Aberer, K.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Third International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2004) to be held at AAMAS 2004 Third International Joint Conference on Autonomous Agents and Multi Agent Systems
Year of Conference: 2005
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Publisher: Springer Verlag
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science