A taxonomy for resource discovery

Resource discovery systems become more and more important as distributed systems grow and as their pool of resources becomes more variable. As such, an increasing amount of networked systems provide a discovery service. This paper provides a taxonomy for resource discovery systems by defining their design aspects. This allows comparison of the designs of the deployed discovery services and is intended as an aid to system designers when selecting an appropriate mechanism. The surveyed systems are divided into four classes that are separately described. Finally, we identify a hiatus in the design space and point out genuinely distributed resource discovery systems that support dynamic and mobile resources and use attribute-based naming as a main direction for future research in this area.

[1]  Mitsuhisa Sato,et al.  Design and implementations of Ninf: towards a global computing infrastructure , 1999, Future Gener. Comput. Syst..

[2]  Paul V. Mockapetris,et al.  Development of the domain name system , 1988, SIGCOMM '88.

[3]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[6]  Karl Aberer,et al.  Efficient, self-contained handling of identity in peer-to-peer systems , 2004, IEEE Transactions on Knowledge and Data Engineering.

[7]  K. Ducatel,et al.  Scenarios for Ambient Intelligence in 2010 Final Report , 2001 .

[8]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[9]  Tim Howes,et al.  The LDAP Application Program Interface , 1995, RFC.

[10]  David R. Karger,et al.  Building peer-to-peer systems with chord, a distributed lookup service , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[11]  Jason Cox,et al.  Resource Cataloging and Distribution System , 1997 .

[12]  Jim Waldo,et al.  The Jini Specification , 1999 .

[13]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[14]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[15]  Franz J. Hauck,et al.  Locating objects in wide-area systems , 1998, IEEE Commun. Mag..

[16]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[17]  Rajeev R. Raje,et al.  An Architecture for the UniFrame Resource Discovery Service , 2002, SEM.

[18]  Warren Smith,et al.  A Resource Management Architecture for Metacomputing Systems , 1998, JSSPP.

[19]  Ben Y. Zhao,et al.  Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .

[20]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[21]  Shige Peng.  UDDI Technical White Paper , 2000 .

[22]  Erik Guttman,et al.  Service Location Protocol: Automatic Discovery of IP Network Services , 1999, IEEE Internet Comput..

[23]  Ian Foster,et al.  A peer-to-peer approach to resource location in grid environments , 2002 .

[24]  Ben Y. Zhao,et al.  An architecture for a secure service discovery service , 1999, MobiCom.

[25]  Henri Casanova,et al.  Netsolve: a Network-Enabled Server for Solving Computational Science Problems , 1997, Int. J. High Perform. Comput. Appl..

[26]  Chris J. Scheiman,et al.  SuperWeb: towards a global Web-based parallel computing infrastructure , 1997, Proceedings 11th International Parallel Processing Symposium.

[27]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .