Advertisement-aided search in a P2P context distribution system

Sygkouna, I; Anagnostou, M; Sykas, E

dc.contributor.author	Sygkouna, I	en
dc.contributor.author	Anagnostou, M	en
dc.contributor.author	Sykas, E	en
dc.date.accessioned	2014-03-01T02:43:53Z
dc.date.available	2014-03-01T02:43:53Z
dc.date.issued	2006	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31541
dc.subject	Distributed System	en
dc.subject	Hierarchical Networks	en
dc.subject	P2P	en
dc.subject	Small World	en
dc.subject	System Design	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Hierarchical systems	en
dc.subject.other	Information dissemination	en
dc.subject.other	Directory capacity	en
dc.subject.other	P2P proactive search mechanism	en
dc.subject.other	Search efficiency	en
dc.subject.other	Small-world idea	en
dc.subject.other	Online searching	en
dc.title	Advertisement-aided search in a P2P context distribution system	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11758501_131	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11758501_131	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	We study a P2P proactive search mechanism based on the dissemination of advertisements for the new sources. The system design goal of limiting the state maintained by each peer and ensuring search efficiency is the driving reason for exploiting the hierarchical network model of the small-world idea. The results testify the theoretical bounds on search time and provide a view on the search time in relation to the directory capacity requirements of the peers. © Springer-Verlag Berlin Heidelberg 2006.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11758501_131	en
dc.identifier.isi	ISI:000238389200127	en
dc.identifier.volume	3991 LNCS - I	en
dc.identifier.spage	892	en
dc.identifier.epage	895	en