O objetivo dessa dissertação é apresentar um problema de otimização do uso de recursos críticos no desenvolvimento de poços de petróleo marítimos e a técnica empregada para a abordagem proposta ao problema. A revisão da técnica de Programação por Restrições é feita analisando aspectos relevantes de modelagem, propagação, busca e paradigmas de programação. A especialização da técnica para problemas de escalonamento, o Escalonamento Baseado em Restrições, é descrita com ênfase nos paradigmas descritivos e nos mecanismos de propagação de restrições. Como subsídio ao uso da técnica em outros problemas, a linguagem comercial de modelagem OPL é apresentada no Apêndice. O objetivo da abordagem ao problema é obter um escalonador para maximizar a produção de óleo obtida no curto prazo. O escalonador proposto baseia-se na declaração de um modelo empregando variáveis de intervalo. Um algoritmo e um modelo de Programação Linear Inteira abordando relaxações do problema são apresentados para que se obtenha um limitante superior ao valor de produção ótimo. Para o cenário real no qual a análise experimental foi feita, foram obtidas soluções a menos de 16% do ótimo após uma hora de execução; e os testes em instâncias de tamanhos variados evidenciaram a robustez do escalonador. Direções para trabalhos futuros são apresentadas ponderando os resultados obtidos. / The aim of this work is to present a problem of optimizing the use of critical resources to develop offshore oil wells and the technique used to approach the problem. The review of the Constraint Programming technique is made by analyzing relevant aspects of modeling, propagation, search and programming paradigms. The specialization of the technique to scheduling problems, known as Constraint-Based Scheduling, is described with emphasis on descriptive paradigms and constraint propagation mechanisms. In order to support the use of the technique to tackle other problems, the commercial modeling language OPL is presented in the appendix. The aim of the approach to the problem is to obtain a scheduler that maximizes the short-term production of oil. The scheduler presented relies on the description of a model using interval variables. An algorithm and an Integer Linear Programming model approaching relaxations of the problem are presented in order to obtain an upper bound for the optimal production value. For the real scenario upon which the experimental analysis was done, there were found solutions within 16% of the optimal after one hour of execution; and the tests on instances of varied sizes gave evidence of the robustness of the scheduler. Directions for future work are presented based on the results achieved.

Le cadre général de cette thèse est la question de la relation génotype-phénotype, abordée à travers l'analyse du phénomène d'hétérosis chez la levure, dans une approche associant biologie, mathématiques et statistiques. Antérieurement à ce travail, un très gros jeu de données hétérogènes, correspondant à différents niveaux d'organisation (protéomique, caractères de fermentation et traits d'histoire de vie), avait été recueilli sur un dispositif demi-diallèle entre 11 souches appartenant à deux espèces. Ce type de données est idéalement adapté pour la modélisation multi-échelle et pour tester des modèles de prédiction de la variation de phénotypes intégrés à partir de caractères protéiques et métaboliques (flux), tout en tenant compte des structures de dépendance entre variables et entre observations. J’ai d'abord décomposé, pour chaque caractère, la variance génétique totale en variances des effets additifs, de consanguinité et d'hétérosis, et j’ai montré que la distribution de ces composantes permettait de définir des groupes bien tranchés de protéines dans lesquels se plaçaient la plupart des caractères de fermentation et de traits d'histoire de vie. Au sein de ces groupes, les corrélations entre les variances des effets d'hétérosis et de consanguinité pouvaient être positives, négatives ou nulles, ce qui a constitué la première mise en évidence expérimentale d’un découplage possible entre les deux phénomènes. Le second volet de la thèse a consisté à interfacer les données de protéomique quantitative avec un modèle stœchiométrique du métabolisme carboné central de la levure, en utilisant une approche de modélisation à base de contraintes. M'appuyant sur un algorithme récent, j’ai cherché, dans l'espace des solutions possibles, celle qui minimisait la distance entre le vecteur de flux et le vecteur des abondances observées des protéines. J’ai ainsi pu prédire un ensemble de flux et comparer les patrons de corrélations entre caractères à plusieurs niveaux d'intégration. Les données révèlent deux grandes familles de caractères de fermentation ou de traits d'histoire de vie dont l'interprétation biochimique est cohérente en termes de trade-off, et qui n'avaient pas été mises en évidence à partir des seules données de protéomique quantitative. L'ensemble de mes travaux permet de mieux comprendre l'évolution de la relation entre génotype et phénotype. / The general framework of this thesis is the issue of the genotype-phenotype relationship, through the analysis of the heterosis phenomenon in yeast, in an approach combining biology, mathematics and statistics. Prior to this work, a very large set of heterogeneous data, corresponding to different levels of organization (proteomics, fermentation and life history traits), had been collected on a semi-diallel design involving 11 strains belonging to two species. This type of data is ideally suited for multi-scale modelling and for testing models for predicting the variation of integrated phenotypes from protein and metabolic (flux) traits, taking into account dependence patterns between variables and between observations. I first decomposed, for each trait, the total genetic variance into variances of additive, inbreeding and heterosis effects, and showed that the distribution of these components made it possible to define well-defined groups of proteins in which most of the characters of fermentation and life history traits took place. Within these groups, the correlations between the variances of heterosis and inbreeding effects could be positive, negative or null, which was the first experimental demonstration of a possible decoupling between the two phenomena. The second part of the thesis consisted of interfacing quantitative proteomic data with the yeast genome-scale metabolic model using a constraint-based modelling approach. Using a recent algorithm, I looked, in the space of possible solutions, for the one that minimized the distance between the flux vector and the vector of the observed abundances of proteins. I was able to predict unobserved fluxes, and to compare correlation patterns at different integration levels. Data allowed to distinguish between two major types of fermentation or life history traits whose biochemical interpretation is consistent in terms of trade-off, and which had not been highlighted from quantitative proteomic data alone. Altogether, my thesis work allows a better understanding of the evolution of the genotype-phenotype map.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第21395号 / 情博第681号 / 新制||情||117(附属図書館) / 京都大学大学院情報学研究科社会情報学専攻 / (主査)教授 石田 亨, 教授 吉川 正俊, 教授 河原 達也 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

