Network-Sensitive Service Discovery

We consider the problem of network-sensitive service selection (NSSS): finding services that match a particular set of functional and network properties. Current solutions handle this problem using a two-step process. First, a user obtains a list of candidates through service discovery. Then, the user applies a network-sensitive server selection technique to find the best service. Such approaches are complex and expensive since each user has to solve the NSSS problem independently. In this paper, we present a simple alternative: network-sensitive service discovery (NSSD). By integrating network-sensitivity into the service discovery process, NSSD allows users who are looking for services to specify both the desired functional and network properties at the same time. Users benefit since they only have to solve a restricted version of the server selection problem. Moreover, NSSD can solve the NSSS problem more efficiently by amortizing the overhead over many users. We present the design of NSSD, a prototype implementation, and experimental results that illustrate how NSSD can be used for different applications.

[1]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[2]  Peter Steenkiste,et al.  Distributed load-sensitive routing for computationally-constrained flows , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[3]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Ben Y. Zhao,et al.  The Ninja architecture for robust Internet-scale systems and services , 2001, Comput. Networks.

[5]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.

[6]  Balachander Krishnamurthy,et al.  On network-aware clustering of Web clients , 2000, SIGCOMM.

[7]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[8]  Tim Howes.  A String Representation of LDAP Search Filters , 1993, RFC.

[9]  Srinivasan Seshan,et al.  SPAND: Shared Passive Network Performance Discovery , 1997, USENIX Symposium on Internet Technologies and Systems.

[10]  Charles E. Perkins,et al.  Service Location Protocol, Version 2 , 1999, RFC.

[11]  Charles E. Perkins,et al.  Service Templates and Service: Schemes , 1999, RFC.

[12]  F. Plastria.  Network and discrete location models, algorithms and applications , 1996 .

[13]  Tim Howes.  The String Representation of LDAP Search Filters , 1997, RFC.

[14]  David E. Culler,et al.  Using smart clients to build scalable services , 1997 .

[15]  Dean Sutherland,et al.  A resource query interface for network-aware applications , 2004, Cluster Computing.

[16]  Hari Balakrishnan,et al.  The design and implementation of an intentional naming system , 1999, SOSP.

[17]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[18]  Jun Gao,et al.  An active networking approach to service customization , 2002, Proceedings DARPA Active Networks Conference and Exposition.

[19]  David R. Cheriton,et al.  An Architecture for Content Routing Support in the Internet , 2001, USITS.

[20]  Amin Vahdat,et al.  Active Names: flexible location and transport of wide-area resources , 1999, Proceedings DARPA Active Networks Conference and Exposition.

[21]  Anees Shaikh,et al.  On the effectiveness of DNS-based server selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Aravind Srinivasan,et al.  Clustering and server selection using passive monitoring , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[23]  Erich M. Nahum,et al.  Locality-aware request distribution in cluster-based network servers , 1998, ASPLOS VIII.

[24]  Eric A. Brewer,et al.  Cluster-based scalable network services , 1997, SOSP.

[25]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[26]  Warren Smith,et al.  A directory service for configuring high-performance distributed computations , 1997, Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183).

[27]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[28]  Chuang Liu,et al.  Design and evaluation of a resource selection framework for Grid applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[29]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[30]  Thomas R. Gross,et al.  Design, Implementation, and Evaluation of the Remos Network Monitoring System , 2004, Journal of Grid Computing.

[31]  Randy H. Katz,et al.  Achieving service portability in ICEBERG , 2000, IEEE Globecom '00 Workshop. 2000 IEEE Service Portability and Virtual Customer Environments (IEEE Cat. No.00EX498).

[32]  Mark D. Yarvis,et al.  Automated Planning for Open Architectures , 2000 .

[33]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[34]  Jun Gao,et al.  Rendezvous Points-Based Scalable Content Discovery with Load Balancing , 2002, Networked Group Communication.

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

[36]  Kay A. Robbins,et al.  An empirical evaluation of client-side server selection algorithms , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[37]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[38]  Klara Nahrstedt,et al.  QoS-aware discovery of wide-area distributed services , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[39]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[40]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.