Extensões na arquitetura SDN para o provisionamento de QoS através do monitoramento e uso de múltiplos caminhos

The substantial increase in the number of applications offered through the computer networks, as well as in the volume of traffic forwarded through the network, have hampered to assure adequate service level to users. The Quality of Service (QoS) offer, honoring specified parameters in Service Level Agreements (SLA), established between the service providers and their clients, composes a traditional and extensive computer networks’ research area. Several schemes proposals for the provision of QoS were presented in the last three decades, but the acting scope of these proposals is always limited due to some factors, including the limited development of the network hardware and software, generally belonging to a single manufacturer. The advent of Software Defined Networking (SDN), along with the maturation of its main materialization, the OpenFlow protocol, allowed the decoupling between network hardware and software, through an architecture which provides a control plane and a data plane. This eases the computer networks scenario, allowing that new abstractions are applied in the hardware composing the data plane, through the development of new software pieces which are executed in the control plane. This dissertation investigates the QoS offer through the use and extension of the SDN architecture. Based on the proposal of two new modules, one to perform the data plane monitoring, SDNMon, and the second, MP-ROUTING, developed to determine the use of multiple paths in the forwarding of data referring to a flow, we demonstrated in this work that some QoS metrics specified in the SLAs, such as bandwidth, can be honored. Both modules were implemented and evaluated through a prototype. The evaluation results referring to several aspects of both proposed modules are presented in this dissertation, showing the obtained accuracy of the monitoring module SDNMon and the QoS gains due to the utilization of multiple paths defined by the MP-Routing, when forwarding data flow through the SDN.

Tracer-based assessment of flow paths, storage and runoff generation in northern catchments : a review

Peer reviewed

An irregular lattice model to simulate crack paths in bonded granular assemblies

Peer reviewed

An irregular lattice model to simulate crack paths in bonded granular assemblies

Peer reviewed

Seismic scattering and absorption mapping of debris flows, feeding paths, and tectonic units at Mount St. Helens volcano

Acknowledgments We thank Edoardo Del Pezzo, Ludovic Margerin, Haruo Sato, Mare Yamamoto, Tatsuhiko Saito, Malcolm Hole, and Seth Moran for the valuable suggestions regarding the methodology and interpretation. Greg Waite provided the P wave velocity model of MSH. An important revision of the methods was done after two blind reviews performed before submission. The suggestions of two anonymous reviewers greatly enhanced our ability of imaging structures, interpreting our results, and testing their reliability. The facilities of the IRIS Data Management System, and specifically the IRIS Data Management Center, were used for access to waveform and metadata required in this study, and provided by the Cascades Volcano Observatory – USGS. Interaction with geologists and geographers part of the Landscape Dynamics Theme of the Scottish Alliance for Geoscience, Environment and Society (SAGES) has been important for the interpretation of the results.

Routing and dimensioning of 3G multi-service networks

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Routing and dimensioning of 3G multi-service networks

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Developmental Paths and Activities of Successful Sport Coaches

The purpose of this research report is to present an overview of an ongoing, international project designed to chart the developmental paths and activities of sport coaches. This brief report includes three sections: (a) conceptual framework used to guide the project, (b) project design and methodology, and (c) results from pilot studies with a sample of 15 successful coaches working in different sport contexts in the United States Unlike the findings for athletic profiles, where several trends across coaching contexts were evident, only one trend was found in how these diverse groups of coaches invested their time in coach developmental activities. In relation to other coaching activities very little time was devoted to formal coach education on an annual basis. The results reinforce the need to consider the coaching context when examining coach development and when designing coach development initiatives.

Identical Origins, Divergent Paths: Filial Responsibility Laws in Canada and the United States

This dissertation examines the origins of filial responsibility laws in Canada and the United States, laws which prescribe that adult children have an obligation of support which is owed to their parents. Filial responsibility laws enable an indigent parent, or an institution providing medical treatment and care to an indigent parent, to seek financial support from that parent’s adult children through the use of litigation. While those who favour these rarely-used laws claim that they bring many benefits to both the family and the state, there is little evidence to suggest that such benefits are actualized. The development and use of the laws in Canada and the United States make it clear that the limitation of the expenditure of government funds was the primary motive for these laws and the support of families a distant secondary motive.

A solution to the three disjoint path problem on honeycomb meshes