Mycoplasma pneumoniae, einer der kleinsten lebenden Organismen, ist ein erfolgversprechender Modellorganismus der Systembiologie um eine komplette lebende Zelle zu verstehen. Wichtig dahingehend ist die Konstruktion mathematischer Modelle, die zelluläre Prozesse beschreiben, indem sie beteiligte Komponenten vernetzen und zugrundeliegende Mechanismen entschlüsseln. Für Mycoplasma pneumoniae wurden genomweite Datensätze für Genomics, Transcriptomics, Proteomics und Metabolomics produziert. Allerdings fehlten ein effizientes Informationsaustauschsystem und mathematische Modelle zur Datenintegration. Zudem waren verschiedene Beobachtungen im metabolischen Verhalten ungeklärt. Diese Dissertation präsentiert einen kombinatorischen Ansatz zur Entwicklung eines metabolischen Modells für Mycoplasma pneumoniae. Zuerst haben wir eine Datenbank, MyMpn, entwickelt, um Zugang zu strukturierten, organisierten Daten zu schaffen. Danach haben wir ein genomweites, Constraint-basiertes metabolisches Modell mit Vorhersagekapazitäten konstruiert und parallel dazu das Metabolome experimentell charakterisiert. Wir haben die Biomasse einer Mycoplasma pneumoniae Zelle definiert, das Netzwerk korrigiert, gezeigt, dass ein Grossteil der produzierten Energie auf zelluläre Homeostase verwendet wird, und das Verhalten unter verschiedenen Wachstumsbedingungen analysiert. Schließlich haben wir manuell das Genom reannotiert. Die Datenbank, obwohl noch nicht öffentlich zugänglich, wird bereits intern für die Analyse experimenteller Daten und die Modellierung genutzt. Die Entdeckung von Kontrollprinzipien des Energiemetabolismus und der Anpassungsfähigkeiten bei Genausfall heben den Einfluss der reduktiven Genomevolution hervor und erleichtert die Entwicklung von Manipulationstechniken und dynamischen Modellen. Überdies haben wir gezeigt, dass die Genomorganisation in Mycoplasma pneumoniae komplexer ist als bisher für möglich gehalten, und 32 neue, noch nicht annotierte Gene entdeckt. / Mycoplasma pneumoniae, one of the smallest known self-replicating organisms, is a promising model organism in systems biology when aiming to assess understanding of an entire living cell. One key step towards this goal is the design of mathematical models that describe cellular processes by connecting the involved components to unravel underlying mechanisms. For Mycoplasma pneumoniae, a wealth of genome-wide datasets on genomics, transcriptomics, proteomics, and metabolism had been produced. However, a proper system facilitating information exchange and mathematical models to integrate the different datasets were lacking. Also, different in vivo observations of metabolic behavior remained unexplained. This thesis presents a combinatorial approach to design a metabolic model for Mycoplasma pneumoniae. First, we developed a database, MyMpn, in order to provide access to structured and organized data. Second, we built a predictive, genome-scale, constraint-based metabolic model and, in parallel, we explored the metabolome in vivo. We defined the biomass composition of a Mycoplasma pneumoniae cell, corrected the wiring diagram, showed that a large proportion of energy is dedicated to cellular homeostasis, and analyzed the metabolic behavior under different growth conditions. Finally, we manually re-annotated the genome of Mycoplasma pneumoniae. The database, despite not yet being released to the public, is internally already used for data analysis, and for mathematical modeling. Unraveling the principles governing energy metabolism and adaptive capabilities upon gene deletion highlight the impact of the reductive genome evolution and facilitates the development of engineering tools and dynamic models for metabolic sub-systems. Furthermore, we revealed that the degree of complexity in which the genome of Mycoplasma pneumoniae is organized far exceeds what has been considered possible so far and we identified 32 new, previously not annotated genes.

