Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-10-02T15:13:41Z No. of bitstreams: 1 AMARO MONTEIRO DE CARVALHO FILHO - DISSERTAÇÃO PPGECA 1976..pdf: 10529018 bytes, checksum: 417ae607a1e27be1c792cbe8edbf9cc2 (MD5) / Made available in DSpace on 2018-10-02T15:13:41Z (GMT). No. of bitstreams: 1 AMARO MONTEIRO DE CARVALHO FILHO - DISSERTAÇÃO PPGECA 1976..pdf: 10529018 bytes, checksum: 417ae607a1e27be1c792cbe8edbf9cc2 (MD5) Previous issue date: 1976-11 / Neste estudo, sistemas de mão única são discutidos, do ponto de vista da capacidade da rede viária. A capacidade da rede viária é definida como o número máximo de veículos que pode viajar facilmente, sem congestionamentos grandes e sem paradas significativas. Isso pode ser determinado pela aplicação do método da Divisão de Alocação de Tráfego, no qual o total de viagens 0D é incrementado pouco a pouco, mantendo-se o padrão 0D constante. Através desse estudo, pode-se concluir que é consideravelmente difícil encontrar-se um bom sistema de mão única, possível de aumentar a capacidade da rede viária. / In this study, one-way sistems are discassed from viewpoint of road network capacity. The road network capacity is definid as the maximum number of vehicles that can travel smoothley withoat heavy congestion and unreasonable stoppings. This can be determined by application of Division Method of traffic assignment in which the total 0D trips are increased litteby little keeping the constant 0D pattern. Through this study it can be conclud that it is considerable difficult to find a good one-way system possible to increase the road network capacity.

Doctoral thesis deals about primary and secondary energy legislation of the Czech Republic and proposes supplement to the legislation for renewable sources of energy. The thesis contents proposal of methodology of determination of available network capacity for connecting of new renewable sources. It analyzes current state of Czech electric power system and its possibilities for integrating new sources. It also determined available network capacity for connecting of new renewable sources in various regions of Czech Republic according to actual trend of renewable sources development. Next part of the thesis simulates impact of volatile large production of wind power plants in northern Germany in near future (year 2015). The thesis also contents proposal to the Czech power system reinforcements to eliminate negative impacts of loops flows.

The subject of this dissertation is the assessment and optimization of water distribution in the group water supply. The water supply networks are located in the Water Association of Babicko, former district of Uherské Hradiště, region of Zlín. The objective of this work is the unification of the entire documentation for all projects, creation of a hydraulic model of water supply network and subsequent verification of the existing capacities and pressure ratios. This work is particularly focused on the evaluation of pressure ratios at the highest and the lowest points of villages, whether they correspond to the legal limits, and subsequent design of a possible division to pressure zones.

