Skip to main content
SpringerLink
Log in

Network-Sensitive Service Discovery

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. ”Active Network Backbone (ABone)”. http://www.isi.edu/ abone/.

  2. W. Adjie-Winoto, E. Schwartz, H. Balakrishnan and J. Lilley, “The Design and Implementation of an Intentional Naming System”, in Proc. ACM SOSP '99, 1999.

  3. M. Andrews, B. Shepherd, A. Srinivasan, P. Winkler and F. Zane, “Clustering and Server Selection Using Passive Monitoring”, in Proc. IEEE INFOCOM 2002, 2002.

  4. R. Carter and M. Crovella, “Server Selection Using Dynamic Path Characterization in Wide-Area Networks”, in Proc. IEEE INFOCOM '97, 1997.

  5. Y. Chu, S. Rao and H. Zhang, “A Case for End System Multicast”, in Proc. ACM Sigmetrics, 2000.

  6. K. Czajkowski, S. Fitzgerald, I. Foster and C. Kesselman, “Grid Information Services for Distributed Resource Sharing”, in Proc. Tenth IEEE International Symposium on High-Performance Distributed Computing (HPDC-10), 2001.

  7. S.E. Czerwinski, B.Y. Zhao, T. Hodes, A.D. Joseph and R. Katz, “An Architecture for a Secure Service Discovery Service”, in MobiCOM '99, 1999.

  8. M.S. Daskin, Network and Discrete Location: Models, Algorithms, and Applications. John Wiley & Sons, Inc., 1995.

  9. S.G. Dykes, C.L. Jeffery and K.A. Robbins, “An Empirical Evaluation of Client-side Server Selection Algorithms”, in Proc. IEEE INFOCOM 2000, 2000.

  10. ”The Emulab Testbed”. http://www.emulab.net.

  11. S. Fitzgerald, I. Foster, C. Kesselman, G. von Laszewski, W. Smith and S. Tuecke, “A Directory Service for Configuring High-Performance Distributed Computations”, in Proc. 6th IEEE Symposium on High-Performance Distributed Computing, 1997.

  12. A. Fox, S. Gribble, Y. Chawathe and E.A. Brewer, “Cluster-Based Scalable Network Services”, in Proc. ACM SOSP '97, 1997.

  13. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt and L. Zhang, “IDMaps: A Global Internet Host Distance Estimation Service”, IEEE/ACMTrans. on Networking, Vol. 9, No. 5, pp. 525–540, 2001.

    Google Scholar 

  14. J. Gao and P. Steenkiste, “Rendezvous Points-Based Scalable Content Discovery with Load Balancing”, in Proc. NGC 2002, 2002.

  15. ”Google”. http://www.google.com/.

  16. S.D. Gribble, M. Welsh, R. von Behren, E.A. Brewer, D. Culler, N. Borisov, S. Czerwinski, R. Gummadi, J. Hill, A. Joseph, R. Katz, Z. Mao, S. Ross and B. Zhao, “The Ninja Architecture for Robust Internet-Scale Systems and Services”, IEEE Computer Networks, Special Issue on Pervasive Computing, Vol. 35, No. 4, 2001.

  17. M. Gritter and D.R. Cheriton, “An Architecture for Content Routing Support in the Internet”, in Proc. USITS 2001, 2001.

  18. B. Lowekamp, N.Miller, R. Karrer, T. Grass and P. Steenkiste, “Design, Implementation, and Evaluation of the Remos Network Monitoring System”, Journal of Grid Computing, Vol. 1, No. 1, pp. 75–93, 2003.

    Google Scholar 

  19. E. Guttman, C. Perkins and J. Kempf, “Service Templates and Service Schemes”, RFC 2609, 1999.

  20. E. Guttman, C. Perkins, J. Veizades and M. Day, “Service Location Protocol, Version 2”, RFC 2608, 1999.

  21. J. Guyton and M. Schwartz, “Locating Nearby Copies of Replicated Internet Servers”, in Proc. ACM SIGCOMM '95, 1995.

  22. T. Howes, “The String Representation of LDAP Search Filters”, RFC 2254, 1997.

  23. A.-C. Huang and P. Steenkiste, “Distributed Load-Sensitive Routing for Computationally-Constrained Flows”, in Proc. ICC 2003, 2003.

  24. ”Jini[tm] Network Technology”. http://wwws.sun.com/ software/jini/.

  25. B. Krishnamurthy and J. Wang, “On Network-Aware Clustering of Web Clients”, in Proc. ACM SIGCOMM 2000, 2000.

  26. C. Liu, L. Yang, I. Foster and D. Angulo, “Design and Evaluation of a Resource Selection Framework for Grid Applications”, in Proc. IEEE International Symposium on High Performance Distributed Computing (HPDC-11), 2002.

  27. Z.M. Mao and R.H. Katz, “Achieving Service Portability in ICEBERG”, IEEE GlobeCom 2000, Workshop on Service Portability (SerP-2000), 2000.

  28. T.S.E. Ng and H. Zhang, “Predicting Internet Network Distance with Coordinates-Based Approaches”, in Proc. IEEE INFOCOM 2002, 2002.

  29. ”Active Measurement Project (AMP), National Laboratory for Applied Network Research”. http://watt.nlanr.net/.

  30. ”OpenSLP Home Page”. http://www.openslp.org/.

  31. V. Pai, M. Aron, G. Banga, M. Svendsen, P. Druschel, W. Zwaenepoel and E. Nahum, “Locality-aware Request Distribution in Cluster-based Network Servers”, in Proc. ASPLOS-VIII, 1998.

  32. C. Partridge, T. Mendez and W. Milliken, “Host Anycasting Service”, RFC 1546, 1993.

  33. ”PlanetLab Home Page”. http://www.planet-lab.org/.

  34. S. Ratnasamy, M. Handley, R. Karp and S. Shenker, “Topologically-Aware Overlay Construction and Server Selection”, in Proc. IEEE INFOCOM 2002, 2002.

  35. P. Reiher, R. Guy, M. Yarvis and A. Rudenko, “Automated Planning for Open Architectures”, in Proc. OPENARCH 2000-Short Paper Session, 2000, pp. 17–20.

  36. S. Seshan, M. Stemm and R.H. Katz, “SPAND: Shared Passive Network Performance Discovery”, in Proc. USITS '97, 1997.

  37. A. Shaikh, R. Tewari and M. Agrawal, “On the Effectiveness of DNS-based Server Selection”, in Proc. IEEE INFOCOM 2001, 2001.

  38. P. Steenkiste, P. Chandra, J. Gao and U. Shah, “An Active Networking Approach to Service Customization”, in Proc. DARPA Active Networks Conference and Exposition (DANCE'02), 2002, pp. 305–318.

  39. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan, “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications”, in Proc. ACM SIGCOMM 2001, 2001.

  40. A. Vahdat, M. Dahlin, T. Anderson and A. Aggarwal, “Active Names: Flexible Location and Transport of Wide-Area Resources”, in Proc. USITS '99, 1999.

  41. D. Xu, K. Nahrstedt and D.Wichadakul, “QoS-Aware Discovery of Wide-Area Distributed Services”, in Proc. IEEE/ACM Int'l Symposium on Cluster Computing and the Grid (CCGrid2001), 2001.

  42. C. Yoshikawa, B. Chun, P. Eastham, A. Vahdat, T. Anderson and D. Culler, “Using Smart Clients to Build Scalable Services”, in Proc. USENIX 1997 Annual Technical Conference, 1997.

  43. E.W. Zegura, M.H. Ammar, Z. Fei and S. Bhattacharjee, “Application-Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service”, IEEE/ACM Trans. on Networking, Vol. 8, No. 4, pp. 455–466, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, 15213, USA E-mail: pach@cs.cmu.edu

    An-Cheng Huang & Peter Steenkiste

Authors
  1. An-Cheng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Steenkiste
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, AC., Steenkiste, P. Network-Sensitive Service Discovery. Journal of Grid Computing 1, 309–326 (2003). https://doi.org/10.1023/B:GRID.0000035168.31411.0c

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:GRID.0000035168.31411.0c

Search

Navigation