Kenichi Watanabe, T. Enokido, M. Takizawa, K. H. Kim
{"title":"Acquaintance-based protocol for detecting multimedia objects in peer-to-peer overlay networks","authors":"Kenichi Watanabe, T. Enokido, M. Takizawa, K. H. Kim","doi":"10.1109/ISORC.2005.6","DOIUrl":null,"url":null,"abstract":"Multimedia objects are distributed 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 what objects each peer holds, can manipulate, and can grant access rights. We discuss a new type of flooding 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 charge-based flooding algorithm compared with a TTL-based flooding algorithm in terms of the number of messages transmitted in networks.","PeriodicalId":377002,"journal":{"name":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","volume":"429 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2005.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Multimedia objects are distributed 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 what objects each peer holds, can manipulate, and can grant access rights. We discuss a new type of flooding 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 charge-based flooding algorithm compared with a TTL-based flooding algorithm in terms of the number of messages transmitted in networks.