Cette thèse a pour but d’étudier les activités humaines à travers l’analyse du flux de signalisation du réseau cellulaire de données (GTP). Pour ce faire, nous avons mis en place un ensemble d’outils nous permettant de collecter, stocker et analyser ces données de signalisation. Ceci en se basant sur une architecture indépendante au maximum des constructeurs de matériel. À partir des données extraites par cette plateforme nous avons fait trois contributions.Dans une première contribution, nous présentons l’architecture de la plateforme de capture et d’analyse de la signalisation GTP dans un réseau d’opérateur. Ce travail a pour but de faire l’inventaire des différents éléments déclenchant des mises à jour et aussi d’estimer la précision temporelle et spatiale des données collectées. Ensuite, nous présentons une série de mesures, mettant en avant les caractéristiques principales de la mobilité humaine observées au travers de la signalisation mobile (le temps inter-arrivées des messages de mise à jour, la distance observée des sauts entre cellules lors des déplacements des clients). Finalement, nous présentons l’analyse des compromis qui ont été faits entre la rapidité d’écriture/de lecture et la facilité d’usage du format de fichier utilisé lors de l’échange d’informations entre les sondes de capture et le système stockage. Deuxièmement, nous avons été capables de mettre en place un algorithme de reconstitution de trajets. Cet algorithme permet, à partir de données éparses issues du réseau cellulaire, de forger des trajets sur les voies de transport. Il se base sur les données des trajets sous-échantillonnées et en déduit les positions du client sur les voies de communication. Nous avons mis en place un graphe de transport intermodal. Celui-ci porte sur le métro, le train et le réseau routier. Il connecte les différents points entre eux dans chacune des couches de transport et interconnecte les modes de transport entre eux, aux intersections. Notre algorithme se base sur un modèle de chaîne de Markov cachée pour placer sur le graphe les positions probables des individus entre les différentes observations. L’apport de ce travail est l’utilisation des propriétés topologiques du réseau de transport afin de renseigner les probabilités d’émission et de transition dans un modèle non supervisé. Ces travaux ont donné lieu à une publication et à un brevet. Finalement, notre dernière contribution utilise les données issues de la signalisation à des fins de dimensionnement du réseau mobile d’opérateur. Il s’agit de dimensionner dynamiquement un réseau mobile en utilisant les bandes de fréquences dites vTV-Whitespace. Ces bandes de fréquences sont libérées sous certaines conditions aux USA et soumises à vente aux enchères. Ce que nous proposons est un système basé sur un algorithme de qualité d’expérience (QoE) et sur le coût de la ressource radio afin de choisir où déployer des femtocells supplémentaires et où en supprimer en fonction des variations de population par unité d’espace. En conclusion, cette thèse offre un aperçu du potentiel de l’analyse des metadata de signalisation d’un réseau dans un contexte plus général que la simple supervision d’un réseau d’opérateur / The aim of this thesis is to study human activities through the analysis of the signaling flow in cellular data network (GTP). In order to achieve this goal, we implemented a set of tools allowing us to collect, store and analyze this signaling data. We created an architecture independent at most of hardware manufacturers and network operators. Using data extracted by this platform we made three main contributions. In our first contribution, we present the GTP capture and analysis platform in a mobile operator network. This work intends to list the different elements triggering updates and to estimate the temporal and spatial accuracy of the data collected. Next, we present a set of measures that represent the main characteristics of human mobility observed through the mobile signaling data (the inter-arrival time of update messages, the observed distances of hops from cell to cell made by moving users). Finally, we present the analysis of the compromise that was made between the writing/reading performances and the ease of use of the file format for the data storage. In our second contribution, we propose CT-Mapper, an unsupervised algorithm that enables the mapping of mobile phone traces over a multimodal transport network. One of the main strengths of CT-Mapper is its capability to map noisy sparse cellular multimodal trajectories over a multilayer transportation network where the layers have different physical properties and not only to map trajectories associated with a single layer. Such a network is modeled by a large multilayer graph in which the nodes correspond to metro/train stations or road intersections and edges correspond to connections between them. The mapping problem is modeled by an unsupervised HMM where the observations correspond to sparse user mobile trajectories and the hidden states to the multilayer graph nodes. The HMM is unsupervised as the transition and emission probabilities are inferred using respectively the physical transportation properties and the information on the spatial coverage of antenna base stations. Finally, in our last contribution we propose a method for cellular resource planning taking into account user mobility. Since users move, the bandwidth resource should move accordingly. We design a score based method using TV Whitespace, and user experience, to determine from which cell resource should be removed and to which one it should be added. Combined with traffic history it calculates scores for each cell. Bandwidth is reallocated on a half-day basis. Before that, real traces of cellular networks in urban districts are presented which confirm that static network planning is no longer optimal. A dynamic femtocell architecture is then presented. It is based on mesh interconnected elements and designed to serve the score based bandwidth allocation algorithm. The score method along with the architecture are simulated and results are presented. They confirm the expected improvement in bandwidth and delay per user while maintaining a low operation cost at the operator side. In conclusion, this thesis provides an overview of the potential of analyzing the signaling metadata of a network in a broader context that supervision of an operator network

A region's evacuation strategy encompasses a variety of areas and needs. Primary among these is the minimization of total evacuation time, represented in models as the clearance time estimate (CTE). A generic testbed simulation network model was developed. An input/output (I/O) analysis was performed to establish a theoretical baseline CTE. Results were compared with simulations; analysis showed that the I/O method underestimated simulated CTE as a function of network size, with a correction factor range of 1.09 to 1.19. A regression model was developed for the generic network. Predictors were total trips, and network size defined as a function of origin-destination distance. Total Trips ranged between 40,000 and 60,000. Holding size constant, R-squared values ranged from 97.1 to 99.3, indicating a high goodness of fit. Holding Total Trips constant, R-squared values ranged from 74.5 to 89.2. Finally, both Total Trips and size were used as predictors; the resulting regression model had an R-squared value of 97.3. This overall model is more useful, since real world situations are not fixed in nature. The overall regression model was compared to a case network. The generic network regression model provided a close CTE approximation; deltas ranged from -4.7% to 8.6%. It was concluded that a generic network can serve as a surrogate for a case network over these ranges. This study developed and evaluated heuristic strategies for evacuation using the generic network. Strategies were compared with a simultaneous departure loading scenario. Six different grouping strategies were evaluated. An initial evaluation was conducted using the generic network, and strategies that showed potential CTE reduction were implemented on the case study network. Analysis indicated that the HF-10 (half-far) grouping for 60k total trips showed potential reduction. A complete simulation was conducted on the case network for all HF scenarios; an ANOVA was run using Dunnett's comparison. Results indicated that the HF grouping with 20% and 30% departure shifts showed potential for CTE reduction. From this it was concluded that the generic network could be used as a testbed for strategies that would show success on a case network.

