Journal Home > Volume 22 , Issue 3
Tsinghua Science and Technology 2017, 22(3): 273-281 https://doi.org/10.23919/TST.2017.7914199
Open Access | Issue | Published: 04 May 2017

A Novel Multilevel Index Model for Distributed Service Repositories

Show Author's Information Zhao Xu,  Yan Wu( ),  Dejun Miao,  Lu Liu( )
School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China.
Department of Computer Science, Boise State University, ID 83725, USA.
Department of Computing and Mathematics, University of Derby, Derby, DE22 1GB, UK.
Keywords:
service computing, distributed algorithm, service retrieval, service storage
Cite this article:
Xu Z, Wu Y, Miao D, et al. A Novel Multilevel Index Model for Distributed Service Repositories. Tsinghua Science and Technology, 2017, 22(3): 273-281. https://doi.org/10.23919/TST.2017.7914199
Download citation
EndNote(RIS)
BibTeX

459

Views

25

Downloads

Citations

5

Crossref

N/A

WoS

4

Scopus

0

CSCD

Abstract Full text About this article

This study, based on the theory of equivalence relations, proposes a novel multilevel index model for decentralized service repositories to eliminate redundant information and enhance the time-management quality of the service retrieval process of the service repository architecture. An efficient resource discovery algorithm based on Discrete Hash Tables is presented to enable efficient and effective retrieval services among different distributed repositories. The performance of the proposed model and the supporting algorithms have been evaluated in a distributed environment. Experimental results validate the effectiveness of our proposed indexing model and search algorithm.


menu
Abstract
Full text
Outline
About this article

A Novel Multilevel Index Model for Distributed Service Repositories

Show Author's information Zhao Xu, Yan Wu( ), Dejun Miao, Lu Liu( )
School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China.
Department of Computer Science, Boise State University, ID 83725, USA.
Department of Computing and Mathematics, University of Derby, Derby, DE22 1GB, UK.

Abstract

This study, based on the theory of equivalence relations, proposes a novel multilevel index model for decentralized service repositories to eliminate redundant information and enhance the time-management quality of the service retrieval process of the service repository architecture. An efficient resource discovery algorithm based on Discrete Hash Tables is presented to enable efficient and effective retrieval services among different distributed repositories. The performance of the proposed model and the supporting algorithms have been evaluated in a distributed environment. Experimental results validate the effectiveness of our proposed indexing model and search algorithm.

Keywords: service computing, distributed algorithm, service retrieval, service storage

References(25)

