{"title":"具有消息转发的信任信息网络匹配概率分析","authors":"L. Moser, P. Melliar-Smith","doi":"10.1109/ICOIN.2014.6799493","DOIUrl":null,"url":null,"abstract":"The iTrust system is a completely distributed and decentralized information publication, search and retrieval system, that is designed to defend against censorship of information in the Internet. In this paper, we investigate the iTrust system with message forwarding, which spreads the responsibility of message distribution more widely across the nodes in the network. We present an analysis of the match probabilities of the iTrust system with message forwarding, in terms of the forwarding fanout, the number of levels of forwarding, and the forwarding probability. We show that, with a forwarding probability of 1.0, relatively small values of the forwarding fanout and the number of levels of forwarding suffice to achieve a high match probability and a reasonable message cost.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Analysis of the match probabilities for the iTrust information network with message forwarding\",\"authors\":\"L. Moser, P. Melliar-Smith\",\"doi\":\"10.1109/ICOIN.2014.6799493\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The iTrust system is a completely distributed and decentralized information publication, search and retrieval system, that is designed to defend against censorship of information in the Internet. In this paper, we investigate the iTrust system with message forwarding, which spreads the responsibility of message distribution more widely across the nodes in the network. We present an analysis of the match probabilities of the iTrust system with message forwarding, in terms of the forwarding fanout, the number of levels of forwarding, and the forwarding probability. We show that, with a forwarding probability of 1.0, relatively small values of the forwarding fanout and the number of levels of forwarding suffice to achieve a high match probability and a reasonable message cost.\",\"PeriodicalId\":388486,\"journal\":{\"name\":\"The International Conference on Information Networking 2014 (ICOIN2014)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The International Conference on Information Networking 2014 (ICOIN2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2014.6799493\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The International Conference on Information Networking 2014 (ICOIN2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2014.6799493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of the match probabilities for the iTrust information network with message forwarding
The iTrust system is a completely distributed and decentralized information publication, search and retrieval system, that is designed to defend against censorship of information in the Internet. In this paper, we investigate the iTrust system with message forwarding, which spreads the responsibility of message distribution more widely across the nodes in the network. We present an analysis of the match probabilities of the iTrust system with message forwarding, in terms of the forwarding fanout, the number of levels of forwarding, and the forwarding probability. We show that, with a forwarding probability of 1.0, relatively small values of the forwarding fanout and the number of levels of forwarding suffice to achieve a high match probability and a reasonable message cost.