Optimal Resource Discovery Paths of Gnutella2

This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the pe...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Vapa, M., Auvinen, A., Ivanchenko, Y., Kotilainen, N., Vuori, J.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Cost function Gnutella2 Information technology Intrusion detection k-Steiner minimum tree Network topology optimal paths P2P Peer to peer computing peer-to-peer Protocols Relays resource discovery Steiner trees Tree graphs Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!