This dissertation introduces Pikse, a novel methodology for more effective and efficient checking of code conformance to specifications using parallel and incremental techniques, describes a prototype implementation that embodies the methodology, and presents experiments that demonstrate its efficacy. Pikse has at its foundation a well-studied approach -- systematic constraint-driven analysis -- that has two common forms: (1) constraint-based testing -- where logical constraints that define desired inputs and expected program behavior are used for test input generation and correctness checking, say to perform black-box testing; and (2) symbolic execution -- where a systematic exploration of (bounded) program paths using symbolic input values is used to check properties of program behavior, say to perform white-box testing. Our insight at the heart of Pikse is that for certain path-based analyses, (1) the state of a run of the analysis can be encoded compactly, which provides a basis for parallel techniques that have low communication overhead; and (2) iterations performed by the analysis have commonalities, which provides the basis for incremental techniques that re-use results of computations common to successive iterations. We embody our insight into a suite of parallel and incremental techniques that enable more effective and efficient constraint-driven analysis. Moreover, our techniques work in tandem, for example, for combined black-box constraint-based input generation with white-box symbolic execution. We present a series of experiments to evaluate our techniques. Experimental results show Pikse enables significant speedups over previous state-of-the-art. / text

Pattern discovery in large binary relations has been extensively studied. An emblematic success in this area concerns frequent itemset mining and its post-processing that derives association rules. In this case, we mine binary relations that encode whether some properties are satisfied or not by some objects. It is however clear that many datasets correspond to n-ary relations where n > 2. For example, adding spatial and/or temporal dimensions (location and/or time when the properties are satisfied by the objects) leads to the 4-ary relation Objects x Properties x Places x Times. Therefore, we study the generalization of association rule mining within arbitrary n-ary relations: the datasets are now Boolean tensors and not only Boolean matrices. Unlike standard rules that involve subsets of only one domain of the relation, in our setting, the head and the body of a rule can include arbitrary subsets of some selected domains. A significant contribution of this thesis concerns the design of interestingness measures for such generalized rules: besides a frequency measures, two different views on rule confidence are considered. The concept of non-redundant rules and the efficient extraction of the non-redundant rules satisfying the minimal frequency and minimal confidence constraints are also studied. To increase the subjective interestingness of rules, we then introduce disjunctions in their heads. It requires to redefine the interestingness measures again and to revisit the redundancy issues. Finally, we apply our new rule discovery techniques to dynamic relational graph analysis. Such graphs can be encoded into n-ary relations (n ≥ 3). Our use case concerns bicycle renting in the Vélo'v system (self-service bicycle renting in Lyon). It illustrates the added-value of some rules that can be computed thanks to our software prototypes.

