Index-server optimization for P2P file sharing in mobile ad hoc networks

C. Ohta, Zihui Ge, Yang Guo, J. Kurose
{"title":"Index-server optimization for P2P file sharing in mobile ad hoc networks","authors":"C. Ohta, Zihui Ge, Yang Guo, J. Kurose","doi":"10.1109/GLOCOM.2004.1378102","DOIUrl":null,"url":null,"abstract":"In this paper, we compare two basic approaches towards providing peer-to-peer file-sharing (or more generally, information search) in mobile ad-hoc networks (MANET). The flooding approach broadcasts a query (e.g., to locate a node holding a given file) to all network nodes. The index-server approach adds additional servers (known as index servers) that cache directory information about which nodes have which files. With index servers, a node wishing to locate a file first queries its local index server, which then queries other index servers, as needed. The use of index servers presents the possibility of locating a file index quickly in an index server cache, but requires additional overhead to maintain cache consistency. We compare the performance of the flooding approach to two index-server caching approaches: consistent caching and local caching. We quantify the reduction in search overhead using the index-server scheme rather than flooding in MANET, and study how the optimal number of index servers varies according to network size, query rate, and index generation rate. We compare the flooding scheme and the consistent caching and local caching schemes, for two types of queries: history queries and latest queries. Numerical results show how one can choose between the alternatives of consistent caching and local caching depending on network size, index generation rate and query rate.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"22 11","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2004.1378102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we compare two basic approaches towards providing peer-to-peer file-sharing (or more generally, information search) in mobile ad-hoc networks (MANET). The flooding approach broadcasts a query (e.g., to locate a node holding a given file) to all network nodes. The index-server approach adds additional servers (known as index servers) that cache directory information about which nodes have which files. With index servers, a node wishing to locate a file first queries its local index server, which then queries other index servers, as needed. The use of index servers presents the possibility of locating a file index quickly in an index server cache, but requires additional overhead to maintain cache consistency. We compare the performance of the flooding approach to two index-server caching approaches: consistent caching and local caching. We quantify the reduction in search overhead using the index-server scheme rather than flooding in MANET, and study how the optimal number of index servers varies according to network size, query rate, and index generation rate. We compare the flooding scheme and the consistent caching and local caching schemes, for two types of queries: history queries and latest queries. Numerical results show how one can choose between the alternatives of consistent caching and local caching depending on network size, index generation rate and query rate.
移动自组织网络中P2P文件共享的索引服务器优化
在本文中,我们比较了在移动自组织网络(MANET)中提供点对点文件共享(或更一般地说,信息搜索)的两种基本方法。泛洪方法向所有网络节点广播查询(例如,定位持有给定文件的节点)。索引服务器方法添加了额外的服务器(称为索引服务器),这些服务器缓存关于哪些节点拥有哪些文件的目录信息。对于索引服务器,希望定位文件的节点首先查询其本地索引服务器,然后根据需要查询其他索引服务器。索引服务器的使用提供了在索引服务器缓存中快速定位文件索引的可能性,但是需要额外的开销来维护缓存一致性。我们比较了泛洪方法与两种索引服务器缓存方法的性能:一致缓存和本地缓存。我们量化了使用索引服务器方案而不是在MANET中使用泛洪来减少搜索开销,并研究了索引服务器的最佳数量如何根据网络大小、查询率和索引生成率而变化。我们比较了两种查询类型:历史查询和最新查询的泛洪模式和一致缓存以及本地缓存模式。数值结果显示了如何根据网络大小、索引生成率和查询率在一致性缓存和本地缓存之间进行选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信