An efficient service discovery algorithm for counting bloom filter-based service registry

2009 IEEE International Conference on Web Services, ICWS 2009

Volumn , Issue , 2009, Pages 157-164

  Cheng, Shuxing ^a   Chang, Carl K ^a   Zhang, Liang Jie ^b  

^a Iowa State University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURE DESIGNS; BLOOM FILTERS; EFFICIENT DATA STRUCTURES; FEATURE-BASED; HASH TABLE; NEW APPROACHES; NON-FUNCTIONAL REQUIREMENTS; NUMBER OF SERVICES; SERVICE DISCOVERY; SERVICE REGISTRY; SERVICE SYSTEMS; SERVICES DISCOVERY; STORAGE SOLUTIONS; SUPPORT SERVICES; YELLOW PAGES;

BLOOMS (METAL); DATA STRUCTURES; INFORMATION SERVICES; WEB SERVICES;

SERVICE ORIENTED ARCHITECTURE (SOA);

EID: 70449501107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2009.121     Document Type: Conference Paper

References (15)

1. B.Bloom. Space/time tradeoffs in hash coding with allowable errrors. Communications of the ACM, 13(7):422-426, 1970.
2. A. Broder and M. Mitzenmacher. Network Applications of Bloom Filters: A Survey. Internet Mathematics, 1(4):485-509, 2002.
3. G. Casella and R. L. Berger. Statistical Inference. Duxbury Press, 2001.
4. C. K. Chang, J. Cleland-Haung, S. Hua, and A. Kuntzmann- Combelles. Function-Class Decomposition: A Hybrid Software Engineering Method. IEEE Computer, 34(12):87-93, 2001.
5. C. Charras and T. Lecroq. Handbook of Exact String Matching Algorithms. College Publications, 2004.
6. Y. Chen, S. Lyer, X. Liu, D. Milojicic, and A. Sahai. Translating Service Level Objectives to Lower Level Policies for Multi-tier Services. Cluster Computing, 11(3):299-311, 2008.
7. S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor. Longest Prefix Matching Using Bloom Filters. IEEE/ACM Trans. Netw., 14(2):397-409, 2006.
8. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary Cache: a Scalable Wide-area Web Cache Sharing Protocol. IEEE/ACM Trans. Netw., 8(3):281-293, 2000.
9. D. Guo, J. Wu, H. Chen, and X. Luo. Theory and Network Applications of Dynamic Bloom Filters. In INFOCOM, 2006.
10. P. A. MacMahon. Combinatory Analysis. Dover Publications, 2004.
11. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood. Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing. In SIGCOMM, pages 181-192, 2005.
12. L. Zeng, B. Benatallah, A. H. Ngu, M. Dumas, J. Kalagnanam, and H. Chang. Qos-Aware Middleware for Web Services Composition. IEEE Trans. Softw. Eng., 30(5):311-327, 2004.
13. L. J. Zhang, S. Cheng, Y.-M. Chee, A. Allam, and Q. Zhou. Pattern Recognition Based Adaptive Categorization Technique and Solution for Services Selection. In Proceedings of the 2nd IEEE Asia-Pacific Service Computing Conference, pages 535-543, 2007.
14. L. J. Zhang, J.Zhang, and H.Cai. Services Computing. Springer and Tsinghua University Press, 2007.
15. L. J. Zhang and B. Li. Requirements Driven Dynamic Services Composition for Web Services and Grid Solutions. Journal of Grid Computing, 2(2):121-140, 2004.