The frequent pattern mining in data represented by more complex structures like trees and graphs are growing lately. Among the reasons for this improvement is the fact that the tree and graph patterns has more information than sequential patterns, besides there is the possibility of usage of this type of mining in several areas like XML Mining,Web Mining and Bioinformatic. A problem that occurs in mining patterns in general is the great amount of patterns generated. Being some of them not interesting for users. The decrease in the quantity of patterns generated can be done restricting the patterns types produced through the user constraint. Even incorporating constraints in the mining process, the quantity of tree pattern mined is large, what make necessary one tool for pattern analysis, possibiliting the user specify queries to extract in the mass of mined patterns that satisfy the criteria of the selection in the query. The pattern mining with constraint, aim to obtain as a result of the process of mining only the patterns with the real interest for the user. The constraint about patterns will be represented related to the structure of them. One form to represent the sequential pattern mining would be through regular expressions, for the tree pattern mining, the tree automata. The use of constraints solve the problem to generate a large amout of patterns, but the mechanism used to represent the constraint is still constituted in another problem that would be the difficult for a user do the input of constraint using this mechanism. The queries about frequent patterns are made according to the characteristics of the data. One way to extract specific patterns in data structured like trees is to store the specific patterns in a XML file and make queries using one of the query languages for XML files. Among the XML query languages, the XQuery language is very used, mainly by the fact that it s similar in semantic to SQL, the query language for databases. The frequently patterns queries could be made using this language, but, for this the user would have to know and be capable to express queries through it. In this research it will be presented the visual language VisTree that consists of visual tool to be used in a phase of preprocess for specification the user preferences that involves the format of the tree pattern that are interested to him, as in a phase of postprocess to analyze the mined patterns. The VisTree sintaxe is based on in a fragment of the Tree Pattern language[Chen et al. 2003, Che and Liu 2005], the core of XPath 1.0 [Clark and Derose 1999, Olteanu et al. 2002]. However, the semantic of VisTree differs from the semantic of these languages in the sense that VisTree queries return the sets of tree patterns. VisTree uses a XQuery language [Chamberlin 2003, Katz et al. 2003] like query process mechanism: the visual queries specified in VisTree are mapped in XQuery queries and theirs responses are adapted to fit the format returned by VisTree. VisTree works like a XQuery front-end. A complete system of mining tree pattern was developed to test and validate the use of VisTree language in specific contexts of applications. The system was made in a modular form, in a way to allow that new applications could be incorporated in a simple way. This research show the application of tree mining with constraint in the areas of XML Mining andWeb Mining through study case. In both applications, the system use the VisTree language in the preprocess modules (constraint input) and analysis of patterns (query input). / A mineração de padrões freqüentes em dados representados por estruturas mais complexas como árvores e grafos vêm crescendo muito nos últimos tempos. Entre as razões para esse crescimento está o fato do padrão arborescente ou em forma de grafo possuir mais informações do que os padrões seqüenciais, e na possibilidade de aplicação desse tipo de mineração em várias áreas como XML Mining, Web Mining e Bioinformática. Um problema que ocorre na mineração de padrões em geral é a grande quantidade de padrões gerados; sendo que muitos deles nem são do interesse do usuário. A diminuição da quantidade de padrões gerados pode ser feita restringido o tipo de padrão produzido através de especificações do usuário. Mesmo incorporando restrições no processo de mineração, a quantidade de padrões arborescentes minerados é grande, o que torna necessário uma ferramenta de análise dos padrões, possibilitando ao usuário especificar consultas para extrair da massa de padrões minerados aqueles que satisfazem os critérios de seleção da consulta. A mineração de padrões com restrição, visa obter como resultado de um processo de mineração apenas os padrões de real interesse do usuário. Uma restrição sobre padrões será representada de acordo com a estrutura dos mesmos. Para a mineração de padrões seqüencias uma forma de representá-la seria através de expressões regulares, para a mineração de padrões arborescentes, os autômatos de árvore. O uso de restrições resolve o problema da geração de uma grande quantidade de padrões, mas o mecanismo usado para representar a restrição ainda se constitui em um outro problema que seria a dificuldade de um usuário em fazer a entrada da restrição utilizando esse mecanismo. As consultas sobre padrões freqüentes são feitas de acordo com as características dos dados. Uma forma de extrair padrões específicos em dados estruturados como árvores é armazenar os padrões freqüentes em um documento XML e efetuar uma consulta usando uma das linguagens de consulta a documentos XML. Dentre as linguagens de consulta XML, a linguagem XQuery é muito utilizada, principalmente pelo fato de ser similar semanticamente a SQL (linguaguem de consulta a banco de dados). A consulta aos padrões freqüentes poderia então ser feita utilizando essa linguagem, mas para isso o usuário teria que conhecer e ser capaz de expressar sua consulta através dela. Nesse trabalho é apresentada a linguagem visual VisTree, que consiste em uma ferramenta visual a ser utilizada tanto numa fase de Pré-processamento para a especificação das preferências do usuário no que se refere ao formato dos padrões arborescentes que lhe interessa, quanto numa fase de pós-processamento para a análise dos padrões minerados. A sintaxe da VisTree se baseia na sintaxe de um fragmento simples da linguagem Tree Pattern [Miklau and Suciu 2004, Chen et al. 2003], na qual a linguagem XPath 1.0 [Clark and Derose 1999, Olteanu et al. 2002] também se baseou. Entretanto, a semântica de VisTree difere da semântica destas linguagens no sentido de que consultas de VisTree retornam conjuntos de padrões arborescentes. A VisTree utiliza a linguagem XQuery [Chamberlin 2003, Katz et al. 2003] como mecanismo de processamento de consultas: as consultas visuais especificadas em VisTree são mapeadas em consultas da XQuery e suas respostas adaptadas para se adequarem ao formato retornado por VisTree. Um sistema completo de mineração de padrões arborescentes foi desenvolvido para testar e validar o uso da linguagem VisTree em contextos específicos de aplicações. O sistema foi construído de forma modular para que novas aplicações possam ser incorporadas de maneira simples. A aplicação de mineração de árvores com restrição nas áreas de XML Mining e Web Mining foi feita através de um estudo de caso. Nas duas aplicações, o sistema utiliza a linguagem VisTree nos módulos que fazem a tarefa de Pré-Processamento (entrada da restrição) e de Análise de Padrões (entrada da consulta). / Mestre em Ciência da Computação

