TY - RPRT T1 - The Implementation of OpenStack Cinder and Integration with NetApp and Ceph Y1 - 2013 A1 - Gary McGilvary A1 - Thomas Oulevey AB - With the ever increasing amount of data produced from Large Hadron Collider (LHC) experiments, new ways are sought to help analyze and store this data as well as help researchers perform their own experiments. To help offer solutions to such problems, CERN has employed the use of cloud computing and in particular OpenStack; an open source and scalable platform for building public and private clouds. The OpenStack project contains many components such as Cinder used to create block storage that can be attached to virtual machines and in turn help increase performance. However instead of creating volumes locally with OpenStack, others remote storage clusters exist offering block based storage with features not present in the current OpenStack implementation; two popular solutions are NetApp and Ceph. Two features Ceph offers is the ability to stripe data stored within volumes over the distributed cluster as well as locally cache this data, both with the aim of improving performance. When in use with OpenStack, Ceph performs default data striping where the number and size of stripes is fixed and cannot be changed dependent on the volume to be created. Similarly, Ceph does not perform data caching when integrated with OpenStack. In this project we outline and document the integration of NetApp and Ceph with OpenStack as well as benchmark the performance of the NetApp and Ceph clusters already present at CERN. To allow Ceph data striping, we modify OpenStack to take the number and size of stripes input via the user to create volumes whose data is then striped according to the values they specify. Similarly, we also modify OpenStack to enable Ceph caching and allow users to select the caching policy they require per-volume. In this report, we describe how these features are implemented. JF - CERN Openlab PB - CERN ER - TY - Generic T1 - Intrusion Detection in Open Peer-to-Peer Multi-agent Systems T2 - 5th International Conference on Autonomous Infrastructure, Management and Security (AIMS 2011) Y1 - 2011 A1 - Shahriar Bijani A1 - David Robertson AB - One way to build large-scale autonomous systems is to develop open peer-to-peer architectures in which peers are not pre-engineered to work together and in which peers themselves determine the social norms that govern collective behaviour. A major practical limitation to such systems is security because the very openness of such systems negates most traditional security solutions. We propose a programme of research that addresses this problem by devising ways of attack detection and damage limitation that take advantage of social norms described by electronic institutions. We have analysed security issues of open peer-to-peer multi-agent systems and focused on probing attacks against confidentiality. We have proposed a framework and adapted an inference system, which shows the possibility of private information disclosure by an adversary. We shall suggest effective countermeasures in such systems and propose attack response techniques to limit possible damages. JF - 5th International Conference on Autonomous Infrastructure, Management and Security (AIMS 2011) T3 - Managing the dynamics of networks and services PB - Springer-Verlag Berlin SN - 978-3-642-21483-7 ER - TY - JOUR T1 - Integrating distributed data sources with OGSA--DAI DQP and Views JF - Philosophical Transactions A Y1 - 2010 A1 - Dobrzelecki, B. A1 - Krause, A. A1 - Hume, A. C. A1 - Grant, A. A1 - Antonioletti, M. A1 - Alemu, T. Y. A1 - Atkinson, M. A1 - Jackson, M. A1 - Theocharopoulos, E. AB - OGSA-DAI (Open Grid Services Architecture Data Access and Integration) is a framework for building distributed data access and integration systems. Until recently, it lacked the built-in functionality that would allow easy creation of federations of distributed data sources. The latest release of the OGSA-DAI framework introduced the OGSA-DAI DQP (Distributed Query Processing) resource. The new resource encapsulates a distributed query processor, that is able to orchestrate distributed data sources when answering declarative user queries. The query processor has many extensibility points, making it easy to customize. We have also introduced a new OGSA-DAI Views resource that provides a flexible method for defining views over relational data. The interoperability of the two new resources, together with the flexibility of the OGSA-DAI framework, allows the building of highly customized data integration solutions. VL - 368 ER - TY - JOUR T1 - The interactive European Grid: Project objectives and achievements JF - Computing and Informatics Y1 - 2008 A1 - J Marco A1 - Campos, I. A1 - Coterillo, I. A1 - Diaz, I. A1 - Lopez, A. A1 - Marco, R. A1 - Martinez-Rivero, C. A1 - Orviz, P. A1 - Rodríguez, David A1 - Gomes, J. A1 - Borges, G. A1 - Montecelo, M. A1 - David, M. A1 - Silva, B. A1 - Dias, N. A1 - Martins, JP A1 - Fernandez, C. A1 - Garcia-Tarres, L. VL - 27 IS - 2 ER - TY - CONF T1 - Interaction as a Grounding for Peer to Peer Knowledge Sharing T2 - Advances in Web Semantics Y1 - 2007 A1 - Robertson, D. A1 - Walton, C. A1 - Barker, A. A1 - Besana, P. A1 - Chen-Burger, Y. A1 - Hassan, F. A1 - Lambert, D. A1 - Li, G. A1 - McGinnis, J A1 - Osman, N. A1 - Bundy, A. A1 - McNeill, F. A1 - van Harmelen, F. A1 - Sierra, C. A1 - Giunchiglia, F. JF - Advances in Web Semantics PB - LNCS-IFIP VL - 1 ER - TY - CONF T1 - Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation T2 - Springer Lecture Notes on Computer Science Y1 - 2006 A1 - Juhos, I. A1 - van Hemert, J. I. ED - J. Gottlieb ED - G. Raidl KW - constraint satisfaction KW - graph colouring AB - We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, our model provides useful information for guiding heuristics as well as a compact description for algorithms. To verify the potential of the model, we use it in dsatur, in an evolutionary algorithm, and in the same evolutionary algorithm extended with heuristics. An empiricial investigation is performed to show an increase in efficiency on two problem suites , a set of practical problem instances and a set of hard problem instances from the phase transition. JF - Springer Lecture Notes on Computer Science PB - Springer-Verlag ER - TY - JOUR T1 - Increasing the efficiency of graph colouring algorithms with a representation based on vector operations JF - Journal of Software Y1 - 2006 A1 - Juhos, I. A1 - van Hemert, J. I. KW - graph colouring AB - We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of graph colouring algorithms. Moreover, this model provides useful information to aid in the creation of heuristics that can make the colouring process even faster. It also serves as a compact definition for the description of graph colouring algorithms. To verify the potential of the model, we use it in the complete algorithm DSATUR, and in two version of an incomplete approximation algorithm; an evolutionary algorithm and the same evolutionary algorithm extended with guiding heuristics. Both theoretical and empirical results are provided investigation is performed to show an increase in the efficiency of solving graph colouring problems. Two problem suites were used for the empirical evidence: a set of practical problem instances and a set of hard problem instances from the phase transition. VL - 1 ER - TY - CONF T1 - Introduction to OGSA-DAI Services T2 - Scientific Applications of Grid Computing Y1 - 2005 A1 - Karasavvas, K. A1 - Antonioletti, M. A1 - Atkinson, M. A1 - Hong, N. C. A1 - Sugden, T. A1 - Hume, A. A1 - Jackson, M. A1 - Krause, A. A1 - Palansuriya, C. JF - Scientific Applications of Grid Computing VL - 3458 SN - 978-3-540-25810-0 ER - TY - CONF T1 - Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java T2 - ICDT Y1 - 1999 A1 - Atkinson, Malcolm P. A1 - Jordan, Mick J. JF - ICDT ER -