Peak Estimation of Time Delay Systems using Occupation Measures

This work proposes a method to compute the maximum value obtained by a state function along trajectories of a Delay Differential Equation (DDE). An example of this task is finding the maximum number of infected people in an epidemic model with a nonzero incubation period. The variables of this peak estimation problem include the stopping time and the original history (restricted to a class of admissible histories). The original nonconvex DDE peak estimation problem is approximated by an infinite-dimensional Linear Program (LP) in occupation measures, inspired by existing measure-based methods in peak estimation and optimal control. This LP is approximated from above by a sequence of Semidefinite Programs (SDPs) through the moment-Sum of Squares (SOS) hierarchy. Effectiveness of this scheme in providing peak estimates for DDEs is demonstrated with provided examplesComment: 34 pages, 14 figures, 3 table

Relieving the Wireless Infrastructure: When Opportunistic Networks Meet Guaranteed Delays

Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemination framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be reinjected into the network through the 3G interface. Push-and-Track includes multiple strategies to determine how many copies of the content should be injected, when, and to whom. The short delay-tolerance of common content, such as news or road traffic updates, make them suitable for such a system. Based on a realistic large-scale vehicular dataset from the city of Bologna composed of more than 10,000 vehicles, we demonstrate that Push-and-Track consistently meets its delivery objectives while reducing the use of the 3G network by over 90%.Comment: Accepted at IEEE WoWMoM 2011 conferenc

Vaccination against Foot-and-mouth disease : do initial conditions affect its benefit?

When facing incursion of a major livestock infectious disease, the decision to implement a vaccination programme is made at the national level. To make this decision, governments must consider whether the benefits of vaccination are sufficient to outweigh potential additional costs, including further trade restrictions that may be imposed due to the implementation of vaccination. However, little consensus exists on the factors triggering its implementation on the field. This work explores the effect of several triggers in the implementation of a reactive vaccination-to-live policy when facing epidemics of foot-and-mouth disease. In particular, we tested whether changes in the location of the incursion and the delay of implementation would affect the epidemiological benefit of such a policy in the context of Scotland. To reach this goal, we used a spatial, premises-based model that has been extensively used to investigate the effectiveness of mitigation procedures in Great Britain. The results show that the decision to vaccinate, or not, is not straightforward and strongly depends on the underlying local structure of the population-at-risk. With regards to disease incursion preparedness, simply identifying areas of highest population density may not capture all complexities that may influence the spread of disease as well as the benefit of implementing vaccination. However, if a decision to vaccinate is made, we show that delaying its implementation in the field may markedly reduce its benefit. This work provides guidelines to support policy makers in their decision to implement, or not, a vaccination-to-live policy when facing epidemics of infectious livestock disease

Timely Data Delivery in a Realistic Bus Network

Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach. I