By Topic

Semantic-laden peer-to-peer service directory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hu, T.H. ; Univ. of New South Wales, Sydney, NSW, Australia ; Ardon, S. ; Sereviratne, A.

The most intuitive way to build a service directory application that allows for service entities to register or search for services on top of a structured peer-to-peer network is to build reverse indices at appropriate nodes on the network. However, this implies trust on the reliability and integrity of other nodes on the network, which may be too risky an assumption for businesses. This paper proposes a service directory that groups service entities of the same category together; this is achieved by dedicating part of the node identifiers to correspond to their service category semantic. Using chord as the peer-to-peer substrate, this scheme logically divides the chord circle into equidistant arcs; each arc is called an island. This scheme results in the formation of islands of varying population, and thus changing the uniformly spread topology of the original chord. Simulations are used to investigate the path length and message load of the changed topology. An additional routing scheme is also proposed and simulated to exploit the new topology to gain better path length.

Published in:

Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on

Date of Conference:

25-27 Aug. 2004