Planning and verification of multipath routing protocols

Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made.

Políticas de encaminamiento tolerantes a fallos

El uso intensivo y prolongado de computadores de altas prestaciones para ejecutar aplicaciones computacionalmente intensivas, sumado al elevado número de elementos que los componen, incrementan drásticamente la probabilidad de ocurrencia de fallos durante su funcionamiento. El objetivo del trabajo es resolver el problema de tolerancia a fallos para redes de interconexión de altas prestaciones, partiendo del diseño de polí­ticas de encaminamiento tolerantes a fallos. Buscamos resolver una determinada cantidad de fallos de enlaces y nodos, considerando sus factores de impacto y probabilidad de aparición. Para ello aprovechamos la redundancia de caminos de comunicación existentes, partiendo desde enfoques de encaminamiento adaptativos capaces de cumplir con las cuatro fases de la tolerancia a fallos: detección del error, contención del daño, recuperación del error, y tratamiento del fallo y continuidad del servicio. La experimentación muestra una degradación de prestaciones menor al 5%. En el futuro, se tratará la pérdida de información en tránsito.

Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

Heuristics and policies for online pickup and delivery problems

Master Thesis

Multipath inter-domain policy routing

Dissertação submetida para a obtenção do grau de Doutor em Engenharia Electrotécnica e de Computadores

Multipath policy routing in packet switched networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Um estudo das políticas públicas de lazer de Brotas/SP = : Brotas leisure public policies, São Paulo State

Universidade Estadual de Campinas . Faculdade de Educação Física

O setor privado sem fins lucrativos e as políticas públicas de esporte e lazer (2008-2011) = : The non-profitable private sector and the public policies for sport and leisure (2008-2011)

Universidade Estadual de Campinas . Faculdade de Educação Física

Oral Health in Brazil - Part I: public oral health policies

This paper reviews the historical development of public health policies in Brazil and the insertion of oral health in this context. Since 1988, Brazil established a Unified National Health System ("Sistema Único de Saúde" - SUS), which was conceived to assure access to health actions and services, including oral health. However, a history of lack of access to health services and the health problems faced by the Brazilian population make the process of building and consolidating the SUS extremely challenging. Since 2004, the Oral Health National Policy has proposed a reorientation of the health care model, supported by an adaptation of the working system of Oral Health teams so that they include actions of health promotion, protection and recovery. Human resources should be prepared to act in this system. The qualifying process must take in consideration knowledge evolution, changes in the work process and changes in demographical and epidemiological aspects, according to a perspective of maintaining a balance between technique and social relevance.

Do school based food and nutrition policies improve diet and reduce obesity?

OBJECTIVE: To review the effectiveness of school food and nutrition policies world wide in improving the school food environment, student's dietary intake, and decreasing overweight and obesity. METHODS: Systematic review of published and unpublished literature up to November 2007 of three categories of nutrition policy; nutrition guidelines, regulation of food and/or beverage availability, and price interventions applied in preschools, primary and secondary schools. RESULTS: 18 studies met the inclusion criteria. Most evidence of effectiveness was found for the impact of both nutrition guidelines and price interventions on intake and availability of food and drinks, with less conclusive research on product regulation. Despite the introduction of school food policies worldwide few large scale or national policies have been evaluated, and all included studies were from the USA and Europe. CONCLUSION: Some current school policies have been effective in improving the food environment and dietary intake in schools, but there is little evaluation of their impact on BMI. As schools have been proposed worldwide as a major setting for tackling childhood obesity it is essential that future policy evaluations measure the long term effectiveness of a range of school food policies in tackling both dietary intake and overweight and obesity.

ELECTRONIC GOVERNMENT POLICIES IN BRAZIL: CONTEXT, ICT MANAGEMENT AND OUTCOMES

The State Reform processes combined with the emergence and use of Information and Communication Technology (ICT) originated electronic government policies and initiatives in Brazil. This paper dwells on Brazilian e-government by investigating the institutional design it assumed in the state's public sphere, and how it contributed to outcomes related to e-gov possibilities. The analyses were carried out under an interpretativist perspective by making use of Institutional Theory. From the analyses of interviews with relevant actors in the public sphere, such as state secretaries and presidents of public ICT companies, conclusions point towards low institutionalization of e-gov policies. The institutional design of Brazilian e-gov limits the use of ICT to provide integrated public services, to amplify participation and transparency, and to improve public policies management.

Cost-effectiveness of Sick Leave Policies for Health Care Workers with Influenza-like Illness, Brazil, 2009

We describe the effect of influenza-like illness (ILI) during the outbreak of pandemic (H1N1) 2009 on health care worker (HCW) absenteeism and compare the effectiveness and cost of 2 sick leave policies for HCWs with suspected influenza. We assessed initial 2-day sick leaves plus reassessment until the HOW was asymptomatic (2-day + reassessment policy), and initial 7-day sick leaves (7-day policy). Sick leaves peaked in August 2009: 3% of the workforce received leave for ILI. Costs during May October reached R$798,051.87 (approximate to US $443,362). The 7-day policy led to a higher monthly rate of sick leave days per 100 HCWs than did the 2-day + reassessment policy (8.72 vs. 3.47 days/100 HCWs; p<0.0001) and resulted in higher costs (US $609 vs. US $1,128 per HCW on leave). ILI affected HCW absenteeism. The 7-day policy was more costly and not more effective in preventing transmission to patients than the 2-day + reassessment policy.

Hybrid Algorithms for Routing and Assignment Wavelengths in Optical Networks

This paper presents a strategy for the solution of the WDM optical networks planning. Specifically, the problem of Routing and Wavelength Allocation (RWA) in order to minimize the amount of wavelengths used. In this case, the problem is known as the Min-RWA. Two meta-heuristics (Tabu Search and Simulated Annealing) are applied to take solutions of good quality and high performance. The key point is the degradation of the maximum load on the virtual links in favor of minimization of number of wavelengths used; the objective is to find a good compromise between the metrics of virtual topology (load in Gb/s) and of the physical topology (quantity of wavelengths). The simulations suggest good results when compared to some existing in the literature.

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.