As the Internet continues to evolve, without providing any performance guarantees or explicit feedback to applications, the only way to infer the state of the network and to dynamically react to congestion is through end-to-end measurements. The emph{available bandwidth} (avail-bw) is an important metric that characterizes the dynamic state of a network path. Its measurement has been the focus of significant research during the last 15 years. However, its estimation remained elusive for several reasons. The main contribution of this thesis is the development of the first estimation methodology for the avail-bw in a network path using end-to-end measurements. In more detail, our first contribution is an end-to-end methodology, called SLoPS, to determine whether the avail-bw is larger than a given rate based on the sequence of one-way delays experienced by a periodic packet stream. The second contribution is the design of two algorithms, based on SLoPS, to estimate the mean and the variation range, respectively, of the avail-bw process. These algorithms have been implemented in two measurement tools, referred to as PathLoad and PathVar. We have validated the accuracy of the tools using analysis, simulation, and extensive experimentation. Pathload has been downloaded by more than 6000 users since 2003. We have also used PathVar to study the variability of the avail-bw process as a function of various important factors, including traffic load and degree of multiplexing. Finally, we present an application of avail-bw estimation in video streaming. Specifically, we show that avail-bw measurements can be used in the dynamic selection of the best possible overlay path. The proposed scheme results in better perceived video quality than path selection algorithms that rely on jitter or loss-rate measurements.

Submitted by Rafael Santana (rafael.silvasantana@ufpe.br) on 2017-08-30T18:33:02Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Diego_Cananea_Dissertacao_Mestrado_CIn_UFPE.pdf: 981557 bytes, checksum: ea7555320bfcb0316c7f0fa816288cef (MD5) / Made available in DSpace on 2017-08-30T18:33:02Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Diego_Cananea_Dissertacao_Mestrado_CIn_UFPE.pdf: 981557 bytes, checksum: ea7555320bfcb0316c7f0fa816288cef (MD5) Previous issue date: 2016-09-08 / A estimação da capacidade e da banda disponível em redes têm sido objeto de diversas pesquisas nos últimos anos, principalmente por causa da evolução das tecnologias e crescimento do uso da Internet. Tais técnicas são de grande importância para que seja possível fazer um melhor aproveitamento da transmissão dos dados, evitando tanto a subutilização quanto o esgotamento de recursos. Existem inúmeros usos para as técnicas de estimação de banda, dentre as quais podemos citar streaming multimídia, aplicações peer-to-peer, protocolos de roteamento baseados na banda disponível, qualidade de serviço, protocolos de transporte fim a fim, entre outros. Com o interesse cada vez maior nestes tipos de aplicações, principalmente na transmissão de vídeo e áudio, a estimação de banda tem sido de bastante interesse para pesquisadores. A estimação de banda disponível em redes sem fio por si só já é um desafio para os pesquisadores e o novo padrão IEEE 802.11n trouxe novos mecanismos para otimizar a transmissão dos dados, alcançando assim maiores taxas. Porém, tais fatores contribuem para que as técnicas hoje existentes encontrem problemas ao tentarem estimar a banda disponível, causando assim resultados que deixam a desejar. Esta pesquisa demonstra experimentalmente a influência dos novos fatores adicionados pelo novo padrão, como a agregação de quadros e de canais, em técnicas ativas de estimação de banda disponível. É possível verificar, então, que todas tem sua acurácia diminuída, causando erros de estimações. Verificamos que mesmo no cenário mais simples, onde os novos fatores são desativados, boa parte dos métodos analisados obtiveram uma performance aquém do esperado, corroborando com a afirmação de que o ambiente de redes sem fio é um grande desafio para o desenvolvimento deste tipo de técnica. A técnica de estimação YAZ se mostrou mais robusta que as demais, aproximando-se dos valores de referência em quase todos os cenários propostos, com exceção para a agregação de quadros. Em uma análise mais específica de seu algoritmo, podemos demonstrar o porquê do erro no resultado da estimação de banda disponível neste contexto. / The estimation of capacity and available bandwidth in computer networks have been the subject of several studies in recent years, mainly because of changing technologies and increasing use of the Internet. Such techniques are of great importance to be able to make better use of data transmission, avoiding both underuse as resource depletion. There are numerous uses for bandwidth estimation techniques, among which we can mention textit stream multimedia applications textit peer-to-peer, routing protocols based on available bandwidth, quality of service, end to end transport protocols, among others. With the growing interest in these types of applications, especially in video and audio transmission, bandwidth estimation has been of great interest to researchers. The estimation of available bandwidth in wireless networks is itself a challenge for researchers and the new IEEE 802.11n standard has brought new mechanisms to optimize the transmission of data, thus achieving higher rates. However, these factors contribute to that existing techniques encounter problems when trying to estimate the available bandwidth, thus causing results that fall short. This research experimentally demonstrates the influence of new factors added by the new standard, such as frame aggregation and channels in active techniques for available bandwidth estimation. It’s possible see, then, that all has its diminished accuracy, causing estimation errors. We found that even in the simplest scenario, where new factors are disabled, most of the methods discussed perform so below expectations, supporting the claim that the wireless network environment is a major challenge for the development of this type of technique . The YAZ estimation technique was more robust than the others, approaching the reference values in almost all proposed scenarios, except for the frame aggregation. In a more specific analysis of their algorithm, we can demonstrate why the error in the result of the available bandwidth estimation occurs in this context.

