An optimal algorithm for the weighted backup 2-center problem on a tree

In this paper, we are concerned with the weighted backup 2-center problem on a tree. The backup 2-center problem is a kind of center facility location problem, in which one is asked to deploy two facilities, with a given probability to fail, in a network. Given that the two facilities do not fail simultaneously, the goal is to find two locations, possibly on edges, that minimize the expected value of the maximum distance over all vertices to their closest functioning facility. In the weighted setting, each vertex in the network is associated with a nonnegative weight, and the distance from vertex $u$ to $v$ is weighted by the weight of $u$. With the strategy of prune-and-search, we propose a linear time algorithm, which is asymptotically optimal, to solve the weighted backup 2-center problem on a tree.Comment: 14 pages, 4 figure

Optimal allocation of defibrillator drones in mountainous regions

Responding to emergencies in Alpine terrain is quite challenging as air ambulances and mountain rescue services are often confronted with logistics challenges and adverse weather conditions that extend the response times required to provide life-saving support. Among other medical emergencies, sudden cardiac arrest (SCA) is the most time-sensitive event that requires the quick provision of medical treatment including cardiopulmonary resuscitation and electric shocks by automated external defibrillators (AED). An emerging technology called unmanned aerial vehicles (or drones) is regarded to support mountain rescuers in overcoming the time criticality of these emergencies by reducing the time span between SCA and early defibrillation. A drone that is equipped with a portable AED can fly from a base station to the patient's site where a bystander receives it and starts treatment. This paper considers such a response system and proposes an integer linear program to determine the optimal allocation of drone base stations in a given geographical region. In detail, the developed model follows the objectives to minimize the number of used drones and to minimize the average travel times of defibrillator drones responding to SCA patients. In an example of application, under consideration of historical helicopter response times, the authors test the developed model and demonstrate the capability of drones to speed up the delivery of AEDs to SCA patients. Results indicate that time spans between SCA and early defibrillation can be reduced by the optimal allocation of drone base stations in a given geographical region, thus increasing the survival rate of SCA patients

Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems

Instant restore after a media failure

Media failures usually leave database systems unavailable for several hours until recovery is complete, especially in applications with large devices and high transaction volume. Previous work introduced a technique called single-pass restore, which increases restore bandwidth and thus substantially decreases time to repair. Instant restore goes further as it permits read/write access to any data on a device undergoing restore--even data not yet restored--by restoring individual data segments on demand. Thus, the restore process is guided primarily by the needs of applications, and the observed mean time to repair is effectively reduced from several hours to a few seconds. This paper presents an implementation and evaluation of instant restore. The technique is incrementally implemented on a system starting with the traditional ARIES design for logging and recovery. Experiments show that the transaction latency perceived after a media failure can be cut down to less than a second and that the overhead imposed by the technique on normal processing is minimal. The net effect is that a few "nines" of availability are added to the system using simple and low-overhead software techniques

A row generation method for inverse continuous facility location problem

In a single facility location problem, a set of points is given and the goal is finding the optimal location of new facility respect to given criteria such as minimizing time, cost and distances between the clients and facilities. On the other side, the inverse models try to modify the parameters of the problem with the minimum cost such that a given point becomes optimal. In this paper, we introduce a novel algorithm for the general case of the inverse single facility location problem with variable weights in the plane. The convergence and optimality conditions of the algorithm are presented. Then in the special cases, the inverse minisum and minimax single facility location problems are considered and the algorithm tested on some instances. The results indicate the efficiency of the algorithm on these instances.Comment: 18 pages, 2 figures, 7 table

When centers can fail: a close second opportunity

This paper presents the p-next center problem, which aims to locate p out of n centers so as to minimize the maximum cost of allocating customers to backup centers. In this problem it is assumed that centers can fail and customers only realize that their closest (reference) center has failed upon arrival. When this happens, they move to their backup center, i.e., to the center that is closest to the reference center. Hence, minimizing the maximum travel distance from a customer to its backup center can be seen as an alternative approach to handle humanitarian logistics, that hedges customers against severe scenario deteriorations when a center fails. For this extension of the p-center problem we have developed several different integer programming formulations with their corresponding strengthenings based on valid inequalities and variable fixing. The suitability of these formulations for solving the p-next center problem using standard software is analyzed in a series of computational experiments. These experiments were carried out using instances taken from the previous discrete location literature.Peer ReviewedPostprint (author’s final draft

Datacenter Traffic Control: Understanding Techniques and Trade-offs

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial

Modeling Information System Availability by using Bayesian Belief Network Approach

Modern information systems are expected to be always-on by providing services to end-users, regardless of time and location. This is particularly important for organizations and industries where information systems support real-time operations and mission-critical applications that need to be available on 24 x 7 x 365 basis. Examples of such entities include process industries, telecommunications, healthcare, energy, banking, electronic commerce and a variety of cloud services. This article presents a modified Bayesian Belief Network model for predicting information system availability, introduced initially by Franke, U. and Johnson, P. (in article “Availability of enterprise IT systems – an expert based Bayesian model”. Software Quality Journal 20(2), 369-394, 2012) based on a thorough review of several dimensions of the information system availability, we proposed a modified set of determinants. The model is parameterized by using probability elicitation process with the participation of experts from the financial sector of Bosnia and Herzegovina. The model validation was performed using Monte Carlo simulation

Economic Analysis of Using Renewable Wind Power System at a Signalized Intersection

The transportation industry consumes about 28% of the total energy consumed by all sectors in the United States. This paper proposes a renewable wind power system (RWPS) as an alternative power source for signalized traffic intersections. The proposed system can be mounted onto the existing transportation infrastructure to provide reliable green electricity. Large-scale implementation of such a system has the potential to dramatically change the role of the public right-of-way system from an energy consumer to an energy producer, which will reduce the transportation system operating costs and promote the development of greener roadways. This paper provides a framework to investigate the physical and economic feasibility of installing the proposed RWPS. Methodologies to conduct structural analysis, site selection, and economic analysis are developed and presented. A test intersection in Lincoln, Nebraska, is used to demonstrate the application of evaluation procedures. The proposed RWPS has two benefits: i) the power generated by the system can support the existing traffic signals and any excess power produced can be sold back to the power grid, and ii) it also provides a source of backup power in case of grid failures, increasing the reliability of traffic operations. The paper presents the methodology to ascertain the economic benefits of an RWPS for both the cases described above. The costs and benefits of providing a RWPS are stated in terms of dollar values. The decision to install a RWPS at a specific site can thus be made using a benefit-to-cost ratio. The case study shows the RWPS is economically feasible at the subject intersection in Lincoln, Nebraska. The results also show that installing an RWPS at intersections with frequent power supply failures would result in higher benefit-to-cost ratios. In the event of budget constraints, the methodology developed in this paper can be used to prioritize the investments based on the benefit-to-cost ratios for the prospective sites