Cette thèse concerne l'ingénierie des systèmes complexes à partir d'une dynamique souhaitée. En particulier, nous nous intéressons aux populations d'oscillateurs et aux réseaux de régulation génétique. Dans une première partie, nous nous fondons sur une hypothèse, introduite en neurosciences, qui souligne le rôle de la synchronisation neuronale dans le traitement de l'information cognitive. Nous proposons de l'utiliser sur un plan plus large pour étudier le traitement de l'information par des populations d'oscillateurs. Nous discutons des isochrons de quelques oscillateurs classés selon leurs symétries dans l'espace des états. Cela nous permet d'avoir un critère qualitatif pour choisir un oscillateur. Par la suite, nous définissons des procédures d'impression, de lecture et de réorganisation de l'information sur une population d'oscillateurs. En perspective, nous proposons un système à couches d'oscillateurs de Wilson-Cowan. Ce système juxtapose convenablement synchronisation et désynchronisation à travers l'utilisation de deux formes de couplage: un couplage continu et un couplage par pulsation. Nous finissons en proposant une application de ce système: la détection de contours dans une image. En deuxième partie, nous proposons d'utiliser une approche par contraintes pour identifier des réseaux de régulation génétique à partir de connaissances partielles sur leur dynamique et leur structure. Le formalisme que nous utilisons est connu sous le nom de réseaux d'automates booléens à seuil ou réseaux Hopfield-semblables. Nous appliquons cette méthode, afin de déterminer le réseau de régulation de la morphogenèse florale d'Arabidopsis thaliana. Nous montrons l'absence d'unicité des solutions dans l'ensemble des modèles valides (ici, 532 modèles). Nous montrons le potentiel de cette approche dans la détermination et la classification de modèles de réseaux de régulation génétique. L'ensemble de ces travaux mène à un certain nombre d'applications, en particulier dans le développement de nouvelles méthodes de stockage de l'information et dans le design de systèmes de calcul non conventionnel. / This thesis is concerned by the engineering of complex systems from a desired dynamics. Particularly, we are interested by populations of oscillators and genetical regulatory networks. In a first part, we start from a hypothesis introduced in neuroscience, which highlight the role of neural synchronization in the cognitive processing. We propose to use this hypothesis in a more general panorama to investigate the computing with populations of oscillators. We discuss about the isochrons of few oscillators selected according to their symmetry in the state space. Therefore, we define procedures for making footprints, for reading and for reorganizing information by a population of oscillators. As a perspective, we propose a system of lattices of Wilson-Cowan oscillators organized in several interconnected layers. This system properly mixes synchronization and desynchronization by using two types of coupling : pulsed and continuous coupling. At the end of this part, we propose to use this system in order to detect the edges of an image. In the second part, we propose a constraint-based approach to determine the structure of genetic regulatory networks starting from incomplete knowledge on their structure and their dynamics. The formalism we use is widely called thresholded Boolean automata networks or Hopfield-like networks. As an proof of concept, we apply this method to determine the regulatory network of Arabidopsis thaliana flower morphogenesis. We obtain 532 valid models instead of one unique solution and then classify them by using structural robustness criteria. By this way, we showed the potential of this approach in determining and classifying thresholded Boolean automata networks like genetic regulatory networks or neural networks. This works leads to many applications, in particular the developpement and the design of new methods for processing information and the design of systems of unconventional computing.

