Abstract
This paper outlines a general method for allocating a document collection over a distributed storage system. Documents are organized to make up a corporate semantic web featured by a graph G 1, each of whose nodes represents a set of documents having a common range of semantic indices. There exists a second graph G 2 modelling the distributed storage system. Our approach consists of embedding G 1 into G 2, under size restrictions. We use a meta-heuristic called “Ant Colony Optimization”, to solve the corresponding instances of the graph embedding problem, which is known to be a NP problem. Our solution provides an efficient mechanism for information storage and retrieval.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Scientific American, 28–37 (2001)
Dieng-Kuntz, R.: Corporate Semantic Webs. ERCIM News 51, 19–21 (2002)
Yanilos, P., Sobti, S.: The evolving field of distributed storage. IEEE Internet Computing 5(5), 35–39 (2001)
Kubiatowicz, J., et al.: OceanStore: An architecture for global-scale persistent storage. SIGARCH Comput. Archit. News. 28(5), 190–201 (2000)
Kuntz, P., Layzell, P., Snyers, D.: A colony of ant-like agents for partitioning in VLSI technology. In: Husbands, P., Harvey, I. (eds.) Proceedings of the Fourth European Conference on Artificial Life, pp. 417–424. MIT Press, Cambridge (1997)
Newsome, J., Song, D.: GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information. In: Proceedings of the 1st international conference on Embedded networked sensor systems, SenSys 2003, pp. 76–88. ACM, New York (2003)
Bhatt, S.N., Ipsen, I.C.F.: How to embed trees in hypercubes. Yale University, Dept. of Computer Science. Research Report YALEU/DCS/RR-443 (1985)
Chan, M.Y., Chin, F.Y.L.: On embedding rectangular grids in hypercubes. IEEE Transactions on Computers 37(10), 1285–1288 (1988)
Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM Journal on Discrete Mathematics 12(1), 6–26 (1999)
Gagarin, A., Kocay, W., Neilson, D.: Embeddings of Small Graphs on the Torus. CUBO 5, 171–251 (2003)
Erten, C., Kobourov, S.G.: Simultaneous Embedding of Planar Graphs with Few Bends. Journal of Graph Algorithms and Applications 9(3), 347–364 (2005)
Savage, J.E., Wloka, M.G.: MOB a parallel heuristic for graph embedding. Technical Report CS-93-01, Brown University, Dep. Computer Science (1993)
Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D. Thesis, Dept. of Electronics, Politecnico di Milano, Italy (1992)
Gutjahr, W.: A generalized convergence result for the graph-based ant system metaheuristic. University of Vienna, Technical Report 99-09 (1999)
Cidon, I.: Yet Another Distributed Depth-First-Search Algorithm. Information Processing Letters 26(6), 301–305 (1988)
Segall, A.: Distributed network protocols. IEEE Transaction on Information Theory 29(1), 23–25 (1983)
Johnson Norman, L., Leone Fred, C.: Statistics and Experimental Design in Engineering and the Physical Sciences, 2nd edn. vol. 1 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rios-Alvarado, A.B., Marcelín-Jiménez, R., Medina-Ramírez, R.C. (2009). ACO for Solving the Distributed Allocation of a Corporate Semantic Web. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-05258-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05257-6
Online ISBN: 978-3-642-05258-3
eBook Packages: Computer ScienceComputer Science (R0)