Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Improving Data Access in P2P Systems
IEEE Internet Computing
When FEC Speed up Data Access in P2P Networks
IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient, Proximity-Aware Load Balancing for Structured P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Expressive and Efficient Peer-to-Peer Queries
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Distributed self-stabilizing placement of replicated resources in emerging networks
IEEE/ACM Transactions on Networking (TON)
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Resource management and multimedia support in peer-to-peer systems
Resource management and multimedia support in peer-to-peer systems
Exploiting semantic clustering in the eDonkey P2P network
Proceedings of the 11th workshop on ACM SIGOPS European workshop
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
SIL: a model for analyzing scalable peer-to-peer search networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive Algorithms for Interactive Multimedia
IEEE MultiMedia
Peer-to-peer based multimedia distribution service
IEEE Transactions on Multimedia
Low bit-rate coding of image sequences using adaptive regions of interest
IEEE Transactions on Circuits and Systems for Video Technology
Efficient summarization of stereoscopic video sequences
IEEE Transactions on Circuits and Systems for Video Technology
Optimal content-based video decomposition for interactive video navigation
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
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.