Made available in DSpace on 2014-06-12T15:57:08Z (GMT). No. of bitstreams: 2 arquivo3142_1.pdf: 2136149 bytes, checksum: 9584d05181d7f6e862c757ce418c8701 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2008 / de Siqueira Teles, Fabrício; Pierre Louis Robin, Jacques. Towards Model-Driven Engineering Constraint-Based Scheduling Applications. 2008. Dissertação (Mestrado). Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Pernambuco, Recife, 2008.

Orientador: Mauricio Ferreira Magalhães / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-08T01:20:28Z (GMT). No. of bitstreams: 1 Zuliani_LuizGustavo_M.pdf: 512812 bytes, checksum: cab94937633f70467669b12635e8ccb1 (MD5) Previous issue date: 2006 / Resumo: Redes totalmente ópticas (fotônicas) controladas por GMPLS (Generalized MultiProtocol Label Switching) são a promessa para lidar com o crescente volume de tráfego IP. Os protocolos de sinalização e roteamento GMPLS, principalmente OSPF (Open Shortest Path First) e RSVP (Resource ReSerVation Protocol), trabalham de tal modo que o cálculo da rota para circuitos ópticos não considera a disponibilidade de comprimentos de onda (labels). Esta solução não é ótima em termos do uso de recursos de rede e da probabilidade de bloqueio de novos circuitos. Para aprimorar este quadro, algoritmos RWA (Routing and Wavelength Assignment) mais eficientes poderiam ser usados para calcular a rota e o comprimento de onda simultaneamente. Estes algoritmos RWA necessitam conhecer a topologia óptica de um modo ainda não descrito pelas atuais especificações do protocolo OSPF. Esta dissertação propõe extensões de Engenharia de Tráfego para o protocolo OSPF para permitir que o plano de controle GMPLS se beneficie do uso de algoritmos RWA mais eficientes. Um protótipo foi desenvolvido e instalado em uma rede óptica emulada para verificar a praticabilidade da solução proposta baseado na sobrecarga de tráfego gerado no plano de controle / Abstract: GMPLS-controlled all-optical networks are the promise to handle the increasing volume of IP traffic. The GMPLS routing and signaling protocols, mainly OSPF and RSVP, work in such a way that the route calculation for optical circuits does not take into account the wavelength (label) availability. This is not optimal in terms of network resources usage and blocking probability of new circuits. To deal with this scenario, more efficient RWA algorithms could be used to calculate the route and the wavelength assignment at one time. These RWA engines need to know the optical topology in a way that is not described by current OSPF standards. This dissertation proposes Traffic Engineering extensions to the OSPF protocol to enable the GMPLS control plane to take advantage of the most effective RWA classes. A prototype was developed and deployed in an optical-emulated copper-based network to verify its feasibility based on the bandwidth overhead generated in the control plane / Mestrado / Engenharia de Computação / Mestre em Engenharia Elétrica