Load balancing solution and evaluation of F5 content switch equipment

The Thesis focused on hardware based Load balancing solution of web traffic through a load balancer F5 content switch. In this project, the implemented scenario for distributing HTTPtraffic load is based on different CPU usages (processing speed) of multiple member servers.Two widely used load balancing algorithms Round Robin (RR) and Ratio model (weighted Round Robin) are implemented through F5 load balancer. For evaluating the performance of F5 content switch, some experimental tests has been taken on implemented scenarios using RR and Ratio model load balancing algorithms. The performance is examined in terms of throughput (bits/sec) and Response time of member servers in a load balancing pool. From these experiments we have observed that Ratio Model load balancing algorithm is most suitable in the environment of load balancing servers with different CPU usages as it allows assigning the weight according to CPU usage both in static and dynamic load balancing of servers.

En beskrivning av informationsmiljö därdatumstyrda förhållanden råder : En fallstudie av en myndighet och dess informationsmiljö med rättsakter

In this study a case study was conducted at the Transport Agency. The government agency is seeking better alternatives to its current ways of keeping track of important dates stated in legal documents. The agency wants to explore the possibility for an IT-solution for keeping track on those dates. In the case study change analysis was conducted on the vehicle type approval process. Qualitative interviews were conducted with a section manager, vehicle type and component approvers, and with a system administrator and a system manager at the Transport Agency in Borlänge. The study describes an information environment in an organization in which date-controlled conditions apply and challenges with such an environment.The study also provides a proposal for designing an IT-solution for such an environment. The result that emerged showed that the information environment in terms of the legal documents and the institutions’ (EU and UNECE) websites where they are distributed is challenging for keeping track on dates. The challenges of the websites are that they are limited and complicated in terms of information search. The challenges with the legal documents are that date-controlled conditions apply. In other words, the dates themselves determine which dates and what applies and not. The legal documents are also many, retroactive, refer to each other and contain regulations for different kinds of areas, which makes difficult to find the relevant dates. The design proposal that emerged was made based on the existing IT environment at the Transport Agency. It was proposed that important key concepts are identified, categorized and realized in a database with searchability on the most important common concepts as denominators, and that it the information conforms with E-message. The developed database was based on date, date type, vehicle category, legal document, minor version and other info. A web interface was created in ASP.NET and C # for access to the database, with the message that a webbbased IT-solution should be considered.

A stopping rule while searching for optimal solution of facility-location

Solutions to combinatorial optimization, such as p-median problems of locating facilities, frequently rely on heuristics to minimize the objective function. The minimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. However, pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small branch of the literature suggests using statistical principles to estimate the minimum and use the estimate for either stopping or evaluating the quality of the solution. In this paper we use test-problems taken from Baesley's OR-library and apply Simulated Annealing on these p-median problems. We do this for the purpose of comparing suggested methods of minimum estimation and, eventually, provide a recommendation for practioners. An illustration ends the paper being a problem of locating some 70 distribution centers of the Swedish Post in a region.

From the road network database to a graph for localization purposes

The problems of finding best facility locations require complete and accurate road network with the corresponding population data in a specific area. However the data obtained in road network databases usually do not fit in this usage. In this paper we propose our procedure of converting the road network database to a road graph which could be used in localization problems. The road network data come from the National road data base in Sweden. The graph derived is cleaned, and reduced to a suitable level for localization problems. The population points are also processed in ordered to match with that graph. The reduction of the graph is done maintaining most of the accuracy for distance measures in the network.

Network density and the p-median solution

The p-medianmodel is commonly used to find optimal locations of facilities for geographically distributed demands. So far, there are few studies that have considered the importance of the road network in the model. However, Han, Håkansson, and Rebreyend (2013) examined the solutions of the p-median model with densities of the road network varying from 500 to 70,000 nodes. They found as the density went beyond some 10,000 nodes, solutions have no further improvements but gradually worsen. The aim of this study is to check their findings by using an alternative heuristic being vertex substitution, as a complement to their using simulated annealing. We reject the findings in Han et al (2013). The solutions do not further improve as the nodes exceed 10,000, but neither do the solutions deteriorate.