A distributed directory scheme in computer networks

K.J. Lee, B. Kadaba
{"title":"A distributed directory scheme in computer networks","authors":"K.J. Lee, B. Kadaba","doi":"10.1109/CNS.1988.5013","DOIUrl":null,"url":null,"abstract":"In this scheme, each node in the network maintains a local DDB (directory database), and each resource i is registered in the DDBs of all nodes with r/sub i/ hops away from the owning node of resource i, where r/sub i/ denotes the radius of the resource. In general, each resource has a different radius. Whenever a user at a node makes a reference to a resource, the node first searches its local DDB to find an entry for the resource. If this attempt is successful, it is done. Otherwise, the node trigger a query protocol to find the resource. Registered entries are updated for the integrity of stored information every time there are changes in their contents. This scheme uses simple broadcast protocols among the nodes in the network in querying other nodes to find a nonlocal resource and in updating DDBs of other nodes. The authors quantify the response time performance and the overhead associated with the directory scheme as a function of the radius of each resource, and propose an integer programming formulation to determine the optimal radius for each resource which is solved in O(R) steps, where R is the maximum radius of the resource.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.5013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this scheme, each node in the network maintains a local DDB (directory database), and each resource i is registered in the DDBs of all nodes with r/sub i/ hops away from the owning node of resource i, where r/sub i/ denotes the radius of the resource. In general, each resource has a different radius. Whenever a user at a node makes a reference to a resource, the node first searches its local DDB to find an entry for the resource. If this attempt is successful, it is done. Otherwise, the node trigger a query protocol to find the resource. Registered entries are updated for the integrity of stored information every time there are changes in their contents. This scheme uses simple broadcast protocols among the nodes in the network in querying other nodes to find a nonlocal resource and in updating DDBs of other nodes. The authors quantify the response time performance and the overhead associated with the directory scheme as a function of the radius of each resource, and propose an integer programming formulation to determine the optimal radius for each resource which is solved in O(R) steps, where R is the maximum radius of the resource.<>
计算机网络中的一种分布式目录方案
在该方案中,网络中的每个节点维护一个本地DDB(目录数据库),每个资源i被注册到距离资源i所属节点r/sub i/的所有节点的DDB中,其中r/sub i/表示资源的半径。一般来说,每个资源都有不同的半径。每当节点上的用户引用资源时,该节点首先搜索其本地DDB以查找该资源的条目。如果这个尝试成功了,就完成了。否则,节点将触发查询协议来查找资源。每次更改已注册项的内容时,都会更新已存储信息的完整性。该方案在网络节点间使用简单的广播协议查询其他节点查找非本地资源和更新其他节点的ddb。作者将响应时间性能和与目录方案相关的开销量化为每个资源半径的函数,并提出了一个整数规划公式来确定每个资源的最优半径,该公式在O(R)步中求解,其中R为资源的最大半径
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信