Efficient static minkowski clustering for web service aggregation

Abstract

The paper presents new design and implementation for Web messages static clustering based on TF-IDF and Minkowski Distance metric. The target of the proposed Minkowski clustering is to empower Web messages aggregators in order to reduce network traffic by aggregating highly similar messages. Web services (W.S.) technology offers an extensive platform for representing, discovering, and calling services in many environments, including Service Oriented Architectures (SOA). The basis of W.S. technology is built upon several XML-based protocols, such as the Simple Object Access Protocol (SOAP), which effectively guarantees W.S. flexibility, transparency, and harmony. There is an increasing demand to enhance the efficiency of online services. It is mainly limited by the over utilization of XML. SOAP communications lead to high network congestion. Furthermore, they cause higher latency and processing delays when compared to alternative technologies. Previous studies have proposed XML clustering techniques to support compression- aggregation models. Technically, aggregation can decrease the overall size the SOAP messages, hence decreasing the needed bandwidth across clients and servers.