Acquaintance-based protocol for manipulating multimedia objects in peer-to-peer overlay networks

Various types of multimedia objects are manipulated on peer computers (peers) in peer-to-peer (P2P) overlay networks. An application has to find target peers which can support enough quality of service (QoS) of multimedia objects. We discuss types of acquaintance relations of peers with respect to types of objects and access rights. We discuss a charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in networks where target peers are expected to exist are more deeply searched. We evaluate the CBF algorithm compared with TTL-based flooding algorithms in terms of the number of messages.

[1]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[2]  Li Xiao,et al.  A distributed approach to solving overlay mismatching problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[3]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[4]  Richard P. Martin,et al.  PlanetP: using gossiping and random replication to support reliable peer-to-peer content search and retrieval , 2002 .

[5]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[6]  A. Min Tjoa,et al.  Proceedings of the 12th International Workshop on Database and Expert Systems Applications , 2001 .