Searching for information in A P2P 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-01T01:27:13Z
dc.date.available	2014-03-01T01:27:13Z
dc.date.issued	2007	en
dc.identifier.issn	1206212X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/18344
dc.subject	Advertisements	en
dc.subject	P2P system	en
dc.subject	Search	en
dc.subject	Small world	en
dc.subject.other	Computer simulation	en
dc.subject.other	Data communication systems	en
dc.subject.other	Information analysis	en
dc.subject.other	Network protocols	en
dc.subject.other	Online searching	en
dc.subject.other	P2P system	en
dc.subject.other	Search time	en
dc.subject.other	Small world	en
dc.subject.other	Theoretical bounds	en
dc.subject.other	Control systems	en
dc.title	Searching for information in A P2P system	en
heal.type	journalArticle	en
heal.identifier.primary	10.2316/Journal.202.2007.4.202-2142	en
heal.identifier.secondary	http://dx.doi.org/10.2316/Journal.202.2007.4.202-2142	en
heal.publicationDate	2007	en
heal.abstract	In relation to decentralized search on top of P2P communication paradigm, we study a proactive mechanism that is based on the dissemination of advertisements for new sources that join a system. The system design goal of limiting the state maintained by each peer and ensuring search efficiency is the driving reason for exploiting the small-world idea, and in particular the hierarchical network model, which provides theoretical bounds on search time. Starting from the study of this theoretical model, we try to reflect it into protocol design. Simulation results testify to the theoretical bounds on search time and provide a quantification view on the search time in relation to the directory capacity requirements of the peers.	en
heal.journalName	International Journal of Computers and Applications	en
dc.identifier.doi	10.2316/Journal.202.2007.4.202-2142	en
dc.identifier.volume	29	en
dc.identifier.issue	4	en
dc.identifier.spage	394	en
dc.identifier.epage	400	en