Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Cluster-based scalable network services
Proceedings of the sixteenth ACM symposium on Operating systems principles
Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Application-layer anycasting: a server selection architecture and use in a replicated Web service
IEEE/ACM Transactions on Networking (TON)
The Ninja architecture for robust Internet-scale systems and services373423
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
A Resource Query Interface for Network-Aware Applications
HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An Active Networking Approach to Service Customization
DANCE '02 Proceedings of the 2002 DARPA Active Networks Conference and Exposition
An architecture for content routing support in the internet
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Active names: flexible location and transport of wide-area resources
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
SPAND: shared passive network performance discovery
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Using smart clients to build scalable services
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
Lessons from resource allocators for large-scale multiuser testbeds
ACM SIGOPS Operating Systems Review
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
A dynamic platform for run-time adaptation
Pervasive and Mobile Computing
User preference based service discovery
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Slice embedding solutions for distributed service architectures
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
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 utilized for different applications.