loading...
An Optimized Peer-to-Peer Overlay Network for Service Discovery
Cagliari, Sardinia, Italy June 26-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.3611th IEEE Symposium on Computers and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
H. Q. Guo, Institute for Infocomm Research, A*STAR, Singapore
D. Q. Zhang, Institute for Infocomm Research, A*STAR, Singapore
L. H. Ngoh, Institute for Infocomm Research, A*STAR, Singapore
W. C. Wong, Institute for Infocomm Research, A*STAR, Singapore
S. Zheng, Institute for Infocomm Research, A*STAR, Singapore
Y. K. Koh, Institute for Infocomm Research, A*STAR, Singapore
In this paper, we propose DINPeer, an optimized peer-to-peer (P2P) overlay network for service discovery by overcoming limitations in current multicast discovery approaches and P2P overlay systems. DINPeer exploits a spiral-ring method to discover an inner ring with most powerful nodes (DIN Nodes) to form a logical DINloop. With the facilitation of the DINloop, multiple DIN Nodes easily form Steiner trees using Steiner tree-based heuristic routing algorithm. DINPeer further integrates the DINloop and Steiner trees with the P2P overlay network. The key features of DINPeer include that multiple DIN Nodes function as the Rendezvous Points (RPs) for theirs associated logical spaces respectively, and Steiner trees facilitate the communication among multiple DIN Nodes. Multiple powerful DIN Nodes release the burden on the centralized server and the self-recovered DINloop avoids the single point of failure. Simulations show that DINPeer is able to reduce multicast delay for the fast service discovery.
Citation:
H. Q. Guo, D. Q. Zhang, L. H. Ngoh, W. C. Wong, S. Zheng, Y. K. Koh, "An Optimized Peer-to-Peer Overlay Network for Service Discovery," iscc, pp.82-87, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.