[1]
Wu Y., Yan C., Liu L., Ding Z., and Jiang C., An adaptive multilevel indexing method for disaster service discovery, IEEE Transactions on Computers, vol. 64, pp. 2447-2459, 2015.
DOI Google Scholar
[2]
Wu Y., Yan C., Ding Z., Wang P., Jiang C., and Zhou M., A relational taxonomy of services for large scale service repositories, in Proc. 2012 IEEE 19th International Conference on Web Services (ICWS), 2012, pp. 644-645.
DOI
[3]
Wu Y., Yan C. G., Ding Z., Liu G., Wang P., Jiang C., and Zhou M., A multilevel index model to expedite web service discovery and composition in large-scale service repositories, IEEE Transactions on Services Computing, vol. 9, pp. 1-14, 2015.
DOI Google Scholar
[4]
Liu L., Antonopoulos N., Xu J., Webster D., and Wu K., Distributed service integration for disaster monitoring sensor systems, IET Communications, vol. 5, pp. 1777-1784, 2011.
DOI Google Scholar
[5]
Liu L., Webster D., Xu J., and Wu K., Enabling dynamic workflow for disaster monitoring and relief through service-oriented sensor networks, in Proc. 2010 5th International ICST Conference on Communications and Networking in China (CHINACOM), 2010, pp. 1-7.
DOI
[6]
Chen Z., Ma J., Song L., and Lian L., An efficient approach to web services discovery and composition when large scale services are available, in Proc. 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC’06), 2006, pp. 34-41.
DOI
[7]
Kuang L., Li Y., Wu J., Deng S., and Wu Z., Inverted indexing for composition-oriented service discovery, in Proc. IEEE International Conference on Web Services (ICWS 2007), 2007, pp. 257-264.
DOI
[8]
Oh S. C., Lee D., and Kumara S. R. T., Effective web service composition in diverse and large-scale service networks, IEEE Transactions on Services Computing, vol. 1, pp. 15-32, 2008.
DOI Google Scholar
[9]
Oh S. C., Lee J. Y., Cheong S. H., Lim S. M., Kim M.W., Lee S. S., Park J., Noh S., and Sohn M. M., WSPR*: Web-service planner augmented with A* algorithm, in Proc. 2009 IEEE Conference on Commerce and Enterprise Computing, 2009, pp. 515-518.
[10]
Kwon J., Kim H., Lee D., and Lee S., Redundant-free web services composition based on a two-phase algorithm, in Proc. 2008 IEEE International Conference on Web Services (ICWS ’08), 2008, pp. 361-368.
DOI
[11]
Lee D., Kwon J., Lee S., Park S., and Hong B., Scalable and efficient web services composition based on a relational database, Journal of Systems and Software, vol. 84, pp. 2139-2155, 2011.
DOI Google Scholar
[12]
Tang X., Jiang C., and Ding Z., Automatic web service composition based on logical inference of horn clauses in petri net models, in Proc. IEEE International Conference on Web Services (ICWS 2007), 2007, pp. 1162-1163.
DOI
[13]
Chattopadhyay S., Banerjee A., and Banerjee N., A scalable and approximate mechanism for web service composition, in Proc. 2015 IEEE International Conference on Web Services (ICWS), 2015, pp. 9-16.
DOI
[14]
Wu C. S. and Khoury I., Tree-based search algorithm for web service composition in SaaS, in Proc. 2012 Ninth International Conference on Information Technology: New Generations (ITNG), 2012, pp. 132-138.
[15]
Hennig P. and Balke W. T., Highly scalable web service composition using binary tree-based parallelization, in Proc. 2010 IEEE International Conference on Web Services (ICWS), 2010, pp. 123-130.
DOI
[16]
Yan Y., Xu B., and Gu Z., Automatic service composition using AND/OR graph, in Proc. 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and EServices, 2008, pp. 335-338.
DOI
[17]
Shiaa M. M., Fladmark J. O., and Thiell B., An incremental graph-based approach to automatic service composition, in Proc. 2008 IEEE International Conference on Services Computing (SCC ’08), 2008, pp. 397-404.
DOI
[18]
Wirtz H., Heer T., Serror M., and Wehrle K., DHT-based localized service discovery in wireless mesh networks, in Proc. 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2012), 2012, pp. 19-28.
DOI
[19]
Cirani S. and Veltri L., Implementation of a framework for a DHT-based distributed location service, in Proc. 2008. SoftCOM 2008. 16th International Conference on Software, Telecommunications and Computer Networks, 2008, pp. 279-283.
DOI
[20]
Liu L., Antonopoulos N., Zheng M., Zhan Y., and Ding Z., A socio-ecological model for advanced service discovery in machine-to-machine communication networks, ACM Transactions on Embedded Computing, vol 15, pp. 1-26, 2016.
DOI Google Scholar
[21]
Stoica I., Morris R., Liben-Nowell D., Karger D. R., Kaashoek M. F., Dabek F., and Balakrishnan H., Chord: A scalable peer-topeer lookup protocol for Internet applications, IEEE/ACM Transactions on Networking, vol. 11, pp. 17-32, 2003.
DOI Google Scholar
[22]
Karger D., Lehman E., Leighton T., Levine M., Lewin D., and Panigrahy R., Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, in Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 654-663.
DOI
[23]
Plaxton C. G., Rajaraman R., and Richa A.W., Accessing nearby copies of replicated objects in a distributed environment, in Proceedings of the 1997 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 311-320.
DOI
[24]
Rowstron A. and Druschel P., Pastry: Scalable, decentralized object location, and routing for large-scale peerto-peer systems, in Proc. IFIP/ACM International Conference on Distributed Systems Platforms and Open Distributed Processing, 2001, pp. 329-350.
DOI
[25]
Ratnasamy S., Francis P., Handley M., Karp R., and Schenker S., A scalable content-addressable network, in Proc. ACM SIGCOMM 2001- Applications, Technologies, Architectures, and Protocols for Computers Communications, 2001, pp. 161-172.
DOI
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 02 July 2016
Revised: 07 December 2016
Accepted: 21 December 2016
Published: 04 May 2017
Issue date: June 2017

Copyright

© The authors 2017

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (Nos. 61502209 and 61502207), Postdoc Funds of China and Jiangsu Province (Nos. 2015M580396 and 1501023A), and the Jiangsu University Foundation (No. 5503000049).

Rights and permissions

Return