• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
10.11606/D.55.2018.tde-12012018-110620
Document
Author
Full name
Rumy Yamaguishi
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 1996
Supervisor
Committee
Ribeiro, Cassilda Maria (President)
Andrade Filho, Marinho Gomes de
Passos, Carlos Alberto dos Santos
Title in Portuguese
RESOLUCAO DE PROBLEMAS DE FLUXO EM REDES DE GRANDE DIMENSAO.
Keywords in Portuguese
Não disponível
Abstract in Portuguese
Nesta dissertação, propomos um algoritmo dual para resolver o problema de roteamento de dados. Este problema pode ser formulado como um problema de multifluxo a critério convexo. Nosso algoritmo explora a decomposição por arcos do lagrangeano. No primeiro capitulo relembramos alguns conceitos, definições e propriedades da teoria dos grafos. No segundo capitulo apresentamos dois métodos para a resolução de problemas de fluxo de custo mínimo com função linear. No terceiro capitulo apresentamos o método do particionamento e o método da decomposição pela atribuição do recurso, que são utilizados para resolver problemas de multifluxo a critério linear. O quarto capitulo é dedicado a apresentação do método Dual para a resolução do problema de roteamento de dados, bem como a análise e apresentação dos resultados computacionais. Na última parte apresentamos a conclusão e perspectivas de trabalhos futuros.
Title in English
Not available
Keywords in English
Not available
Abstract in English
In this thesis we propose a dual method for optimal routing in packetswitched network. The problem of finding optimal routes in a packet-switched network cari be formulated as a nonlinear multicommodity flow problem, In the first part, we recall some concepts, definitions and properties of graph theory. In the second part we present two methods for solving the minimal cost network flow problem. In the third part is devoted to presentation of primal algorithms for solving the linear multicommodity network flow problem. The fourth part deals with optimal routing in packet-switched network. We present in this section a dual method for optimal routing. Experimental results are presented and analysed in this section.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
RumyYamaguishi.pdf (59.42 Mbytes)
Publishing Date
2018-01-12
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2021. All rights reserved.