Applications experience with Linda
PPEALS '88 Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems
Open Distributed Processing and Multimedia
Open Distributed Processing and Multimedia
Jxta in a Nutshell
Copying and Comparing: Problems and Solutions
ECOOP '00 Proceedings of the 14th European Conference on Object-Oriented Programming
Abstracting Services in a Heterogeneous Environment
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Coordination Model Agents Based on Secure Spaces
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
UDDIe: An Extended Registry for Web Services
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
HydroJ: object-oriented pattern matching for evolvable distributed systems
OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Distributed Programming with Typed Events
IEEE Software
Tagged sets: a secure and transparent coordination medium
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Reuse frequency as metric for dependency resolver selection
CD'05 Proceedings of the Third international working conference on Component Deployment
| Hi-index | 0.00 |
The possibilities currently offered to conduct business at an electronic level are immense. Service providers offer access to their attendances through components placed on the Internet; such components can be combined to build applications, which can themselves be used as components by further business units. The final leg of the way to this paradigm has been paved by the advent of service-oriented architectures in general, and Web Services in particular. With protocols existing for any parties to communicate, the most critical ingredient to the success of a business idea remains the task of choosing one's business partners. At a technical level, this translates to the issue of identifying which components represent the most adequate services to build a final application. While each middleware technology and system proposed in the past has been described with its scheme for “looking up” components, this paper chooses the more difficult approach of trying to distill the fundamentals of component lookup. We propose a generic model of component lookup — applicable to settings as diverse as tagged sets, classic white pages, or even method dispatch — and its implementation. We illustrate our model through various examples of existing lookup schemes. It turns out that in our generic context the common distinction between name-based and type-based lookup becomes rather artificial.