Le transport fluvial de conteneurs constitue une activité économique importante qui suscite un intérêt grandissant de la part de scientifiques. Considéré comme durable et économique, le transport par barge a été identifié comme étant une alternative compétitive pour le transport de marchandises, en complément des modes traditionnels de transport, routier et ferroviaire. Néanmoins, les travaux de recherche en rapport avec la planification et le management du transport par barge, en particulier dans le contexte du transport intermodal, sont encore peu abondants. Le but de cette thèse est d’apporter une contribution dans ce domaine, par la proposition de modèles et de méthodes de planification et gestion avancées, dans le cadre d’un système d’aide à la décision pour le transport de conteneurs par barge développé pour accompagner les opérateurs de transport. La méthodologie proposée fait appel à des concepts et principes de gestion du revenu, des ressources et des services de transport pour la conception de plans de services réguliers avec horaires, au niveau tactique. Les opérateurs de transport peuvent ainsi offrir des plans de transport avec des services plus flexibles pour leurs clients, tout en assurant un meilleur niveau de fiabilité. Plus de demandes de transport pourront ainsi être satisfaites, avec globalement une plus grande satisfaction des chargeurs. Une originalité importante proposée par notre approche est l’utilisation de principes et techniques de gestion du revenu (segmentation du marché, classes tarifaires...) aussi bien au niveau opérationnel de la modélisation qu’au niveau tactique. Les problèmes d’optimisation sont formalisés sous forme de modèles de programmation linéaire mixte en nombres entiers (PLNE), implémentés et testés sous différentes configurations de réseaux de transport et différents scénarios de demandes, et ce pour chaque niveau de décision. Au niveau tactique, une nouvelle approche de résolution, combinant la recherche adaptative à voisinage large (ALNS) et la recherche taboue, est proposée pour résoudre des problèmes PLNE de grande taille. Une plateforme de simulation, qui intègre les niveaux tactique et opérationnel de prise de décision, est proposée pour la validation du système d’aide à la décision sous différentes configurations : différentes topologies du réseau physique, différents paramètres pour la gestion du revenu, différents degrés de précision caractérisant les prévisions de demande. Pour l’analyse des résultats numériques ainsi obtenus, plusieurs types d’indicateurs de performance sont proposés et utilisés. / Barge transportation is an important research topic that started to draw increasing scientific attention in the recent decade. Considered as sustainable, environment-friendly and economical, barge transportation has been identified as a competitive alternative for freight transportation, complementing the traditional road and rail modes. However, contributions related to barge transportation, especially in the context of intermodal transportation, are still scarce. The objective of this thesis is to contribute to fill this gap by proposing a reactive decision support system for freight intermodal barge transportation from the perspective of the carriers. The proposed system incorporates resource and revenue management concepts and principles to build the optimal set of scheduled services plans at the tactical level. Carriers may thus benefit from transportation plans offering increased flexibility and reliability. They could thus serve more demands and better satisfy customers. One novelty of the approach is the application of revenue management considerations (e.g., market segmentation and price differentiation) at both operational and tactical planning levels. The optimization problems are mathematically formalized and mixed integer linear programming (MILP) models are proposed, implemented and tested against various network settings and demand scenarios, for each decision level. At the tactical level, a new solution approach, combining adaptive large neighborhood search (ALNS) and Tabu search is designed to solve large scale MILP problems. An integrated simulation framework, including the tactical and the operational levels jointly, is proposed to validate the decision support system in different settings, in terms of physical network topology, revenue management parameters and accuracy degree of demand forecasts. To analyze the numerical results corresponding to the solutions of the optimization problems, several categories of performance indicators are proposed and used.