Optimal decomposition of P2P networks based on file exchange patterns for multimedia content search & replication

Doulamis, ND; Karamolegkos, PN; Doulamis, AD; Nikolakopoulos, IG

dc.contributor.author	Doulamis, ND	en
dc.contributor.author	Karamolegkos, PN	en
dc.contributor.author	Doulamis, AD	en
dc.contributor.author	Nikolakopoulos, IG	en
dc.date.accessioned	2014-03-01T02:44:53Z
dc.date.available	2014-03-01T02:44:53Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31996
dc.subject	Clustering	en
dc.subject	Content replication	en
dc.subject	Content search	en
dc.subject	Multimedia	en
dc.subject	Peer-to-peer	en
dc.subject.other	Content replication	en
dc.subject.other	Content search	en
dc.subject.other	File exchange patterns	en
dc.subject.other	Multimedia content search	en
dc.subject.other	Algorithms	en
dc.subject.other	Electronic data interchange	en
dc.subject.other	Multimedia services	en
dc.subject.other	Probability	en
dc.subject.other	Quality of service	en
dc.subject.other	Semantics	en
dc.subject.other	Distributed computer systems	en
dc.title	Optimal decomposition of P2P networks based on file exchange patterns for multimedia content search & replication	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1290082.1290102	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1290082.1290102	en
heal.publicationDate	2007	en
heal.abstract	In this paper, we address the issues of multimedia content search and replication over peer-to peer networks. We use the concept of semantic proximity that exploits the file exchange patterns exhibited among peer users so as to decompose the network into semantic clusters. Peer nodes are then decomposed into semantic clusters so that a) the probability that a node locates content within its own cluster is maximized, while simultaneously b) the respective probability of finding this content outside this cluster is minimized The semantic organization is then used for applying efficient cluster-based content replication strategies. Two different schemes are examined; the unrestricted and the restricted approach. The first one distributes multimedia content within peers of a cluster so that the average hop distance among nodes and objects weighted by the object popularity is minimized. This approach takes into account no Quality of Service (QoS) guarantees. Instead, the second scheme iteratively partitions the nodes of a cluster during each object replication based on a QoS violation criterion. The proposed algorithms are experimentally evaluated and compared with other approaches to demonstrate the efficacy of the proposed schemes. Copyright 2007 ACM.	en
heal.journalName	Proceedings of the ACM International Multimedia Conference and Exhibition	en
dc.identifier.doi	10.1145/1290082.1290102	en
dc.identifier.spage	125	en
dc.identifier.epage	134	en