By Topic

A scalable and efficient architecture for service discovery

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)
Dowlatshahi, M. ; Fac. of Inf. Technol., Univ. of Technol., Sydney, NSW, Australia ; MacLarty, G. ; Fry, M.

With the increase in the number of mobile and distributed services throughout the Internet, locating nodes capable of initiating particular services, or those able to provide particular services or resources is becoming a critical issue. This paper presents a new architecture for service discovery and resource allocation. The architecture adopts a hierarchical tree structure for participating nodes distant from the Internet backbone, and uses a single peer-to-peer structure for service discovery at the root layer of the underlying tree structures. The key characteristics of the proposed architecture are optimal search for both distant and close services, minimal overhead traffic, scalability, robustness, and easier QoS support.

Published in:

Networks, 2003. ICON2003. The 11th IEEE International Conference on

Date of Conference:

28 Sept.-1 Oct. 2003