\leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops Pub Date : 2006-12-18 DOI:10.1109/WI-IATW.2006.1

K. Ragab, A. Yonezawa

{"title":"\\leK, D\\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network","authors":"K. Ragab, A. Yonezawa","doi":"10.1109/WI-IATW.2006.1","DOIUrl":null,"url":null,"abstract":"Rendezvous overlay network (RvON) enables the smaller/medium service providers (SP) to publish their services' advertisements. Moreover, it allows end-users to discover the services associated with these advertisements. An autonomic K-interleaving step-step construction scheme is proposed (K. Ragab and A. Yonezawa, 2006) that autonomously organizes RvON into RvON-Clusters, where (K+1) is the physical number of hops between any two rendezvous nodes stored the same advertisement in RvON. Thus, end-users accessing from different areas are able to discover services' advertisements within a constant K physical number of hops. However in dense networks, increasing the size of RvON-Clusters induces a long diameter that manifests high stress per physical links and high delay to discover service's advertisement. This paper limits the expansion of RvON-Cluster within a specific diameter D. Each RvON-Cluster is organized with at most D logical hops over K physical hops. Thus, doubtless end-users are able to efficiently discover services' advertisements within D logical hops over K physical hops with reasonable storage and bandwidth consumption","PeriodicalId":358971,"journal":{"name":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IATW.2006.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Rendezvous overlay network (RvON) enables the smaller/medium service providers (SP) to publish their services' advertisements. Moreover, it allows end-users to discover the services associated with these advertisements. An autonomic K-interleaving step-step construction scheme is proposed (K. Ragab and A. Yonezawa, 2006) that autonomously organizes RvON into RvON-Clusters, where (K+1) is the physical number of hops between any two rendezvous nodes stored the same advertisement in RvON. Thus, end-users accessing from different areas are able to discover services' advertisements within a constant K physical number of hops. However in dense networks, increasing the size of RvON-Clusters induces a long diameter that manifests high stress per physical links and high delay to discover service's advertisement. This paper limits the expansion of RvON-Cluster within a specific diameter D. Each RvON-Cluster is organized with at most D logical hops over K physical hops. Thus, doubtless end-users are able to efficiently discover services' advertisements within D logical hops over K physical hops with reasonable storage and bandwidth consumption

查看原文本刊更多论文

\leK， D \ge -对等覆盖网络的交错结构技术

交会覆盖网络(RvON)使中小型服务提供商(SP)能够发布其服务的广告。此外，它还允许最终用户发现与这些广告相关的服务。提出了一种自主K-交错分步构建方案(K. Ragab and A. Yonezawa, 2006)，该方案将RvON自主组织为RvON- cluster，其中(K+1)为RvON中存储相同广告的任意两个集合节点之间的物理跳数。因此，从不同地区访问的终端用户能够在恒定的K物理跳数内发现服务的广告。然而，在密集网络中，rvon簇的直径越大，对物理链路的压力越大，发现服务广告的延迟也越大。本文将RvON-Cluster的扩展限制在一个特定的直径D内，每个RvON-Cluster在K个物理跳上最多有D个逻辑跳。因此，毫无疑问，最终用户能够在合理的存储和带宽消耗下，在K个物理跳中有效地发现D个逻辑跳内的服务广告

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops

自引率

0.00%

发文量