T. Ohta, Yasuo Masuda, Kouichi Mitsukawa, Y. Kakuda, Atsushi Ito
{"title":"对等网络的动态索引分配方案","authors":"T. Ohta, Yasuo Masuda, Kouichi Mitsukawa, Y. Kakuda, Atsushi Ito","doi":"10.1109/ISADS.2005.1452164","DOIUrl":null,"url":null,"abstract":"File-sharing Peer-to-Peer systems are effective for autonomous information retrieval over the networks. However, the previous information retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes a dynamic information retrieval scheme, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A dynamic index allocation scheme for peer-to-peer networks\",\"authors\":\"T. Ohta, Yasuo Masuda, Kouichi Mitsukawa, Y. Kakuda, Atsushi Ito\",\"doi\":\"10.1109/ISADS.2005.1452164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"File-sharing Peer-to-Peer systems are effective for autonomous information retrieval over the networks. However, the previous information retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes a dynamic information retrieval scheme, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.\",\"PeriodicalId\":120577,\"journal\":{\"name\":\"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISADS.2005.1452164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2005.1452164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A dynamic index allocation scheme for peer-to-peer networks
File-sharing Peer-to-Peer systems are effective for autonomous information retrieval over the networks. However, the previous information retrieval schemes such as Gnutella and Local Indices have bad performance and large overhead. In order to solve these drawbacks, this paper proposes a dynamic information retrieval scheme, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.