Static Hilbert convex set clustering for web services aggregation

Nawras A. Al-Musawi, Dhiah Al-Shammary


Web services' high levels of duplicate textual structures have caused network bottlenecks and congestion. Clustering and then aggregating similar web services as one compressed message can potentially achieve network traffic reduction. In this paper, a static Hilbert clustering as new model for clustering web services based on convex set similarity is proposed. Mathematically, the proposed model calculates similarity among simple object access protocol (SOAP) messages and then cluster them based on higher similarity values. Next, each cluster is aggregated as a compact message. The experiments have explained the proposed model performance as it has outperformed the convention clustering strategies in both compression ratio and clustering time. The best results have been achievable by the proposed model has reached up to (15) with fixed-length and up to (21) with Huffman.


Aggregation; Clustering; Hilbert; Simple object access protocol; Web services

Full Text:




  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics