{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:54:05Z","timestamp":1672253645685},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2005,9]]},"abstract":"<jats:p> Various types of applications take usage of multimedia objects like music and movies. Multimedia objects are distributed in peer-to-peer (P2P) overlay networks since the objects are downloaded and personalized in computers, mainly personal computers interconnected with the Internet. An application would like to take some service of a target object. A target peer is a peer which can manipulate a target object. First, the application has to find target peers which can support enough quality of service (QoS) of target multimedia objects. Due to the scalability and variety of peers in P2P overlay networks, it is difficult, possibly impossible to maintain a centralized directory showing in which peer each object is distributed. In this paper, we newly take an acquaintance approach where each peer maintains its acquaintance peers. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate in P2P overlay networks. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. In addition, we discuss a new type of flooding algorithm named charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in P2P overlay networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding (CBF) algorithm compared with a traditional TTL-based flooding algorithm in terms of the number of messages transmitted in networks. <\/jats:p>","DOI":"10.1142\/s0219265905001459","type":"journal-article","created":{"date-parts":[[2005,9,7]],"date-time":"2005-09-07T07:50:38Z","timestamp":1126079438000},"page":"323-344","source":"Crossref","is-referenced-by-count":15,"title":["CBF: LOOK-UP PROTOCOL FOR DISTRIBUTED MULTIMEDIA OBJECTS IN PEER-TO-PEER OVERLAY NETWORKS"],"prefix":"10.1142","volume":"06","author":[{"given":"KENICHI","family":"WATANABE","sequence":"first","affiliation":[{"name":"Applied Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama 350-0394, Japan"},{"name":"Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama 350-0394, Japan"}]},{"given":"NAOHIRO","family":"HAYASHIBARA","sequence":"additional","affiliation":[{"name":"Applied Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama 350-0394, Japan"},{"name":"Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama 350-0394, Japan"}]},{"given":"MAKOTO","family":"TAKIZAWA","sequence":"additional","affiliation":[{"name":"Applied Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama 350-0394, Japan"},{"name":"Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama 350-0394, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00192-X"},{"key":"rf9","volume-title":"The Essential CORBA","author":"Niwbray J.","year":"1995"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265905001459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:34:27Z","timestamp":1565134467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265905001459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":3,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,9]]}},"alternative-id":["10.1142\/S0219265905001459"],"URL":"https:\/\/doi.org\/10.1142\/s0219265905001459","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}