loading...
\leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network
Hong Kong, China December 18-December 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WI-IATW.2006.12006 IEEE/WIC/ACM International Confe ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Khaled Ragab, Akinori Yonezawa, "\leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network," Web Intelligence and Intelligent Agent Technology, International Conference on, pp. 443-446, 2006 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops, 2006.
 
 
BibTex
x
 
@article{ 10.1109/WI-IATW.2006.1,
author = {Khaled Ragab and Akinori Yonezawa},
title = {\leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network},
journal ={Web Intelligence and Intelligent Agent Technology, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2749-3},
pages = {443-446},
doi = {http://doi.ieeecomputersociety.org/10.1109/WI-IATW.2006.1},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Web Intelligence and Intelligent Agent Technology, International Conference on
TI - \leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network
SN - 0-7695-2749-3
SP443
EP446
A1 - Khaled Ragab,
A1 - Akinori Yonezawa,
PY - 2006
KW - null
VL - 0
JA - Web Intelligence and Intelligent Agent Technology, International Conference on
ER -
 
Khaled Ragab, Japan Science and Technology Agency; The University of Tokyo, Japan
Akinori Yonezawa, The University of Tokyo, Japan
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 [2] 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.
Citation:
Khaled Ragab, Akinori Yonezawa, "\leK, D\ge-Interleaving Structuring Technique for Peer-Peer Overlay Network," wi-iatw, pp.443-446, 2006 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops, 2006
Usage of this product signifies your acceptance of the Terms of Use.