Recently honeycomb meshes have been considered as alternative candidates for interconnection networks in parallel and distributed computer systems. This paper presents a solution to one of the open problems about honeycomb meshes—the so-called three disjoint path problem. The problem requires minimizing the length of the longest of any three disjoint paths between 3-degree nodes. This solution provides information on the re-routing of traffic along the network in the presence of faults.

Clustering-based Query Routing in Cooperative Semi-structured Peer to Peer Networks

We consider the problem of resource selection in clustered Peer-to-Peer Information Retrieval (P2P IR) networks with cooperative peers. The clustered P2P IR framework presents a significant departure from general P2P IR architectures by employing clustering to ensure content coherence between resources at the resource selection layer, without disturbing document allocation. We propose that such a property could be leveraged in resource selection by adapting well-studied and popular inverted lists for centralized document retrieval. Accordingly, we propose the Inverted PeerCluster Index (IPI), an approach that adapts the inverted lists, in a straightforward manner, for resource selection in clustered P2P IR. IPI also encompasses a strikingly simple peer-specific scoring mechanism that exploits the said index for resource selection. Through an extensive empirical analysis on P2P IR testbeds, we establish that IPI competes well with the sophisticated state-of-the-art methods in virtually every parameter of interest for the resource selection task, in the context of clustered P2P IR.

Impact of node mobility in user-centric routing

Recent paradigms in wireless communication architectures describe environments where nodes present a highly dynamic behavior (e.g., User Centric Networks). In such environments, routing is still performed based on the regular packet-switched behavior of store-and-forward. Albeit sufficient to compute at least an adequate path between a source and a destination, such routing behavior cannot adequately sustain the highly nomadic lifestyle that Internet users are today experiencing. This thesis aims to analyse the impact of the nodes’ mobility on routing scenarios. It also aims at the development of forwarding concepts that help in message forwarding across graphs where nodes exhibit human mobility patterns, as is the case of most of the user-centric wireless networks today. The first part of the work involved the analysis of the mobility impact on routing, and we found that node mobility significance can affect routing performance, and it depends on the link length, distance, and mobility patterns of nodes. The study of current mobility parameters showed that they capture mobility partially. The routing protocol robustness to node mobility depends on the routing metric sensitivity to node mobility. As such, mobility-aware routing metrics were devised to increase routing robustness to node mobility. Two categories of routing metrics proposed are the time-based and spatial correlation-based. For the validation of the metrics, several mobility models were used, which include the ones that mimic human mobility patterns. The metrics were implemented using the Network Simulator tool using two widely used multi-hop routing protocols of Optimized Link State Routing (OLSR) and Ad hoc On Demand Distance Vector (AODV). Using the proposed metrics, we reduced the path re-computation frequency compared to the benchmark metric. This means that more stable nodes were used to route data. The time-based routing metrics generally performed well across the different node mobility scenarios used. We also noted a variation on the performance of the metrics, including the benchmark metric, under different mobility models, due to the differences in the node mobility governing rules of the models.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.

Paths to peace: conflict management trajectories in militarized interstate disputes

When multiple third-parties (states, coalitions, and international organizations) intervene in the same conflict, do their efforts inform one another? Anecdotal evidence suggests such a possibility, but research to date has not attempted to model this interdependence directly. The current project breaks with that tradition. In particular, it proposes three competing explanations of how previous intervention efforts affect current intervention decisions: a cost model (and a variant on it, a limited commitments model), a learning model, and a random model. After using a series of Markov transition (regime-switching) models to evaluate conflict management behavior within militarized interstate disputes in the 1946-2001 period, this study concludes that third-party intervention efforts inform one another. More specifically, third-parties examine previous efforts and balance their desire to manage conflict with their need to minimize intervention costs (the cost and limited commitments models). As a result, third-parties intervene regularly using verbal pleas and mediation, but rely significantly less frequently on legal, administrative, or peace operations strategies. This empirical threshold to the intervention costs that third-parties are willing to bear has strong theoretical foundations and holds across different time periods and third-party actors. Furthermore, the analysis indicates that the first third-party to intervene in a conflict is most likely to use a strategy designed to help the disputants work toward a resolution of their dispute. After this initial intervention, the level of third-party involvement declines and often devolves into a series of verbal pleas for peace. Such findings cumulatively suggest that disputants hold the key to effective conflict management. If the disputants adopt and maintain an extreme bargaining position or fail to encourage third-parties to accept greater intervention costs, their dispute will receive little more than verbal pleas for negotiations and peace.