This work presents a framework by which a massive multiagent organization can be controlled and modified without resorting to micromanagement and without needing advanced knowledge of potentially complex organizations. In addition to their designated duties, agents in the proposed framework perform some method of determining optimal traits such as configurations, plans, knowledge bases and so forth. Traits follow survival of the fittest rules in which more successful traits overpower less successful ones. Subproblem partitions develop emergently as successful solutions are disseminated to and aggregated by unsuccessful agents. Provisions are provided to allow the administrator to guide the search process by injecting solutions known to work for a particular agent. The performance of the framework is evaluated via comparison to individual state-space search.

No description available.

This thesis presents a framework for semantic Web Service discovery using descriptive (non-functional) service characteristics in a large-scale, multi-domain setting. The framework uses Web Ontology Language for Services (OWL-S) to design a template for describing non-functional service parameters in a way that facilitates service discovery, and presents a layered scheme for organizing ontologies used in service description. This service description scheme serves as a core for desigining the four main functions of a service directory: a template-based user interface, semantic query expansion algorithms, a two-level indexing scheme that combines Bloom filters with a Distributed Hash Table, and a distributed approach for storing service description. The service directory is, in turn, implemented as an extension of the Open Service Discovery Architecture. <br /><br /> The search algorithms presented in this thesis are designed to maximize precision and completeness of service discovery, while the distributed design of the directory allows individual administrative domains to retain a high degree of independence and maintain access control to information about their services.

This thesis presents a framework for semantic Web Service discovery using descriptive (non-functional) service characteristics in a large-scale, multi-domain setting. The framework uses Web Ontology Language for Services (OWL-S) to design a template for describing non-functional service parameters in a way that facilitates service discovery, and presents a layered scheme for organizing ontologies used in service description. This service description scheme serves as a core for desigining the four main functions of a service directory: a template-based user interface, semantic query expansion algorithms, a two-level indexing scheme that combines Bloom filters with a Distributed Hash Table, and a distributed approach for storing service description. The service directory is, in turn, implemented as an extension of the Open Service Discovery Architecture. <br /><br /> The search algorithms presented in this thesis are designed to maximize precision and completeness of service discovery, while the distributed design of the directory allows individual administrative domains to retain a high degree of independence and maintain access control to information about their services.

Networked systems, such as cloud infrastructures, are growing in size and complexity.They hold and generate a vast amount of configuration and operational data, whichis maintained in various locations and formats, and changes at various time scales.A wide range of protocols and technologies is used to access this data for networkmanagement tasks. A concept called ‘network search’ is introduced to make all thisdata available in real-time through a search platform with a uniform interface, whichenables location-independent access through search queries. Network search requires a network of search nodes, where the nodes have identicalcapabilities and work cooperatively to process search queries in a peer-to-peer fashion.A search node should indicate good performance results in terms of low query responsetimes, high throughputs, and low overhead costs and should scale to large networkedsystems with at least hundred thousands nodes. This thesis contributes in several aspects towards the design and implementation of anetwork search node. We designed a search node that includes three major components,namely, a real-time data sensing component, a real-time database, and a distributedquery-processing component. The design takes indexing of search terms and concurrencyof query processing into consideration, which accounts for fast response timesand high throughput of search queries. We implemented a network search node as asoftware package that runs on a server that provides a cloud service, and we evaluatedits performance on a cloud testbed of nine servers. The performance measurementssuggest that a network search system based on our design can process queries at lowquery latencies for a high query load, while maintaining a low overhead of computationalresources.

Visma Labs AB or Visma wanted to conduct experiments to see if file metadata could be indexed for searching files on a public cloud storage. Given that storing files in a public cloud storage is cheaper than the current storage solution, the implementation could save Visma money otherwise spent on expensive storage costs. The thesis is therefore to find and evaluate an approach chosen for indexing file metadata and searching files on a public cloud storage with the chosen distributed search engine Elasticsearch. The architecture of the proposed solution is similar to a file service and was implemented using several containerized services for it to function. The results show that the file service solution is indeed feasible but would need further tuning and more resources to function according to the demands of Visma. / Visma Labs AB eller Visma ville genomföra experiment för att se om filmetadata skulle kunna indexeras för att söka efter filer på ett publikt moln. Med tanke på att lagring av filer på ett publikt moln är billigare än den nuvarande lagringslösningen, kan implementeringen spara Visma pengar som spenderas på dyra lagringskostnader. Denna studie är därför till för att hitta och utvärdera ett tillvägagångssätt valt för att indexera filmetadata och söka filer på ett offentligt molnlagring med den utvalda distribuerade sökmotorn Elasticsearch. Arkitekturen för den föreslagna lösningen har likenelser av en filtjänst och implementerades med flera containeriserade tjänster för att den ska fungera. Resultaten visar att filservicelösningen verkligen är möjlig men skulle behöva ytterligare modifikationer och fler resurser att fungera enligt Vismas krav.