Massively Scalable Web Service Discovery

The increasing popularity of Web Services (WS) has exemplified the need for scalable and robust discovery mechanisms. Although decentralized solutions for discovering WS promise to fulfill these needs, most make limiting assumptions concerning the number of nodes and the topology of the network and rely on having information on the data a-priori (e.g. categorizations or popularity distributions). In addition, most systems are tested via simulations using artificial datasets. In this paper we present a lightweight, scalable and robust WSDL discovery mechanism based on real-time calculation of term popularity. Results based on a large-scale emulation on the DAS-3 distributed supercomputer, using real data from seekda, show that we can achieve web-scale service discovery based on term search.

• Type: Conference
• Year: 2009
• Where: AINA
• Authors: George Anadiotis, Spyros Kotoulas, Holger Lausen, Ronny Siebes
• Keywords: AINA 2009, Computer Networks, Discovery Mechanism, Robust Discovery Mechanisms, Robust Wsdl Discovery