Network-sensitive service discovery

被引:4
作者
Huang, An-Cheng [1 ]
Steenkiste, Peter [2 ]
机构
[1] Computer Science Department, Carnegie Mellon University, Pittsburgh
[2] Electrical and Computer Engineering Department, Carnegie Mellon University, Pittsburgh
基金
美国国家科学基金会;
关键词
Network measurement; Server selection; Service composition; Service discovery;
D O I
10.1023/B:GRID.0000035168.31411.0c
中图分类号
学科分类号
摘要
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. © 2004 Kluwer Academic Publishers.
引用
收藏
页码:309 / 326
页数:17
相关论文
共 43 条
[1]  
Active Network Backbone (ABone)
[2]  
Adjie-Winoto W., Schwartz E., Balakrishnan H., Lilley J., The Design and Implementation of an Intentional Naming System, Proc. ACM SOSP '99, (1999)
[3]  
Andrews M., Shepherd B., Srinivasan A., Winkler P., Zane F., Clustering and Server Selection Using Passive Monitoring, Proc. IEEE INFOCOM 2002, (2002)
[4]  
Carter R., Crovella M., Server Selection Using Dynamic Path Characterization inWide-Area Networks, Proc. IEEE INFOCOM '97, (1997)
[5]  
Chu Y., Rao S., Zhang H., A Case for End System Multicast, Proc. ACM Sigmetrics, (2000)
[6]  
Czajkowski K., Fitzgerald S., Foster I., Kesselman C., Grid Information Services for Distributed Resource Sharing, Proc. Tenth IEEE International Symposium On High-Performance Distributed Computing (HPDC-10), (2001)
[7]  
Czerwinski S.E., Zhao B.Y., Hodes T., Joseph A.D., Katz R., An Architecture for a Secure Service Discovery Service, MobiCOM '99, (1999)
[8]  
Daskin M.S., Network and Discrete Location: Models, Algorithms, and Applications, (1995)
[9]  
Dykes S.G., Jeffery C.L., Robbins K.A., An Empirical Evaluation of Client-side Server Selection Algorithms, Proc. IEEE INFOCOM 2000, (2000)
[10]  
TheEmulab Testbed