Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISCC.2006.36
Title: An optimized peer-to-peer overlay network for service discovery
Authors: Guo, H.Q.
Zhang, D.Q.
Ngoh, L.H.
Wong, W.C. 
Zheng, S.
Koh, Y.K.
Issue Date: 2006
Source: Guo, H.Q.,Zhang, D.Q.,Ngoh, L.H.,Wong, W.C.,Zheng, S.,Koh, Y.K. (2006). An optimized peer-to-peer overlay network for service discovery. Proceedings - International Symposium on Computers and Communications : 82-87. ScholarBank@NUS Repository. https://doi.org/10.1109/ISCC.2006.36
Abstract: 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. © 2006 IEEE.
Source Title: Proceedings - International Symposium on Computers and Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/69360
ISBN: 0769525881
ISSN: 15301346
DOI: 10.1109/ISCC.2006.36
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Jan 9, 2018

Page view(s)

22
checked on Jan 19, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.