• DocumentCode
    2506546
  • Title

    An Optimized Peer-to-Peer Overlay Network for Service Discovery

  • Author

    Guo, H.Q. ; Zhang, D.Q. ; Ngoh, L.H. ; Wong, W.C. ; Zheng, S. ; Koh, Y.K.

  • Author_Institution
    Institute for Infocomm Research, A*STAR, Singapore
  • fYear
    2006
  • fDate
    26-29 June 2006
  • Firstpage
    82
  • Lastpage
    87
  • 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.
  • Keywords
    Computer networks; Drives; Local area networks; Mobile computing; Network servers; Peer to peer computing; Robustness; Routing; Unicast; Web server;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 2006. ISCC '06. Proceedings. 11th IEEE Symposium on
  • ISSN
    1530-1346
  • Print_ISBN
    0-7695-2588-1
  • Type

    conf

  • DOI
    10.1109/ISCC.2006.36
  • Filename
    1691011