考虑时延变化的结构化P2P覆盖网络配置方法

T. Kitani, Yoshitaka Nakamura
{"title":"考虑时延变化的结构化P2P覆盖网络配置方法","authors":"T. Kitani, Yoshitaka Nakamura","doi":"10.1109/NBiS.2009.99","DOIUrl":null,"url":null,"abstract":"P2P networks can achieve high scalability since they distribute service contents/resources to multiple nodes in the network. In a P2P network, it is necessary to search the resource location on the network when we use some contents/resources. Space filling curve is known as technique to map information of the multi-dimensional space such as the location information onto the one-dimensional space such as ID. In this paper, we propose a novel space filling curve for configuring structured P2P overlay network considering delay based on the geographic information of each node. By using the proposed space filling curve, we can convert geographic information of nodes into their ID (label) of P2P network. Through the numerical evaluation, we confirmed that the proposed curve is more suitable for handling hierarchical spread nodes than the conventional curves.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Configuration Method for Structured P2P Overlay Network Considering Delay Variations\",\"authors\":\"T. Kitani, Yoshitaka Nakamura\",\"doi\":\"10.1109/NBiS.2009.99\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"P2P networks can achieve high scalability since they distribute service contents/resources to multiple nodes in the network. In a P2P network, it is necessary to search the resource location on the network when we use some contents/resources. Space filling curve is known as technique to map information of the multi-dimensional space such as the location information onto the one-dimensional space such as ID. In this paper, we propose a novel space filling curve for configuring structured P2P overlay network considering delay based on the geographic information of each node. By using the proposed space filling curve, we can convert geographic information of nodes into their ID (label) of P2P network. Through the numerical evaluation, we confirmed that the proposed curve is more suitable for handling hierarchical spread nodes than the conventional curves.\",\"PeriodicalId\":312802,\"journal\":{\"name\":\"2009 International Conference on Network-Based Information Systems\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Network-Based Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NBiS.2009.99\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Network-Based Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NBiS.2009.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

P2P网络将服务内容/资源分配到网络中的多个节点,具有很高的可扩展性。在P2P网络中,当我们使用某些内容/资源时,需要搜索资源在网络上的位置。空间填充曲线是将位置信息等多维空间信息映射到ID等一维空间的技术。本文提出了一种基于节点地理信息的考虑时延的结构化P2P覆盖网络空间填充曲线。利用提出的空间填充曲线,可以将节点的地理信息转换为P2P网络的ID(标签)。通过数值计算,我们证实了所提出的曲线比传统的曲线更适合处理分层扩展节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Configuration Method for Structured P2P Overlay Network Considering Delay Variations
P2P networks can achieve high scalability since they distribute service contents/resources to multiple nodes in the network. In a P2P network, it is necessary to search the resource location on the network when we use some contents/resources. Space filling curve is known as technique to map information of the multi-dimensional space such as the location information onto the one-dimensional space such as ID. In this paper, we propose a novel space filling curve for configuring structured P2P overlay network considering delay based on the geographic information of each node. By using the proposed space filling curve, we can convert geographic information of nodes into their ID (label) of P2P network. Through the numerical evaluation, we confirmed that the proposed curve is more suitable for handling hierarchical spread nodes than the conventional curves.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信